/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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:18:05,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:18:05,687 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:18:05,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:18:05,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:18:05,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:18:05,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:18:05,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:18:05,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:18:05,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:18:05,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:18:05,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:18:05,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:18:05,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:18:05,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:18:05,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:18:05,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:18:05,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:18:05,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:18:05,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:18:05,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:18:05,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:18:05,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:18:05,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:18:05,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:18:05,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:18:05,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:18:05,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:18:05,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:18:05,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:18:05,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:18:05,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:18:05,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:18:05,761 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:18:05,762 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:18:05,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:18:05,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:18:05,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:18:05,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:18:05,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:18:05,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:18:05,766 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-RepeatedSemanticLbe.epf [2022-12-13 03:18:05,791 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:18:05,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:18:05,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:18:05,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:18:05,793 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:18:05,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:18:05,793 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:18:05,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:18:05,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:18:05,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:18:05,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:18:05,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:18:05,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:18:05,794 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:18:05,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:18:05,794 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:18:05,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:18:05,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:18:05,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:18:05,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:18:05,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:18:05,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:18:05,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:18:05,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:18:05,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:18:05,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:18:05,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:18:05,796 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:18:05,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 03:18:06,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:18:06,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:18:06,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:18:06,104 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:18:06,105 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:18:06,106 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_tso.i [2022-12-13 03:18:07,207 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:18:07,471 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:18:07,471 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_tso.i [2022-12-13 03:18:07,486 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746b0d577/dd128d8b9d844c84839ee4d1e7ec8dbe/FLAGd750a88ef [2022-12-13 03:18:07,499 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746b0d577/dd128d8b9d844c84839ee4d1e7ec8dbe [2022-12-13 03:18:07,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:18:07,502 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:18:07,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:18:07,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:18:07,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:18:07,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:18:07" (1/1) ... [2022-12-13 03:18:07,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a0d9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:07, skipping insertion in model container [2022-12-13 03:18:07,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:18:07" (1/1) ... [2022-12-13 03:18:07,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:18:07,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:18:07,687 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_tso.i[945,958] [2022-12-13 03:18:07,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:18:07,833 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:18:07,843 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_tso.i[945,958] [2022-12-13 03:18:07,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:07,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:07,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:18:07,905 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:18:07,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:07 WrapperNode [2022-12-13 03:18:07,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:18:07,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:18:07,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:18:07,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:18:07,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:07" (1/1) ... [2022-12-13 03:18:07,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:07" (1/1) ... [2022-12-13 03:18:07,938 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2022-12-13 03:18:07,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:18:07,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:18:07,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:18:07,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:18:07,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:07" (1/1) ... [2022-12-13 03:18:07,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:07" (1/1) ... [2022-12-13 03:18:07,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:07" (1/1) ... [2022-12-13 03:18:07,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:07" (1/1) ... [2022-12-13 03:18:07,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:07" (1/1) ... [2022-12-13 03:18:07,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:07" (1/1) ... [2022-12-13 03:18:07,961 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:07" (1/1) ... [2022-12-13 03:18:07,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:07" (1/1) ... [2022-12-13 03:18:07,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:18:07,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:18:07,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:18:07,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:18:07,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:07" (1/1) ... [2022-12-13 03:18:07,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:18:07,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:18:08,014 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-13 03:18:08,031 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-13 03:18:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:18:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 03:18:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:18:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:18:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:18:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 03:18:08,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 03:18:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 03:18:08,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 03:18:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 03:18:08,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 03:18:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:18:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 03:18:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:18:08,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:18:08,048 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 03:18:08,167 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:18:08,169 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:18:08,333 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:18:08,337 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:18:08,338 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:18:08,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:18:08 BoogieIcfgContainer [2022-12-13 03:18:08,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:18:08,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:18:08,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:18:08,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:18:08,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:18:07" (1/3) ... [2022-12-13 03:18:08,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181f8773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:18:08, skipping insertion in model container [2022-12-13 03:18:08,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:07" (2/3) ... [2022-12-13 03:18:08,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181f8773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:18:08, skipping insertion in model container [2022-12-13 03:18:08,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:18:08" (3/3) ... [2022-12-13 03:18:08,345 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_tso.i [2022-12-13 03:18:08,361 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:18:08,361 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 03:18:08,361 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:18:08,443 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 03:18:08,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 83 transitions, 181 flow [2022-12-13 03:18:08,518 INFO L130 PetriNetUnfolder]: 2/80 cut-off events. [2022-12-13 03:18:08,518 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:18:08,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 80 events. 2/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-12-13 03:18:08,522 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 83 transitions, 181 flow [2022-12-13 03:18:08,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 68 transitions, 145 flow [2022-12-13 03:18:08,528 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:08,546 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 68 transitions, 145 flow [2022-12-13 03:18:08,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 68 transitions, 145 flow [2022-12-13 03:18:08,578 INFO L130 PetriNetUnfolder]: 1/68 cut-off events. [2022-12-13 03:18:08,579 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:18:08,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 68 events. 1/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 03:18:08,582 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 68 transitions, 145 flow [2022-12-13 03:18:08,582 INFO L226 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-13 03:18:10,206 INFO L241 LiptonReduction]: Total number of compositions: 51 [2022-12-13 03:18:10,224 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:18:10,228 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=REPEATED_LIPTON_PN, 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;@7835d6f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:18:10,228 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 03:18:10,232 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 03:18:10,232 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:18:10,232 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:10,233 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:10,233 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:18:10,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:10,237 INFO L85 PathProgramCache]: Analyzing trace with hash -957557386, now seen corresponding path program 1 times [2022-12-13 03:18:10,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:10,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649523367] [2022-12-13 03:18:10,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:10,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:10,621 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-13 03:18:10,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:10,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649523367] [2022-12-13 03:18:10,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649523367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:10,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:10,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:18:10,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253613460] [2022-12-13 03:18:10,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:10,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:18:10,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:10,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:18:10,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:18:10,642 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 03:18:10,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-13 03:18:10,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:10,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 03:18:10,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:10,832 INFO L130 PetriNetUnfolder]: 1115/1830 cut-off events. [2022-12-13 03:18:10,832 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-13 03:18:10,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3633 conditions, 1830 events. 1115/1830 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9532 event pairs, 595 based on Foata normal form. 118/1616 useless extension candidates. Maximal degree in co-relation 3622. Up to 1114 conditions per place. [2022-12-13 03:18:10,844 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 30 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2022-12-13 03:18:10,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 175 flow [2022-12-13 03:18:10,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:18:10,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:18:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-13 03:18:10,853 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2022-12-13 03:18:10,857 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-13 03:18:10,857 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 43 transitions, 175 flow [2022-12-13 03:18:10,863 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 43 transitions, 175 flow [2022-12-13 03:18:10,872 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:10,873 INFO L89 Accepts]: Start accepts. Operand has 38 places, 43 transitions, 175 flow [2022-12-13 03:18:10,875 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:10,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:10,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 43 transitions, 175 flow [2022-12-13 03:18:10,878 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 43 transitions, 175 flow [2022-12-13 03:18:10,878 INFO L226 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-13 03:18:10,983 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:18:10,985 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 03:18:10,985 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 43 transitions, 175 flow [2022-12-13 03:18:10,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-13 03:18:10,985 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:10,985 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:10,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:18:10,989 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:18:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:10,989 INFO L85 PathProgramCache]: Analyzing trace with hash 380491147, now seen corresponding path program 1 times [2022-12-13 03:18:10,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:10,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058280184] [2022-12-13 03:18:10,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:10,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:11,109 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-13 03:18:11,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:11,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058280184] [2022-12-13 03:18:11,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058280184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:11,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:11,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:18:11,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721569510] [2022-12-13 03:18:11,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:11,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:18:11,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:11,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:18:11,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:18:11,111 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 03:18:11,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 43 transitions, 175 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:11,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:11,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 03:18:11,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:11,240 INFO L130 PetriNetUnfolder]: 1072/1793 cut-off events. [2022-12-13 03:18:11,240 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 03:18:11,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5199 conditions, 1793 events. 1072/1793 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 9594 event pairs, 147 based on Foata normal form. 12/1478 useless extension candidates. Maximal degree in co-relation 5185. Up to 1093 conditions per place. [2022-12-13 03:18:11,248 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 44 selfloop transitions, 11 changer transitions 0/61 dead transitions. [2022-12-13 03:18:11,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 61 transitions, 363 flow [2022-12-13 03:18:11,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:18:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:18:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 03:18:11,249 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074 [2022-12-13 03:18:11,250 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-13 03:18:11,251 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 61 transitions, 363 flow [2022-12-13 03:18:11,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 61 transitions, 363 flow [2022-12-13 03:18:11,269 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:11,269 INFO L89 Accepts]: Start accepts. Operand has 41 places, 61 transitions, 363 flow [2022-12-13 03:18:11,270 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:11,270 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:11,270 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 61 transitions, 363 flow [2022-12-13 03:18:11,273 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 61 transitions, 363 flow [2022-12-13 03:18:11,273 INFO L226 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-13 03:18:11,394 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:18:11,395 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 03:18:11,395 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 61 transitions, 367 flow [2022-12-13 03:18:11,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:11,396 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:11,396 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:11,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:18:11,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:18:11,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:11,396 INFO L85 PathProgramCache]: Analyzing trace with hash 380492170, now seen corresponding path program 1 times [2022-12-13 03:18:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:11,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209867766] [2022-12-13 03:18:11,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:11,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:11,511 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-13 03:18:11,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:11,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209867766] [2022-12-13 03:18:11,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209867766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:11,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:11,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:18:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183684553] [2022-12-13 03:18:11,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:11,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:18:11,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:11,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:18:11,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:18:11,516 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2022-12-13 03:18:11,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 61 transitions, 367 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:11,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:11,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2022-12-13 03:18:11,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:11,650 INFO L130 PetriNetUnfolder]: 927/1633 cut-off events. [2022-12-13 03:18:11,650 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-13 03:18:11,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6226 conditions, 1633 events. 927/1633 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 9158 event pairs, 90 based on Foata normal form. 10/1320 useless extension candidates. Maximal degree in co-relation 6209. Up to 964 conditions per place. [2022-12-13 03:18:11,658 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 61 selfloop transitions, 17 changer transitions 0/84 dead transitions. [2022-12-13 03:18:11,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 84 transitions, 669 flow [2022-12-13 03:18:11,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:18:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:18:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-13 03:18:11,660 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2022-12-13 03:18:11,661 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-13 03:18:11,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 84 transitions, 669 flow [2022-12-13 03:18:11,682 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 84 transitions, 669 flow [2022-12-13 03:18:11,690 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:11,691 INFO L89 Accepts]: Start accepts. Operand has 44 places, 84 transitions, 669 flow [2022-12-13 03:18:11,698 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:11,698 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:11,698 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 84 transitions, 669 flow [2022-12-13 03:18:11,700 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 84 transitions, 669 flow [2022-12-13 03:18:11,701 INFO L226 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-13 03:18:11,787 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:18:11,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 03:18:11,788 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 84 transitions, 675 flow [2022-12-13 03:18:11,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:11,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:11,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:11,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:18:11,789 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:18:11,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:11,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1089676267, now seen corresponding path program 1 times [2022-12-13 03:18:11,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:11,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115355903] [2022-12-13 03:18:11,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:11,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:11,895 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-13 03:18:11,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:11,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115355903] [2022-12-13 03:18:11,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115355903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:11,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:11,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:18:11,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077642349] [2022-12-13 03:18:11,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:11,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:18:11,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:11,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:18:11,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:18:11,897 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2022-12-13 03:18:11,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 84 transitions, 675 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-13 03:18:11,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:11,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2022-12-13 03:18:11,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:12,040 INFO L130 PetriNetUnfolder]: 896/1590 cut-off events. [2022-12-13 03:18:12,041 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-13 03:18:12,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7524 conditions, 1590 events. 896/1590 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 8933 event pairs, 81 based on Foata normal form. 8/1278 useless extension candidates. Maximal degree in co-relation 7504. Up to 943 conditions per place. [2022-12-13 03:18:12,049 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 69 selfloop transitions, 24 changer transitions 0/99 dead transitions. [2022-12-13 03:18:12,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 99 transitions, 978 flow [2022-12-13 03:18:12,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:18:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:18:12,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-13 03:18:12,050 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-13 03:18:12,050 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-12-13 03:18:12,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 99 transitions, 978 flow [2022-12-13 03:18:12,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 99 transitions, 978 flow [2022-12-13 03:18:12,065 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:12,065 INFO L89 Accepts]: Start accepts. Operand has 47 places, 99 transitions, 978 flow [2022-12-13 03:18:12,066 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:12,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:12,066 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 99 transitions, 978 flow [2022-12-13 03:18:12,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 99 transitions, 978 flow [2022-12-13 03:18:12,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-13 03:18:12,069 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:12,070 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 03:18:12,070 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 99 transitions, 978 flow [2022-12-13 03:18:12,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-13 03:18:12,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:12,070 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:12,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:18:12,070 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:18:12,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:12,071 INFO L85 PathProgramCache]: Analyzing trace with hash 579706885, now seen corresponding path program 1 times [2022-12-13 03:18:12,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:12,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704588577] [2022-12-13 03:18:12,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:12,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:12,127 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-13 03:18:12,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:12,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704588577] [2022-12-13 03:18:12,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704588577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:12,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:12,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:18:12,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354035229] [2022-12-13 03:18:12,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:12,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:18:12,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:12,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:18:12,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:18:12,129 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2022-12-13 03:18:12,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 99 transitions, 978 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-13 03:18:12,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:12,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2022-12-13 03:18:12,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:12,261 INFO L130 PetriNetUnfolder]: 1120/2060 cut-off events. [2022-12-13 03:18:12,261 INFO L131 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2022-12-13 03:18:12,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11198 conditions, 2060 events. 1120/2060 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 12848 event pairs, 114 based on Foata normal form. 30/1616 useless extension candidates. Maximal degree in co-relation 11175. Up to 1321 conditions per place. [2022-12-13 03:18:12,271 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 83 selfloop transitions, 8 changer transitions 4/112 dead transitions. [2022-12-13 03:18:12,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 112 transitions, 1299 flow [2022-12-13 03:18:12,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:18:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:18:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-13 03:18:12,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2022-12-13 03:18:12,273 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2022-12-13 03:18:12,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 112 transitions, 1299 flow [2022-12-13 03:18:12,280 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 108 transitions, 1250 flow [2022-12-13 03:18:12,292 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:12,292 INFO L89 Accepts]: Start accepts. Operand has 49 places, 108 transitions, 1250 flow [2022-12-13 03:18:12,293 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:12,293 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:12,293 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 108 transitions, 1250 flow [2022-12-13 03:18:12,296 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 108 transitions, 1250 flow [2022-12-13 03:18:12,296 INFO L226 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-13 03:18:12,297 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:12,297 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 03:18:12,298 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 108 transitions, 1250 flow [2022-12-13 03:18:12,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-13 03:18:12,298 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:12,298 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:12,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:18:12,298 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:18:12,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:12,298 INFO L85 PathProgramCache]: Analyzing trace with hash 579748208, now seen corresponding path program 1 times [2022-12-13 03:18:12,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:12,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233712093] [2022-12-13 03:18:12,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:12,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:12,402 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-13 03:18:12,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:12,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233712093] [2022-12-13 03:18:12,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233712093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:12,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:12,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:18:12,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762838476] [2022-12-13 03:18:12,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:12,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:18:12,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:12,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:18:12,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:18:12,404 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 03:18:12,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 108 transitions, 1250 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-13 03:18:12,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:12,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 03:18:12,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:12,639 INFO L130 PetriNetUnfolder]: 1616/2843 cut-off events. [2022-12-13 03:18:12,639 INFO L131 PetriNetUnfolder]: For 4340/4537 co-relation queries the response was YES. [2022-12-13 03:18:12,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16286 conditions, 2843 events. 1616/2843 cut-off events. For 4340/4537 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 18474 event pairs, 202 based on Foata normal form. 123/2340 useless extension candidates. Maximal degree in co-relation 16260. Up to 1639 conditions per place. [2022-12-13 03:18:12,651 INFO L137 encePairwiseOnDemand]: 14/27 looper letters, 99 selfloop transitions, 34 changer transitions 111/263 dead transitions. [2022-12-13 03:18:12,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 263 transitions, 3526 flow [2022-12-13 03:18:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:18:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:18:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-13 03:18:12,653 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2022-12-13 03:18:12,656 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2022-12-13 03:18:12,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 263 transitions, 3526 flow [2022-12-13 03:18:12,664 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 152 transitions, 2032 flow [2022-12-13 03:18:12,681 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:12,682 INFO L89 Accepts]: Start accepts. Operand has 50 places, 152 transitions, 2032 flow [2022-12-13 03:18:12,683 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:12,683 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:12,683 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 152 transitions, 2032 flow [2022-12-13 03:18:12,690 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 152 transitions, 2032 flow [2022-12-13 03:18:12,691 INFO L226 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-13 03:18:12,692 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:12,693 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 03:18:12,693 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 152 transitions, 2032 flow [2022-12-13 03:18:12,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-13 03:18:12,693 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:12,693 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:12,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:18:12,693 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:18:12,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:12,699 INFO L85 PathProgramCache]: Analyzing trace with hash 559434530, now seen corresponding path program 1 times [2022-12-13 03:18:12,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:12,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108725996] [2022-12-13 03:18:12,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:12,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:12,766 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-13 03:18:12,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:12,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108725996] [2022-12-13 03:18:12,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108725996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:12,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:12,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:18:12,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275143614] [2022-12-13 03:18:12,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:12,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:18:12,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:12,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:18:12,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:18:12,767 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 03:18:12,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 152 transitions, 2032 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-13 03:18:12,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:12,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 03:18:12,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:12,956 INFO L130 PetriNetUnfolder]: 1329/2434 cut-off events. [2022-12-13 03:18:12,956 INFO L131 PetriNetUnfolder]: For 4301/4463 co-relation queries the response was YES. [2022-12-13 03:18:12,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15794 conditions, 2434 events. 1329/2434 cut-off events. For 4301/4463 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 16353 event pairs, 115 based on Foata normal form. 54/1892 useless extension candidates. Maximal degree in co-relation 15765. Up to 1962 conditions per place. [2022-12-13 03:18:12,966 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 127 selfloop transitions, 33 changer transitions 19/188 dead transitions. [2022-12-13 03:18:12,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 188 transitions, 2882 flow [2022-12-13 03:18:12,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:18:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:18:12,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-13 03:18:12,967 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.72 [2022-12-13 03:18:12,967 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2022-12-13 03:18:12,967 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 188 transitions, 2882 flow [2022-12-13 03:18:12,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 169 transitions, 2590 flow [2022-12-13 03:18:12,987 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:12,988 INFO L89 Accepts]: Start accepts. Operand has 53 places, 169 transitions, 2590 flow [2022-12-13 03:18:12,988 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:12,989 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:12,989 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 169 transitions, 2590 flow [2022-12-13 03:18:12,992 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 169 transitions, 2590 flow [2022-12-13 03:18:12,993 INFO L226 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-13 03:18:12,993 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:12,994 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 03:18:12,994 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 169 transitions, 2590 flow [2022-12-13 03:18:12,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-13 03:18:12,994 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:12,994 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:12,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:18:12,994 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:18:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash 584542794, now seen corresponding path program 1 times [2022-12-13 03:18:12,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:12,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978884534] [2022-12-13 03:18:12,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:12,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:13,043 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-13 03:18:13,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:13,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978884534] [2022-12-13 03:18:13,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978884534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:13,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:13,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:18:13,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179216439] [2022-12-13 03:18:13,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:13,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:18:13,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:13,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:18:13,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:18:13,044 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2022-12-13 03:18:13,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 169 transitions, 2590 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-13 03:18:13,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:13,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2022-12-13 03:18:13,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:13,224 INFO L130 PetriNetUnfolder]: 1500/2884 cut-off events. [2022-12-13 03:18:13,224 INFO L131 PetriNetUnfolder]: For 6944/7131 co-relation queries the response was YES. [2022-12-13 03:18:13,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20321 conditions, 2884 events. 1500/2884 cut-off events. For 6944/7131 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 21369 event pairs, 197 based on Foata normal form. 63/2189 useless extension candidates. Maximal degree in co-relation 20289. Up to 2408 conditions per place. [2022-12-13 03:18:13,236 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 144 selfloop transitions, 11 changer transitions 30/203 dead transitions. [2022-12-13 03:18:13,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 203 transitions, 3500 flow [2022-12-13 03:18:13,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:18:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:18:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-13 03:18:13,237 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 03:18:13,237 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2022-12-13 03:18:13,237 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 203 transitions, 3500 flow [2022-12-13 03:18:13,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 173 transitions, 2972 flow [2022-12-13 03:18:13,258 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:13,258 INFO L89 Accepts]: Start accepts. Operand has 55 places, 173 transitions, 2972 flow [2022-12-13 03:18:13,259 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:13,259 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:13,259 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 173 transitions, 2972 flow [2022-12-13 03:18:13,263 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 173 transitions, 2972 flow [2022-12-13 03:18:13,263 INFO L226 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-13 03:18:13,264 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:13,265 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 03:18:13,265 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 173 transitions, 2972 flow [2022-12-13 03:18:13,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-13 03:18:13,265 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:13,265 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:13,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:18:13,265 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:18:13,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:13,266 INFO L85 PathProgramCache]: Analyzing trace with hash -14113196, now seen corresponding path program 1 times [2022-12-13 03:18:13,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:13,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953295670] [2022-12-13 03:18:13,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:13,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:13,364 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-13 03:18:13,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:13,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953295670] [2022-12-13 03:18:13,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953295670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:13,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:13,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:18:13,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906116892] [2022-12-13 03:18:13,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:13,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:18:13,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:13,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:18:13,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:18:13,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 03:18:13,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 173 transitions, 2972 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-13 03:18:13,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:13,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 03:18:13,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:13,515 INFO L130 PetriNetUnfolder]: 887/1907 cut-off events. [2022-12-13 03:18:13,515 INFO L131 PetriNetUnfolder]: For 6029/6374 co-relation queries the response was YES. [2022-12-13 03:18:13,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14874 conditions, 1907 events. 887/1907 cut-off events. For 6029/6374 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 14297 event pairs, 2 based on Foata normal form. 195/1644 useless extension candidates. Maximal degree in co-relation 14839. Up to 1574 conditions per place. [2022-12-13 03:18:13,521 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 61 selfloop transitions, 55 changer transitions 83/211 dead transitions. [2022-12-13 03:18:13,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 211 transitions, 4005 flow [2022-12-13 03:18:13,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:18:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:18:13,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-13 03:18:13,522 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.74 [2022-12-13 03:18:13,523 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2022-12-13 03:18:13,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 211 transitions, 4005 flow [2022-12-13 03:18:13,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 128 transitions, 2371 flow [2022-12-13 03:18:13,537 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:13,537 INFO L89 Accepts]: Start accepts. Operand has 58 places, 128 transitions, 2371 flow [2022-12-13 03:18:13,538 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:13,538 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:13,538 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 128 transitions, 2371 flow [2022-12-13 03:18:13,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 128 transitions, 2371 flow [2022-12-13 03:18:13,541 INFO L226 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-13 03:18:13,542 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:13,542 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 03:18:13,542 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 128 transitions, 2371 flow [2022-12-13 03:18:13,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-13 03:18:13,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:13,543 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:13,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:18:13,543 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:18:13,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:13,543 INFO L85 PathProgramCache]: Analyzing trace with hash -679787917, now seen corresponding path program 1 times [2022-12-13 03:18:13,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:13,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044989880] [2022-12-13 03:18:13,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:13,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:13,612 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-13 03:18:13,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:13,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044989880] [2022-12-13 03:18:13,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044989880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:13,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:13,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:18:13,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280467639] [2022-12-13 03:18:13,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:13,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:18:13,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:13,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:18:13,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:18:13,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 03:18:13,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 128 transitions, 2371 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-13 03:18:13,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:13,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 03:18:13,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:13,701 INFO L130 PetriNetUnfolder]: 336/719 cut-off events. [2022-12-13 03:18:13,701 INFO L131 PetriNetUnfolder]: For 2822/2950 co-relation queries the response was YES. [2022-12-13 03:18:13,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6289 conditions, 719 events. 336/719 cut-off events. For 2822/2950 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4146 event pairs, 0 based on Foata normal form. 107/675 useless extension candidates. Maximal degree in co-relation 6251. Up to 614 conditions per place. [2022-12-13 03:18:13,704 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 0 selfloop transitions, 0 changer transitions 127/127 dead transitions. [2022-12-13 03:18:13,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 127 transitions, 2581 flow [2022-12-13 03:18:13,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:18:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:18:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-13 03:18:13,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.632 [2022-12-13 03:18:13,705 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2022-12-13 03:18:13,705 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 127 transitions, 2581 flow [2022-12-13 03:18:13,706 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 03:18:13,709 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:13,709 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:18:13,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:18:13,710 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:18:13,710 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:13,710 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 03:18:13,710 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 03:18:13,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-13 03:18:13,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 03:18:13,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 03:18:13,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 03:18:13,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 03:18:13,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 03:18:13,713 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:13,715 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:18:13,715 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:18:13,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:18:13 BasicIcfg [2022-12-13 03:18:13,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:18:13,717 INFO L158 Benchmark]: Toolchain (without parser) took 6215.61ms. Allocated memory was 237.0MB in the beginning and 422.6MB in the end (delta: 185.6MB). Free memory was 211.7MB in the beginning and 180.3MB in the end (delta: 31.4MB). Peak memory consumption was 218.0MB. Max. memory is 8.0GB. [2022-12-13 03:18:13,718 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 237.0MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:18:13,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.33ms. Allocated memory is still 237.0MB. Free memory was 211.2MB in the beginning and 188.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-13 03:18:13,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.26ms. Allocated memory is still 237.0MB. Free memory was 188.1MB in the beginning and 186.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:18:13,718 INFO L158 Benchmark]: Boogie Preprocessor took 25.33ms. Allocated memory is still 237.0MB. Free memory was 186.4MB in the beginning and 184.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 03:18:13,718 INFO L158 Benchmark]: RCFGBuilder took 375.09ms. Allocated memory is still 237.0MB. Free memory was 184.4MB in the beginning and 171.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 03:18:13,718 INFO L158 Benchmark]: TraceAbstraction took 5376.05ms. Allocated memory was 237.0MB in the beginning and 422.6MB in the end (delta: 185.6MB). Free memory was 170.3MB in the beginning and 180.3MB in the end (delta: -10.0MB). Peak memory consumption was 177.2MB. Max. memory is 8.0GB. [2022-12-13 03:18:13,719 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 237.0MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 400.33ms. Allocated memory is still 237.0MB. Free memory was 211.2MB in the beginning and 188.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.26ms. Allocated memory is still 237.0MB. Free memory was 188.1MB in the beginning and 186.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.33ms. Allocated memory is still 237.0MB. Free memory was 186.4MB in the beginning and 184.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 375.09ms. Allocated memory is still 237.0MB. Free memory was 184.4MB in the beginning and 171.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5376.05ms. Allocated memory was 237.0MB in the beginning and 422.6MB in the end (delta: 185.6MB). Free memory was 170.3MB in the beginning and 180.3MB in the end (delta: -10.0MB). Peak memory consumption was 177.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 77 PlacesBefore, 36 PlacesAfterwards, 68 TransitionsBefore, 27 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 18 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 51 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1084, independent: 1028, independent conditional: 1028, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1084, independent: 1028, independent conditional: 0, independent unconditional: 1028, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1084, independent: 1028, independent conditional: 0, independent unconditional: 1028, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1084, independent: 1028, independent conditional: 0, independent unconditional: 1028, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 786, independent: 743, independent conditional: 0, independent unconditional: 743, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 786, independent: 720, independent conditional: 0, independent unconditional: 720, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1084, independent: 285, independent conditional: 0, independent unconditional: 285, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 786, unknown conditional: 0, unknown unconditional: 786] , Statistics on independence cache: Total cache size (in pairs): 1173, Positive cache size: 1130, Positive conditional cache size: 0, Positive unconditional cache size: 1130, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 38 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 44 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 152 TransitionsBefore, 152 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 169 TransitionsBefore, 169 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 173 TransitionsBefore, 173 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 128 TransitionsBefore, 128 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 106 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 505 IncrementalHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 27 mSDtfsCounter, 505 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2972occurred in iteration=8, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 03:18:13,754 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...