/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:43:45,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:43:45,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:43:45,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:43:45,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:43:45,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:43:45,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:43:45,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:43:45,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:43:45,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:43:45,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:43:45,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:43:45,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:43:45,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:43:45,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:43:45,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:43:45,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:43:45,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:43:45,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:43:45,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:43:45,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:43:45,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:43:45,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:43:45,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:43:45,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:43:45,823 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:43:45,823 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:43:45,824 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:43:45,824 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:43:45,825 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:43:45,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:43:45,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:43:45,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:43:45,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:43:45,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:43:45,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:43:45,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:43:45,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:43:45,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:43:45,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:43:45,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:43:45,843 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 21:43:45,869 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:43:45,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:43:45,870 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:43:45,870 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:43:45,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:43:45,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:43:45,870 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:43:45,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:43:45,871 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:43:45,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:43:45,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:43:45,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:43:45,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:43:45,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:43:45,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:43:45,872 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:43:45,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:43:45,872 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:43:45,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:43:45,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:43:45,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:43:45,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:43:45,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:43:45,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:43:45,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:43:45,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:43:45,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:43:45,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:43:45,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:43:45,874 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:43:45,874 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:43:46,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:43:46,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:43:46,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:43:46,138 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:43:46,138 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:43:46,139 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 21:43:47,074 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:43:47,336 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:43:47,337 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 21:43:47,350 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eac47969b/47d921c2b05a45798c56da4db8efa10a/FLAG4a86f9a31 [2022-12-12 21:43:47,362 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eac47969b/47d921c2b05a45798c56da4db8efa10a [2022-12-12 21:43:47,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:43:47,365 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:43:47,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:43:47,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:43:47,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:43:47,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:43:47" (1/1) ... [2022-12-12 21:43:47,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d5ceab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:47, skipping insertion in model container [2022-12-12 21:43:47,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:43:47" (1/1) ... [2022-12-12 21:43:47,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:43:47,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:43:47,555 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-12 21:43:47,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:43:47,763 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:43:47,774 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-12 21:43:47,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:47,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:47,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:43:47,858 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:43:47,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:47 WrapperNode [2022-12-12 21:43:47,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:43:47,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:43:47,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:43:47,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:43:47,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:47" (1/1) ... [2022-12-12 21:43:47,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:47" (1/1) ... [2022-12-12 21:43:47,909 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-12-12 21:43:47,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:43:47,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:43:47,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:43:47,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:43:47,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:47" (1/1) ... [2022-12-12 21:43:47,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:47" (1/1) ... [2022-12-12 21:43:47,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:47" (1/1) ... [2022-12-12 21:43:47,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:47" (1/1) ... [2022-12-12 21:43:47,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:47" (1/1) ... [2022-12-12 21:43:47,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:47" (1/1) ... [2022-12-12 21:43:47,927 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:47" (1/1) ... [2022-12-12 21:43:47,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:47" (1/1) ... [2022-12-12 21:43:47,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:43:47,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:43:47,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:43:47,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:43:47,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:47" (1/1) ... [2022-12-12 21:43:47,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:43:47,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:43:47,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 21:43:47,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 21:43:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:43:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:43:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:43:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:43:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:43:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:43:48,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:43:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:43:48,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:43:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:43:48,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:43:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:43:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:43:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:43:48,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:43:48,013 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 21:43:48,169 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:43:48,170 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:43:48,448 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:43:48,535 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:43:48,535 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:43:48,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:43:48 BoogieIcfgContainer [2022-12-12 21:43:48,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:43:48,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:43:48,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:43:48,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:43:48,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:43:47" (1/3) ... [2022-12-12 21:43:48,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c35fe1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:43:48, skipping insertion in model container [2022-12-12 21:43:48,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:47" (2/3) ... [2022-12-12 21:43:48,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c35fe1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:43:48, skipping insertion in model container [2022-12-12 21:43:48,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:43:48" (3/3) ... [2022-12-12 21:43:48,545 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 21:43:48,558 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:43:48,559 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:43:48,559 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:43:48,624 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:43:48,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-12 21:43:48,712 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-12 21:43:48,712 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:43:48,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-12 21:43:48,718 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-12 21:43:48,721 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-12 21:43:48,723 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:43:48,744 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-12 21:43:48,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-12 21:43:48,769 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-12 21:43:48,770 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:43:48,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-12 21:43:48,772 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-12 21:43:48,772 INFO L226 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-12 21:43:56,314 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-12 21:43:56,325 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:43:56,329 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;@298d8895, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:43:56,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 21:43:56,331 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-12 21:43:56,331 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:43:56,331 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:56,332 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-12 21:43:56,332 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:43:56,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:56,335 INFO L85 PathProgramCache]: Analyzing trace with hash 493543, now seen corresponding path program 1 times [2022-12-12 21:43:56,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:56,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850801965] [2022-12-12 21:43:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:56,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:43:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:43:56,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:43:56,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850801965] [2022-12-12 21:43:56,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850801965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:43:56,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:43:56,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:43:56,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373668466] [2022-12-12 21:43:56,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:43:56,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:43:56,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:43:56,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:43:56,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:43:56,617 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 65 [2022-12-12 21:43:56,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:56,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:43:56,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 65 [2022-12-12 21:43:56,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:43:57,970 INFO L130 PetriNetUnfolder]: 7940/12809 cut-off events. [2022-12-12 21:43:57,971 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-12 21:43:57,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24247 conditions, 12809 events. 7940/12809 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 98035 event pairs, 1040 based on Foata normal form. 0/7897 useless extension candidates. Maximal degree in co-relation 24236. Up to 9645 conditions per place. [2022-12-12 21:43:58,006 INFO L137 encePairwiseOnDemand]: 61/65 looper letters, 34 selfloop transitions, 2 changer transitions 61/108 dead transitions. [2022-12-12 21:43:58,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 423 flow [2022-12-12 21:43:58,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:43:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:43:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2022-12-12 21:43:58,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2022-12-12 21:43:58,018 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2022-12-12 21:43:58,019 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 108 transitions, 423 flow [2022-12-12 21:43:58,034 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 47 transitions, 181 flow [2022-12-12 21:43:58,035 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 47 transitions, 181 flow [2022-12-12 21:43:58,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:58,035 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:58,035 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:43:58,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:43:58,036 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:43:58,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:58,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1622328720, now seen corresponding path program 1 times [2022-12-12 21:43:58,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:58,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662204709] [2022-12-12 21:43:58,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:58,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:43:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:43:58,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:43:58,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662204709] [2022-12-12 21:43:58,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662204709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:43:58,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:43:58,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:43:58,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141325685] [2022-12-12 21:43:58,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:43:58,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:43:58,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:43:58,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:43:58,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:43:58,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 65 [2022-12-12 21:43:58,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 47 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:58,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:43:58,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 65 [2022-12-12 21:43:58,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:43:59,084 INFO L130 PetriNetUnfolder]: 2223/3470 cut-off events. [2022-12-12 21:43:59,084 INFO L131 PetriNetUnfolder]: For 237/237 co-relation queries the response was YES. [2022-12-12 21:43:59,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9507 conditions, 3470 events. 2223/3470 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 17902 event pairs, 608 based on Foata normal form. 27/3039 useless extension candidates. Maximal degree in co-relation 9493. Up to 3026 conditions per place. [2022-12-12 21:43:59,100 INFO L137 encePairwiseOnDemand]: 55/65 looper letters, 55 selfloop transitions, 14 changer transitions 0/77 dead transitions. [2022-12-12 21:43:59,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 77 transitions, 438 flow [2022-12-12 21:43:59,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:43:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:43:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-12 21:43:59,101 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3423076923076923 [2022-12-12 21:43:59,102 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -28 predicate places. [2022-12-12 21:43:59,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 77 transitions, 438 flow [2022-12-12 21:43:59,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 77 transitions, 438 flow [2022-12-12 21:43:59,115 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 77 transitions, 438 flow [2022-12-12 21:43:59,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:59,115 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:59,115 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:43:59,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:43:59,115 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:43:59,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:59,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1247407776, now seen corresponding path program 1 times [2022-12-12 21:43:59,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:59,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652409528] [2022-12-12 21:43:59,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:59,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:43:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:43:59,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:43:59,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652409528] [2022-12-12 21:43:59,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652409528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:43:59,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:43:59,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:43:59,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500037156] [2022-12-12 21:43:59,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:43:59,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:43:59,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:43:59,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:43:59,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:43:59,252 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2022-12-12 21:43:59,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 77 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:59,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:43:59,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2022-12-12 21:43:59,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:43:59,523 INFO L130 PetriNetUnfolder]: 2195/3353 cut-off events. [2022-12-12 21:43:59,523 INFO L131 PetriNetUnfolder]: For 1155/1155 co-relation queries the response was YES. [2022-12-12 21:43:59,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12171 conditions, 3353 events. 2195/3353 cut-off events. For 1155/1155 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16265 event pairs, 483 based on Foata normal form. 10/2907 useless extension candidates. Maximal degree in co-relation 12154. Up to 2988 conditions per place. [2022-12-12 21:43:59,548 INFO L137 encePairwiseOnDemand]: 61/65 looper letters, 83 selfloop transitions, 7 changer transitions 0/103 dead transitions. [2022-12-12 21:43:59,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 103 transitions, 777 flow [2022-12-12 21:43:59,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:43:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:43:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-12 21:43:59,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3435897435897436 [2022-12-12 21:43:59,553 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -26 predicate places. [2022-12-12 21:43:59,554 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 103 transitions, 777 flow [2022-12-12 21:43:59,569 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 103 transitions, 777 flow [2022-12-12 21:43:59,569 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 103 transitions, 777 flow [2022-12-12 21:43:59,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:59,569 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:59,569 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:43:59,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:43:59,570 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:43:59,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:59,571 INFO L85 PathProgramCache]: Analyzing trace with hash -15283614, now seen corresponding path program 1 times [2022-12-12 21:43:59,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:59,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098403339] [2022-12-12 21:43:59,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:59,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:43:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:43:59,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:43:59,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098403339] [2022-12-12 21:43:59,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098403339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:43:59,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:43:59,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:43:59,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3490456] [2022-12-12 21:43:59,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:43:59,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:43:59,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:43:59,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:43:59,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:43:59,703 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2022-12-12 21:43:59,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 103 transitions, 777 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:59,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:43:59,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2022-12-12 21:43:59,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:00,026 INFO L130 PetriNetUnfolder]: 2170/3312 cut-off events. [2022-12-12 21:44:00,027 INFO L131 PetriNetUnfolder]: For 2412/2412 co-relation queries the response was YES. [2022-12-12 21:44:00,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14868 conditions, 3312 events. 2170/3312 cut-off events. For 2412/2412 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 16038 event pairs, 527 based on Foata normal form. 9/2867 useless extension candidates. Maximal degree in co-relation 14848. Up to 2954 conditions per place. [2022-12-12 21:44:00,048 INFO L137 encePairwiseOnDemand]: 61/65 looper letters, 116 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2022-12-12 21:44:00,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 144 transitions, 1360 flow [2022-12-12 21:44:00,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:44:00,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:44:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-12 21:44:00,049 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35384615384615387 [2022-12-12 21:44:00,050 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -24 predicate places. [2022-12-12 21:44:00,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 144 transitions, 1360 flow [2022-12-12 21:44:00,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 144 transitions, 1360 flow [2022-12-12 21:44:00,067 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 144 transitions, 1360 flow [2022-12-12 21:44:00,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:00,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:00,068 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:00,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:44:00,068 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:00,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:00,068 INFO L85 PathProgramCache]: Analyzing trace with hash -473848112, now seen corresponding path program 1 times [2022-12-12 21:44:00,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:00,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550384633] [2022-12-12 21:44:00,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:00,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:00,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:00,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550384633] [2022-12-12 21:44:00,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550384633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:00,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:00,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:44:00,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303320494] [2022-12-12 21:44:00,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:00,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:44:00,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:00,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:44:00,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:44:00,157 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2022-12-12 21:44:00,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 144 transitions, 1360 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:00,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:00,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2022-12-12 21:44:00,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:00,555 INFO L130 PetriNetUnfolder]: 3078/4830 cut-off events. [2022-12-12 21:44:00,555 INFO L131 PetriNetUnfolder]: For 6330/6330 co-relation queries the response was YES. [2022-12-12 21:44:00,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25670 conditions, 4830 events. 3078/4830 cut-off events. For 6330/6330 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 26719 event pairs, 721 based on Foata normal form. 136/4208 useless extension candidates. Maximal degree in co-relation 25647. Up to 4358 conditions per place. [2022-12-12 21:44:00,582 INFO L137 encePairwiseOnDemand]: 62/65 looper letters, 147 selfloop transitions, 7 changer transitions 7/178 dead transitions. [2022-12-12 21:44:00,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 178 transitions, 2034 flow [2022-12-12 21:44:00,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:44:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:44:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-12 21:44:00,583 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37435897435897436 [2022-12-12 21:44:00,584 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -22 predicate places. [2022-12-12 21:44:00,584 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 178 transitions, 2034 flow [2022-12-12 21:44:00,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 171 transitions, 1948 flow [2022-12-12 21:44:00,606 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 171 transitions, 1948 flow [2022-12-12 21:44:00,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:00,606 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:00,606 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:00,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:44:00,606 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:00,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:00,606 INFO L85 PathProgramCache]: Analyzing trace with hash -473742960, now seen corresponding path program 1 times [2022-12-12 21:44:00,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:00,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699976630] [2022-12-12 21:44:00,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:00,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:00,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:00,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699976630] [2022-12-12 21:44:00,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699976630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:00,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:00,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:44:00,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235916662] [2022-12-12 21:44:00,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:00,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:44:00,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:00,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:44:00,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:44:00,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2022-12-12 21:44:00,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 171 transitions, 1948 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:00,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:00,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2022-12-12 21:44:00,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:01,234 INFO L130 PetriNetUnfolder]: 4370/7041 cut-off events. [2022-12-12 21:44:01,235 INFO L131 PetriNetUnfolder]: For 11593/11593 co-relation queries the response was YES. [2022-12-12 21:44:01,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43305 conditions, 7041 events. 4370/7041 cut-off events. For 11593/11593 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 44840 event pairs, 380 based on Foata normal form. 142/5924 useless extension candidates. Maximal degree in co-relation 43279. Up to 6424 conditions per place. [2022-12-12 21:44:01,261 INFO L137 encePairwiseOnDemand]: 62/65 looper letters, 182 selfloop transitions, 8 changer transitions 11/215 dead transitions. [2022-12-12 21:44:01,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 215 transitions, 2878 flow [2022-12-12 21:44:01,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:44:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:44:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-12 21:44:01,263 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3641025641025641 [2022-12-12 21:44:01,263 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -20 predicate places. [2022-12-12 21:44:01,263 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 215 transitions, 2878 flow [2022-12-12 21:44:01,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 204 transitions, 2736 flow [2022-12-12 21:44:01,284 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 204 transitions, 2736 flow [2022-12-12 21:44:01,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:01,284 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:01,284 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:01,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:44:01,285 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:01,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:01,285 INFO L85 PathProgramCache]: Analyzing trace with hash -473741441, now seen corresponding path program 1 times [2022-12-12 21:44:01,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:01,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17838578] [2022-12-12 21:44:01,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:01,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:01,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:01,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17838578] [2022-12-12 21:44:01,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17838578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:01,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:01,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:44:01,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741801357] [2022-12-12 21:44:01,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:01,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:44:01,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:01,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:44:01,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:44:01,706 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2022-12-12 21:44:01,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 204 transitions, 2736 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:01,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:01,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2022-12-12 21:44:01,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:02,349 INFO L130 PetriNetUnfolder]: 4082/6730 cut-off events. [2022-12-12 21:44:02,349 INFO L131 PetriNetUnfolder]: For 14144/14144 co-relation queries the response was YES. [2022-12-12 21:44:02,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47181 conditions, 6730 events. 4082/6730 cut-off events. For 14144/14144 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 43745 event pairs, 481 based on Foata normal form. 10/5481 useless extension candidates. Maximal degree in co-relation 47152. Up to 6153 conditions per place. [2022-12-12 21:44:02,381 INFO L137 encePairwiseOnDemand]: 59/65 looper letters, 215 selfloop transitions, 23 changer transitions 13/266 dead transitions. [2022-12-12 21:44:02,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 266 transitions, 4095 flow [2022-12-12 21:44:02,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:44:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:44:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-12 21:44:02,382 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36153846153846153 [2022-12-12 21:44:02,382 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -17 predicate places. [2022-12-12 21:44:02,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 266 transitions, 4095 flow [2022-12-12 21:44:02,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 253 transitions, 3884 flow [2022-12-12 21:44:02,407 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 253 transitions, 3884 flow [2022-12-12 21:44:02,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:02,408 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:02,408 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:02,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:44:02,408 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:02,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:02,408 INFO L85 PathProgramCache]: Analyzing trace with hash -429118181, now seen corresponding path program 1 times [2022-12-12 21:44:02,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:02,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436579663] [2022-12-12 21:44:02,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:02,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:02,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:02,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436579663] [2022-12-12 21:44:02,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436579663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:02,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:02,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:44:02,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622752859] [2022-12-12 21:44:02,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:02,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:44:02,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:02,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:44:02,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:44:02,733 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2022-12-12 21:44:02,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 253 transitions, 3884 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:02,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:02,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2022-12-12 21:44:02,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:03,419 INFO L130 PetriNetUnfolder]: 3946/6567 cut-off events. [2022-12-12 21:44:03,419 INFO L131 PetriNetUnfolder]: For 16516/16516 co-relation queries the response was YES. [2022-12-12 21:44:03,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51544 conditions, 6567 events. 3946/6567 cut-off events. For 16516/16516 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 43100 event pairs, 465 based on Foata normal form. 24/5354 useless extension candidates. Maximal degree in co-relation 51512. Up to 5992 conditions per place. [2022-12-12 21:44:03,446 INFO L137 encePairwiseOnDemand]: 58/65 looper letters, 214 selfloop transitions, 22 changer transitions 10/261 dead transitions. [2022-12-12 21:44:03,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 261 transitions, 4504 flow [2022-12-12 21:44:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:44:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:44:03,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-12 21:44:03,448 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-12 21:44:03,448 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -14 predicate places. [2022-12-12 21:44:03,448 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 261 transitions, 4504 flow [2022-12-12 21:44:03,470 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 251 transitions, 4324 flow [2022-12-12 21:44:03,471 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 251 transitions, 4324 flow [2022-12-12 21:44:03,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:03,471 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:03,471 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:03,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:44:03,471 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:03,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:03,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1801086347, now seen corresponding path program 1 times [2022-12-12 21:44:03,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:03,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032333137] [2022-12-12 21:44:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:03,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:03,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:03,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032333137] [2022-12-12 21:44:03,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032333137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:03,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:03,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:44:03,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585520610] [2022-12-12 21:44:03,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:03,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:44:03,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:03,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:44:03,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:44:03,833 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2022-12-12 21:44:03,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 251 transitions, 4324 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:03,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:03,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2022-12-12 21:44:03,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:04,588 INFO L130 PetriNetUnfolder]: 4463/7422 cut-off events. [2022-12-12 21:44:04,588 INFO L131 PetriNetUnfolder]: For 24282/24282 co-relation queries the response was YES. [2022-12-12 21:44:04,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64744 conditions, 7422 events. 4463/7422 cut-off events. For 24282/24282 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 49987 event pairs, 333 based on Foata normal form. 25/6099 useless extension candidates. Maximal degree in co-relation 64709. Up to 6771 conditions per place. [2022-12-12 21:44:04,622 INFO L137 encePairwiseOnDemand]: 57/65 looper letters, 242 selfloop transitions, 35 changer transitions 11/303 dead transitions. [2022-12-12 21:44:04,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 303 transitions, 5836 flow [2022-12-12 21:44:04,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:44:04,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:44:04,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-12 21:44:04,624 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3169230769230769 [2022-12-12 21:44:04,624 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -10 predicate places. [2022-12-12 21:44:04,624 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 303 transitions, 5836 flow [2022-12-12 21:44:04,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 292 transitions, 5616 flow [2022-12-12 21:44:04,654 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 292 transitions, 5616 flow [2022-12-12 21:44:04,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:04,654 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:04,654 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:04,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:44:04,655 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:04,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:04,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1425043637, now seen corresponding path program 2 times [2022-12-12 21:44:04,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:04,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847737332] [2022-12-12 21:44:04,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:04,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:04,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:04,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847737332] [2022-12-12 21:44:04,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847737332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:04,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:04,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:44:04,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859323361] [2022-12-12 21:44:04,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:04,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:44:04,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:04,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:44:04,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:44:04,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2022-12-12 21:44:04,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 292 transitions, 5616 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:04,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:04,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2022-12-12 21:44:04,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:05,892 INFO L130 PetriNetUnfolder]: 4633/7754 cut-off events. [2022-12-12 21:44:05,892 INFO L131 PetriNetUnfolder]: For 31872/31872 co-relation queries the response was YES. [2022-12-12 21:44:05,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74172 conditions, 7754 events. 4633/7754 cut-off events. For 31872/31872 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 53039 event pairs, 309 based on Foata normal form. 43/6393 useless extension candidates. Maximal degree in co-relation 74134. Up to 7109 conditions per place. [2022-12-12 21:44:05,932 INFO L137 encePairwiseOnDemand]: 58/65 looper letters, 258 selfloop transitions, 42 changer transitions 21/336 dead transitions. [2022-12-12 21:44:05,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 336 transitions, 7138 flow [2022-12-12 21:44:05,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:44:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:44:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2022-12-12 21:44:05,934 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3153846153846154 [2022-12-12 21:44:05,934 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -5 predicate places. [2022-12-12 21:44:05,934 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 336 transitions, 7138 flow [2022-12-12 21:44:05,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 315 transitions, 6676 flow [2022-12-12 21:44:05,969 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 315 transitions, 6676 flow [2022-12-12 21:44:05,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:05,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:05,969 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:05,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:44:05,970 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:05,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:05,970 INFO L85 PathProgramCache]: Analyzing trace with hash -103160290, now seen corresponding path program 1 times [2022-12-12 21:44:05,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:05,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449198857] [2022-12-12 21:44:05,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:05,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:06,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:06,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449198857] [2022-12-12 21:44:06,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449198857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:06,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:06,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:44:06,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926482117] [2022-12-12 21:44:06,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:06,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:44:06,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:06,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:44:06,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:44:06,063 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 65 [2022-12-12 21:44:06,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 315 transitions, 6676 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 21:44:06,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:06,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 65 [2022-12-12 21:44:06,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:07,206 INFO L130 PetriNetUnfolder]: 5693/9479 cut-off events. [2022-12-12 21:44:07,206 INFO L131 PetriNetUnfolder]: For 82639/83408 co-relation queries the response was YES. [2022-12-12 21:44:07,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93234 conditions, 9479 events. 5693/9479 cut-off events. For 82639/83408 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 67596 event pairs, 871 based on Foata normal form. 275/8253 useless extension candidates. Maximal degree in co-relation 93193. Up to 8166 conditions per place. [2022-12-12 21:44:07,250 INFO L137 encePairwiseOnDemand]: 54/65 looper letters, 247 selfloop transitions, 56 changer transitions 48/368 dead transitions. [2022-12-12 21:44:07,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 368 transitions, 8502 flow [2022-12-12 21:44:07,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:44:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:44:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-12 21:44:07,251 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3641025641025641 [2022-12-12 21:44:07,251 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2022-12-12 21:44:07,251 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 368 transitions, 8502 flow [2022-12-12 21:44:07,285 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 320 transitions, 7350 flow [2022-12-12 21:44:07,286 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 320 transitions, 7350 flow [2022-12-12 21:44:07,286 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 21:44:07,286 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:07,286 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:07,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 21:44:07,286 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:07,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:07,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1088230462, now seen corresponding path program 1 times [2022-12-12 21:44:07,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:07,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436394483] [2022-12-12 21:44:07,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:07,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:07,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:07,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436394483] [2022-12-12 21:44:07,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436394483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:07,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:07,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:44:07,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389655835] [2022-12-12 21:44:07,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:07,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:44:07,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:07,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:44:07,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:44:07,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 65 [2022-12-12 21:44:07,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 320 transitions, 7350 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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 21:44:07,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:07,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 65 [2022-12-12 21:44:07,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:08,031 INFO L130 PetriNetUnfolder]: 2339/4562 cut-off events. [2022-12-12 21:44:08,031 INFO L131 PetriNetUnfolder]: For 45847/46367 co-relation queries the response was YES. [2022-12-12 21:44:08,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48817 conditions, 4562 events. 2339/4562 cut-off events. For 45847/46367 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 34052 event pairs, 219 based on Foata normal form. 510/4380 useless extension candidates. Maximal degree in co-relation 48773. Up to 3826 conditions per place. [2022-12-12 21:44:08,051 INFO L137 encePairwiseOnDemand]: 54/65 looper letters, 187 selfloop transitions, 77 changer transitions 54/335 dead transitions. [2022-12-12 21:44:08,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 335 transitions, 8289 flow [2022-12-12 21:44:08,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:44:08,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:44:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-12 21:44:08,052 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36923076923076925 [2022-12-12 21:44:08,053 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2022-12-12 21:44:08,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 335 transitions, 8289 flow [2022-12-12 21:44:08,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 281 transitions, 6885 flow [2022-12-12 21:44:08,069 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 281 transitions, 6885 flow [2022-12-12 21:44:08,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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 21:44:08,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:08,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:08,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 21:44:08,069 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:08,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:08,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1641276206, now seen corresponding path program 1 times [2022-12-12 21:44:08,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:08,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266004008] [2022-12-12 21:44:08,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:08,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:08,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:08,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:08,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266004008] [2022-12-12 21:44:08,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266004008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:08,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:08,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:44:08,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081829590] [2022-12-12 21:44:08,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:08,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:44:08,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:08,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:44:08,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:44:08,189 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 65 [2022-12-12 21:44:08,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 281 transitions, 6885 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:08,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:08,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 65 [2022-12-12 21:44:08,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:08,501 INFO L130 PetriNetUnfolder]: 967/2144 cut-off events. [2022-12-12 21:44:08,501 INFO L131 PetriNetUnfolder]: For 29526/29840 co-relation queries the response was YES. [2022-12-12 21:44:08,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23944 conditions, 2144 events. 967/2144 cut-off events. For 29526/29840 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 15252 event pairs, 26 based on Foata normal form. 373/2201 useless extension candidates. Maximal degree in co-relation 23897. Up to 1727 conditions per place. [2022-12-12 21:44:08,511 INFO L137 encePairwiseOnDemand]: 54/65 looper letters, 72 selfloop transitions, 48 changer transitions 150/278 dead transitions. [2022-12-12 21:44:08,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 278 transitions, 7329 flow [2022-12-12 21:44:08,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:44:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:44:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-12 21:44:08,513 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3230769230769231 [2022-12-12 21:44:08,513 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2022-12-12 21:44:08,513 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 278 transitions, 7329 flow [2022-12-12 21:44:08,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 128 transitions, 3282 flow [2022-12-12 21:44:08,521 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 128 transitions, 3282 flow [2022-12-12 21:44:08,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:08,521 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:08,521 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:08,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 21:44:08,521 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:08,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1362081605, now seen corresponding path program 1 times [2022-12-12 21:44:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:08,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491597175] [2022-12-12 21:44:08,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:08,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:09,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:09,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491597175] [2022-12-12 21:44:09,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491597175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:09,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:09,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 21:44:09,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578949376] [2022-12-12 21:44:09,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:09,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 21:44:09,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:09,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 21:44:09,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-12 21:44:09,260 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2022-12-12 21:44:09,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 128 transitions, 3282 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:09,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:09,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2022-12-12 21:44:09,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:09,577 INFO L130 PetriNetUnfolder]: 631/1307 cut-off events. [2022-12-12 21:44:09,577 INFO L131 PetriNetUnfolder]: For 13209/13243 co-relation queries the response was YES. [2022-12-12 21:44:09,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16748 conditions, 1307 events. 631/1307 cut-off events. For 13209/13243 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7779 event pairs, 0 based on Foata normal form. 35/1096 useless extension candidates. Maximal degree in co-relation 16698. Up to 1179 conditions per place. [2022-12-12 21:44:09,584 INFO L137 encePairwiseOnDemand]: 58/65 looper letters, 125 selfloop transitions, 23 changer transitions 32/195 dead transitions. [2022-12-12 21:44:09,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 195 transitions, 5508 flow [2022-12-12 21:44:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:44:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:44:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2022-12-12 21:44:09,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3098901098901099 [2022-12-12 21:44:09,586 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, 7 predicate places. [2022-12-12 21:44:09,586 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 195 transitions, 5508 flow [2022-12-12 21:44:09,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 163 transitions, 4545 flow [2022-12-12 21:44:09,592 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 163 transitions, 4545 flow [2022-12-12 21:44:09,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:09,592 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:09,593 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:09,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 21:44:09,593 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:09,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:09,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1186424879, now seen corresponding path program 1 times [2022-12-12 21:44:09,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:09,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288936426] [2022-12-12 21:44:09,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:09,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:10,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:10,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:10,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288936426] [2022-12-12 21:44:10,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288936426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:10,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:10,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:44:10,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921444878] [2022-12-12 21:44:10,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:10,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:44:10,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:10,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:44:10,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:44:10,168 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2022-12-12 21:44:10,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 163 transitions, 4545 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:10,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:10,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2022-12-12 21:44:10,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:10,410 INFO L130 PetriNetUnfolder]: 554/1254 cut-off events. [2022-12-12 21:44:10,411 INFO L131 PetriNetUnfolder]: For 12174/12189 co-relation queries the response was YES. [2022-12-12 21:44:10,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16521 conditions, 1254 events. 554/1254 cut-off events. For 12174/12189 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8113 event pairs, 0 based on Foata normal form. 33/1051 useless extension candidates. Maximal degree in co-relation 16468. Up to 1132 conditions per place. [2022-12-12 21:44:10,418 INFO L137 encePairwiseOnDemand]: 58/65 looper letters, 96 selfloop transitions, 14 changer transitions 73/196 dead transitions. [2022-12-12 21:44:10,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 196 transitions, 5897 flow [2022-12-12 21:44:10,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:44:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:44:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-12-12 21:44:10,420 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-12 21:44:10,420 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, 12 predicate places. [2022-12-12 21:44:10,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 196 transitions, 5897 flow [2022-12-12 21:44:10,425 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 123 transitions, 3613 flow [2022-12-12 21:44:10,426 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 123 transitions, 3613 flow [2022-12-12 21:44:10,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:10,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:10,426 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:10,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 21:44:10,426 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:10,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:10,427 INFO L85 PathProgramCache]: Analyzing trace with hash -656900994, now seen corresponding path program 1 times [2022-12-12 21:44:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:10,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701835836] [2022-12-12 21:44:10,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:10,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:44:10,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:44:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:44:10,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:44:10,524 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:44:10,525 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 21:44:10,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 21:44:10,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 21:44:10,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 21:44:10,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 21:44:10,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 21:44:10,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-12 21:44:10,531 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:10,536 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:44:10,536 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:44:10,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:44:10 BasicIcfg [2022-12-12 21:44:10,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:44:10,594 INFO L158 Benchmark]: Toolchain (without parser) took 23228.89ms. Allocated memory was 178.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 153.4MB in the beginning and 395.1MB in the end (delta: -241.7MB). Peak memory consumption was 872.9MB. Max. memory is 8.0GB. [2022-12-12 21:44:10,594 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:44:10,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.80ms. Allocated memory is still 178.3MB. Free memory was 152.9MB in the beginning and 126.6MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 21:44:10,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.73ms. Allocated memory is still 178.3MB. Free memory was 126.6MB in the beginning and 124.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 21:44:10,594 INFO L158 Benchmark]: Boogie Preprocessor took 19.74ms. Allocated memory is still 178.3MB. Free memory was 124.0MB in the beginning and 121.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:44:10,594 INFO L158 Benchmark]: RCFGBuilder took 606.87ms. Allocated memory is still 178.3MB. Free memory was 121.9MB in the beginning and 87.8MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-12 21:44:10,594 INFO L158 Benchmark]: TraceAbstraction took 22052.41ms. Allocated memory was 178.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 86.3MB in the beginning and 395.1MB in the end (delta: -308.8MB). Peak memory consumption was 805.8MB. Max. memory is 8.0GB. [2022-12-12 21:44:10,602 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 493.80ms. Allocated memory is still 178.3MB. Free memory was 152.9MB in the beginning and 126.6MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.73ms. Allocated memory is still 178.3MB. Free memory was 126.6MB in the beginning and 124.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.74ms. Allocated memory is still 178.3MB. Free memory was 124.0MB in the beginning and 121.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 606.87ms. Allocated memory is still 178.3MB. Free memory was 121.9MB in the beginning and 87.8MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 22052.41ms. Allocated memory was 178.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 86.3MB in the beginning and 395.1MB in the end (delta: -308.8MB). Peak memory consumption was 805.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 111 PlacesBefore, 75 PlacesAfterwards, 103 TransitionsBefore, 65 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 42 ConcurrentYvCompositions, 2 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3430, independent: 3182, independent conditional: 3182, independent unconditional: 0, dependent: 248, dependent conditional: 248, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3430, independent: 3182, independent conditional: 0, independent unconditional: 3182, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3430, independent: 3182, independent conditional: 0, independent unconditional: 3182, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3430, independent: 3182, independent conditional: 0, independent unconditional: 3182, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1689, independent: 1635, independent conditional: 0, independent unconditional: 1635, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1689, independent: 1606, independent conditional: 0, independent unconditional: 1606, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 365, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 339, dependent conditional: 0, dependent unconditional: 339, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3430, independent: 1547, independent conditional: 0, independent unconditional: 1547, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 1689, unknown conditional: 0, unknown unconditional: 1689] , Statistics on independence cache: Total cache size (in pairs): 3446, Positive cache size: 3392, Positive conditional cache size: 0, Positive unconditional cache size: 3392, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, 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; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=0, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=1, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=2, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.3s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 383 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 383 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1261 IncrementalHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 16 mSDtfsCounter, 1261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7350occurred in iteration=11, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 11393 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 1721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 21:44:10,623 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...