/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:24:51,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:24:51,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:24:51,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:24:51,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:24:51,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:24:51,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:24:51,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:24:51,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:24:51,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:24:51,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:24:51,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:24:51,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:24:51,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:24:51,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:24:51,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:24:51,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:24:51,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:24:51,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:24:51,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:24:51,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:24:51,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:24:51,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:24:51,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:24:51,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:24:51,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:24:51,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:24:51,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:24:51,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:24:51,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:24:51,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:24:51,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:24:51,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:24:51,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:24:51,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:24:51,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:24:51,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:24:51,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:24:51,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:24:51,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:24:51,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:24:51,723 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:24:51,756 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:24:51,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:24:51,758 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:24:51,758 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:24:51,758 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:24:51,759 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:24:51,759 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:24:51,759 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:24:51,760 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:24:51,760 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:24:51,760 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:24:51,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:24:51,761 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:24:51,761 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:24:51,761 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:24:51,761 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:24:51,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:24:51,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:24:51,762 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:24:51,762 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:24:51,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:24:51,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:24:51,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:24:51,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:24:51,762 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:24:51,763 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:24:51,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:24:51,763 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:24:51,763 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 [2022-12-06 04:24:52,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:24:52,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:24:52,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:24:52,120 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:24:52,120 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:24:52,121 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_tso.i [2022-12-06 04:24:53,209 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:24:53,484 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:24:53,484 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_tso.i [2022-12-06 04:24:53,493 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77e88c8bb/6c6c965ed26a4945a8549c3a9561000f/FLAGf8489fe98 [2022-12-06 04:24:53,508 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77e88c8bb/6c6c965ed26a4945a8549c3a9561000f [2022-12-06 04:24:53,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:24:53,511 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:24:53,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:24:53,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:24:53,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:24:53,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:24:53" (1/1) ... [2022-12-06 04:24:53,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba5ecd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:53, skipping insertion in model container [2022-12-06 04:24:53,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:24:53" (1/1) ... [2022-12-06 04:24:53,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:24:53,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:24:53,719 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/safe002_tso.i[945,958] [2022-12-06 04:24:53,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:24:53,918 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:24:53,931 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/safe002_tso.i[945,958] [2022-12-06 04:24:53,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:53,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:53,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:24:54,021 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:24:54,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:54 WrapperNode [2022-12-06 04:24:54,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:24:54,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:24:54,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:24:54,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:24:54,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:54" (1/1) ... [2022-12-06 04:24:54,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:54" (1/1) ... [2022-12-06 04:24:54,082 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2022-12-06 04:24:54,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:24:54,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:24:54,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:24:54,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:24:54,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:54" (1/1) ... [2022-12-06 04:24:54,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:54" (1/1) ... [2022-12-06 04:24:54,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:54" (1/1) ... [2022-12-06 04:24:54,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:54" (1/1) ... [2022-12-06 04:24:54,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:54" (1/1) ... [2022-12-06 04:24:54,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:54" (1/1) ... [2022-12-06 04:24:54,115 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:54" (1/1) ... [2022-12-06 04:24:54,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:54" (1/1) ... [2022-12-06 04:24:54,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:24:54,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:24:54,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:24:54,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:24:54,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:54" (1/1) ... [2022-12-06 04:24:54,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:24:54,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:24:54,156 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-06 04:24:54,180 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-06 04:24:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:24:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:24:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:24:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:24:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:24:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:24:54,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:24:54,198 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:24:54,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:24:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:24:54,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:24:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:24:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:24:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:24:54,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:24:54,201 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:24:54,395 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:24:54,396 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:24:54,570 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:24:54,577 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:24:54,577 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:24:54,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:24:54 BoogieIcfgContainer [2022-12-06 04:24:54,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:24:54,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:24:54,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:24:54,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:24:54,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:24:53" (1/3) ... [2022-12-06 04:24:54,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617e788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:24:54, skipping insertion in model container [2022-12-06 04:24:54,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:54" (2/3) ... [2022-12-06 04:24:54,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617e788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:24:54, skipping insertion in model container [2022-12-06 04:24:54,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:24:54" (3/3) ... [2022-12-06 04:24:54,587 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_tso.i [2022-12-06 04:24:54,603 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:24:54,604 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:24:54,604 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:24:54,653 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:24:54,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 85 transitions, 185 flow [2022-12-06 04:24:54,731 INFO L130 PetriNetUnfolder]: 2/82 cut-off events. [2022-12-06 04:24:54,731 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:54,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 82 events. 2/82 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/79 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-12-06 04:24:54,736 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 85 transitions, 185 flow [2022-12-06 04:24:54,739 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 70 transitions, 149 flow [2022-12-06 04:24:54,740 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:54,765 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 70 transitions, 149 flow [2022-12-06 04:24:54,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 70 transitions, 149 flow [2022-12-06 04:24:54,803 INFO L130 PetriNetUnfolder]: 1/70 cut-off events. [2022-12-06 04:24:54,803 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:54,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 70 events. 1/70 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/69 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-06 04:24:54,806 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 70 transitions, 149 flow [2022-12-06 04:24:54,806 INFO L188 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-06 04:24:57,386 INFO L203 LiptonReduction]: Total number of compositions: 53 [2022-12-06 04:24:57,399 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:24:57,404 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;@3ed0634e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:24:57,405 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 04:24:57,409 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 04:24:57,409 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:57,409 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:57,410 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:57,410 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-06 04:24:57,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:57,414 INFO L85 PathProgramCache]: Analyzing trace with hash 229073430, now seen corresponding path program 1 times [2022-12-06 04:24:57,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:57,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633995479] [2022-12-06 04:24:57,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:57,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:57,597 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-06 04:24:57,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:57,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633995479] [2022-12-06 04:24:57,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633995479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:57,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:57,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:24:57,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905943215] [2022-12-06 04:24:57,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:57,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:24:57,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:57,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:24:57,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:24:57,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2022-12-06 04:24:57,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 45 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-06 04:24:57,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:57,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2022-12-06 04:24:57,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:57,710 INFO L130 PetriNetUnfolder]: 164/296 cut-off events. [2022-12-06 04:24:57,711 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 04:24:57,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 296 events. 164/296 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1225 event pairs, 164 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 586. Up to 271 conditions per place. [2022-12-06 04:24:57,715 INFO L137 encePairwiseOnDemand]: 17/18 looper letters, 14 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2022-12-06 04:24:57,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 17 transitions, 71 flow [2022-12-06 04:24:57,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:24:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:24:57,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2022-12-06 04:24:57,725 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 04:24:57,726 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 45 flow. Second operand 2 states and 21 transitions. [2022-12-06 04:24:57,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 17 transitions, 71 flow [2022-12-06 04:24:57,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 17 transitions, 68 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:24:57,730 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 40 flow [2022-12-06 04:24:57,732 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-06 04:24:57,735 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-06 04:24:57,735 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:57,736 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 40 flow [2022-12-06 04:24:57,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:57,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:57,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 40 flow [2022-12-06 04:24:57,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 17 transitions, 40 flow [2022-12-06 04:24:57,745 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-06 04:24:57,745 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:57,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:24:57,745 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 17 transitions, 40 flow [2022-12-06 04:24:57,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 04:24:57,768 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:24:57,770 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 04:24:57,770 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 40 flow [2022-12-06 04:24:57,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-06 04:24:57,771 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:57,771 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:57,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:24:57,772 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-06 04:24:57,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:57,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1488657983, now seen corresponding path program 1 times [2022-12-06 04:24:57,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:57,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426314200] [2022-12-06 04:24:57,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:57,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:58,069 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-06 04:24:58,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:58,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426314200] [2022-12-06 04:24:58,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426314200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:58,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:58,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:24:58,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467226707] [2022-12-06 04:24:58,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:58,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:24:58,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:58,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:24:58,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:24:58,075 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:24:58,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 40 flow. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-06 04:24:58,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:58,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:24:58,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:58,217 INFO L130 PetriNetUnfolder]: 557/896 cut-off events. [2022-12-06 04:24:58,217 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:58,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1848 conditions, 896 events. 557/896 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3933 event pairs, 184 based on Foata normal form. 42/938 useless extension candidates. Maximal degree in co-relation 1840. Up to 579 conditions per place. [2022-12-06 04:24:58,224 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 25 selfloop transitions, 6 changer transitions 0/31 dead transitions. [2022-12-06 04:24:58,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 31 transitions, 134 flow [2022-12-06 04:24:58,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:24:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:24:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 04:24:58,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 04:24:58,226 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states and 32 transitions. [2022-12-06 04:24:58,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 31 transitions, 134 flow [2022-12-06 04:24:58,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 31 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:24:58,228 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 86 flow [2022-12-06 04:24:58,228 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2022-12-06 04:24:58,229 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2022-12-06 04:24:58,229 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:58,229 INFO L89 Accepts]: Start accepts. Operand has 28 places, 22 transitions, 86 flow [2022-12-06 04:24:58,229 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:58,230 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:58,230 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 22 transitions, 86 flow [2022-12-06 04:24:58,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 22 transitions, 86 flow [2022-12-06 04:24:58,241 INFO L130 PetriNetUnfolder]: 47/135 cut-off events. [2022-12-06 04:24:58,241 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 04:24:58,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 135 events. 47/135 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 639 event pairs, 17 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 279. Up to 63 conditions per place. [2022-12-06 04:24:58,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 22 transitions, 86 flow [2022-12-06 04:24:58,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 04:24:58,245 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:24:58,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 04:24:58,246 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 86 flow [2022-12-06 04:24:58,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-06 04:24:58,246 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:58,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:58,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:24:58,247 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-06 04:24:58,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:58,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1096243217, now seen corresponding path program 1 times [2022-12-06 04:24:58,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:58,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593149910] [2022-12-06 04:24:58,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:58,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:58,373 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-06 04:24:58,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:58,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593149910] [2022-12-06 04:24:58,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593149910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:58,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:58,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:24:58,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118720696] [2022-12-06 04:24:58,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:58,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:24:58,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:58,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:24:58,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:24:58,375 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:24:58,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 86 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-06 04:24:58,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:58,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:24:58,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:58,470 INFO L130 PetriNetUnfolder]: 511/826 cut-off events. [2022-12-06 04:24:58,470 INFO L131 PetriNetUnfolder]: For 317/317 co-relation queries the response was YES. [2022-12-06 04:24:58,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2252 conditions, 826 events. 511/826 cut-off events. For 317/317 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3323 event pairs, 122 based on Foata normal form. 12/838 useless extension candidates. Maximal degree in co-relation 2240. Up to 415 conditions per place. [2022-12-06 04:24:58,476 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 29 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2022-12-06 04:24:58,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 202 flow [2022-12-06 04:24:58,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:24:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:24:58,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-06 04:24:58,478 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:24:58,478 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 86 flow. Second operand 4 states and 34 transitions. [2022-12-06 04:24:58,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 202 flow [2022-12-06 04:24:58,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:24:58,482 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 122 flow [2022-12-06 04:24:58,482 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2022-12-06 04:24:58,482 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2022-12-06 04:24:58,483 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:58,483 INFO L89 Accepts]: Start accepts. Operand has 32 places, 25 transitions, 122 flow [2022-12-06 04:24:58,484 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:58,484 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:58,484 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 122 flow [2022-12-06 04:24:58,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 122 flow [2022-12-06 04:24:58,494 INFO L130 PetriNetUnfolder]: 35/108 cut-off events. [2022-12-06 04:24:58,494 INFO L131 PetriNetUnfolder]: For 73/76 co-relation queries the response was YES. [2022-12-06 04:24:58,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 108 events. 35/108 cut-off events. For 73/76 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 438 event pairs, 11 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 271. Up to 53 conditions per place. [2022-12-06 04:24:58,496 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 122 flow [2022-12-06 04:24:58,496 INFO L188 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-06 04:24:58,498 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:24:58,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 04:24:58,499 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 122 flow [2022-12-06 04:24:58,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-06 04:24:58,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:58,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:58,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:24:58,500 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-06 04:24:58,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:58,500 INFO L85 PathProgramCache]: Analyzing trace with hash -376223193, now seen corresponding path program 1 times [2022-12-06 04:24:58,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:58,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473486420] [2022-12-06 04:24:58,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:58,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:58,628 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-06 04:24:58,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:58,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473486420] [2022-12-06 04:24:58,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473486420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:58,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:58,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:24:58,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916791935] [2022-12-06 04:24:58,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:58,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:24:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:58,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:24:58,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:24:58,631 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 04:24:58,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-06 04:24:58,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:58,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 04:24:58,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:58,754 INFO L130 PetriNetUnfolder]: 514/893 cut-off events. [2022-12-06 04:24:58,755 INFO L131 PetriNetUnfolder]: For 799/799 co-relation queries the response was YES. [2022-12-06 04:24:58,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2529 conditions, 893 events. 514/893 cut-off events. For 799/799 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4351 event pairs, 133 based on Foata normal form. 38/908 useless extension candidates. Maximal degree in co-relation 2514. Up to 364 conditions per place. [2022-12-06 04:24:58,761 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 29 selfloop transitions, 6 changer transitions 11/48 dead transitions. [2022-12-06 04:24:58,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 318 flow [2022-12-06 04:24:58,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:24:58,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:24:58,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 04:24:58,764 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6029411764705882 [2022-12-06 04:24:58,764 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 122 flow. Second operand 4 states and 41 transitions. [2022-12-06 04:24:58,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 318 flow [2022-12-06 04:24:58,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:24:58,770 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 145 flow [2022-12-06 04:24:58,770 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2022-12-06 04:24:58,771 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2022-12-06 04:24:58,773 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:58,773 INFO L89 Accepts]: Start accepts. Operand has 36 places, 24 transitions, 145 flow [2022-12-06 04:24:58,774 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:58,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:58,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 24 transitions, 145 flow [2022-12-06 04:24:58,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 24 transitions, 145 flow [2022-12-06 04:24:58,782 INFO L130 PetriNetUnfolder]: 14/62 cut-off events. [2022-12-06 04:24:58,782 INFO L131 PetriNetUnfolder]: For 69/71 co-relation queries the response was YES. [2022-12-06 04:24:58,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 62 events. 14/62 cut-off events. For 69/71 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 216 event pairs, 4 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 187. Up to 30 conditions per place. [2022-12-06 04:24:58,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 24 transitions, 145 flow [2022-12-06 04:24:58,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-06 04:24:58,786 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:24:58,793 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 04:24:58,793 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 145 flow [2022-12-06 04:24:58,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-06 04:24:58,793 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:58,793 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:58,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:24:58,793 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-06 04:24:58,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:58,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1196897395, now seen corresponding path program 1 times [2022-12-06 04:24:58,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:58,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445009855] [2022-12-06 04:24:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:58,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:58,907 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-06 04:24:58,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:58,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445009855] [2022-12-06 04:24:58,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445009855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:58,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:58,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:24:58,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902470139] [2022-12-06 04:24:58,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:58,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:24:58,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:58,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:24:58,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:24:58,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 04:24:58,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-06 04:24:58,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:58,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 04:24:58,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:59,014 INFO L130 PetriNetUnfolder]: 300/537 cut-off events. [2022-12-06 04:24:59,015 INFO L131 PetriNetUnfolder]: For 843/843 co-relation queries the response was YES. [2022-12-06 04:24:59,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 537 events. 300/537 cut-off events. For 843/843 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2334 event pairs, 87 based on Foata normal form. 30/567 useless extension candidates. Maximal degree in co-relation 1662. Up to 276 conditions per place. [2022-12-06 04:24:59,018 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 22 selfloop transitions, 4 changer transitions 9/37 dead transitions. [2022-12-06 04:24:59,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 274 flow [2022-12-06 04:24:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:24:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:24:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-06 04:24:59,019 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:24:59,019 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 145 flow. Second operand 4 states and 34 transitions. [2022-12-06 04:24:59,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 274 flow [2022-12-06 04:24:59,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 246 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 04:24:59,023 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 120 flow [2022-12-06 04:24:59,023 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2022-12-06 04:24:59,023 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2022-12-06 04:24:59,024 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:59,024 INFO L89 Accepts]: Start accepts. Operand has 37 places, 22 transitions, 120 flow [2022-12-06 04:24:59,024 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:59,024 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:59,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 22 transitions, 120 flow [2022-12-06 04:24:59,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 22 transitions, 120 flow [2022-12-06 04:24:59,029 INFO L130 PetriNetUnfolder]: 9/37 cut-off events. [2022-12-06 04:24:59,029 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-06 04:24:59,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 37 events. 9/37 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 83 event pairs, 2 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 107. Up to 21 conditions per place. [2022-12-06 04:24:59,030 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 22 transitions, 120 flow [2022-12-06 04:24:59,030 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 04:24:59,031 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [184] L741-->L744: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] and [254] $Ultimate##0-->L726: Formula: (and (= v_~y~0_61 v_~__unbuffered_p0_EAX~0_42) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_61} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_61, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] [2022-12-06 04:24:59,114 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:24:59,115 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 04:24:59,115 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 125 flow [2022-12-06 04:24:59,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-06 04:24:59,115 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:59,115 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:59,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:24:59,116 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-06 04:24:59,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:59,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1222881874, now seen corresponding path program 1 times [2022-12-06 04:24:59,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:59,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191924183] [2022-12-06 04:24:59,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:59,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:59,221 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-06 04:24:59,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:59,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191924183] [2022-12-06 04:24:59,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191924183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:59,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:59,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:24:59,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591289638] [2022-12-06 04:24:59,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:59,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:24:59,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:59,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:24:59,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:24:59,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 04:24:59,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 21 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-06 04:24:59,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:59,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 04:24:59,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:59,284 INFO L130 PetriNetUnfolder]: 152/283 cut-off events. [2022-12-06 04:24:59,285 INFO L131 PetriNetUnfolder]: For 470/470 co-relation queries the response was YES. [2022-12-06 04:24:59,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 283 events. 152/283 cut-off events. For 470/470 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1038 event pairs, 56 based on Foata normal form. 18/299 useless extension candidates. Maximal degree in co-relation 862. Up to 92 conditions per place. [2022-12-06 04:24:59,286 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 17 selfloop transitions, 2 changer transitions 15/35 dead transitions. [2022-12-06 04:24:59,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 230 flow [2022-12-06 04:24:59,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:24:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:24:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-06 04:24:59,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2022-12-06 04:24:59,288 INFO L175 Difference]: Start difference. First operand has 36 places, 21 transitions, 125 flow. Second operand 5 states and 39 transitions. [2022-12-06 04:24:59,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 230 flow [2022-12-06 04:24:59,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 191 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-12-06 04:24:59,290 INFO L231 Difference]: Finished difference. Result has 35 places, 16 transitions, 70 flow [2022-12-06 04:24:59,290 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=16} [2022-12-06 04:24:59,291 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2022-12-06 04:24:59,291 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:59,291 INFO L89 Accepts]: Start accepts. Operand has 35 places, 16 transitions, 70 flow [2022-12-06 04:24:59,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:59,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:59,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 16 transitions, 70 flow [2022-12-06 04:24:59,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 16 transitions, 70 flow [2022-12-06 04:24:59,295 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-06 04:24:59,295 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 04:24:59,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 18 events. 1/18 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 1 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 42. Up to 7 conditions per place. [2022-12-06 04:24:59,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 16 transitions, 70 flow [2022-12-06 04:24:59,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-06 04:24:59,319 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:24:59,320 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 04:24:59,320 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 15 transitions, 64 flow [2022-12-06 04:24:59,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-06 04:24:59,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:59,321 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:59,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:24:59,321 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-06 04:24:59,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:59,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1225709136, now seen corresponding path program 1 times [2022-12-06 04:24:59,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:59,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467803706] [2022-12-06 04:24:59,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:59,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:59,404 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-06 04:24:59,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:59,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467803706] [2022-12-06 04:24:59,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467803706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:59,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:59,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:24:59,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136714666] [2022-12-06 04:24:59,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:59,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:24:59,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:59,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:24:59,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:24:59,406 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 04:24:59,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 15 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-06 04:24:59,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:59,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 04:24:59,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:59,463 INFO L130 PetriNetUnfolder]: 54/115 cut-off events. [2022-12-06 04:24:59,464 INFO L131 PetriNetUnfolder]: For 320/323 co-relation queries the response was YES. [2022-12-06 04:24:59,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 115 events. 54/115 cut-off events. For 320/323 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 364 event pairs, 18 based on Foata normal form. 11/122 useless extension candidates. Maximal degree in co-relation 333. Up to 71 conditions per place. [2022-12-06 04:24:59,465 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 17 selfloop transitions, 4 changer transitions 12/34 dead transitions. [2022-12-06 04:24:59,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 202 flow [2022-12-06 04:24:59,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:24:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:24:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 04:24:59,467 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 04:24:59,467 INFO L175 Difference]: Start difference. First operand has 31 places, 15 transitions, 64 flow. Second operand 5 states and 40 transitions. [2022-12-06 04:24:59,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 202 flow [2022-12-06 04:24:59,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 174 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-06 04:24:59,470 INFO L231 Difference]: Finished difference. Result has 32 places, 18 transitions, 86 flow [2022-12-06 04:24:59,470 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=32, PETRI_TRANSITIONS=18} [2022-12-06 04:24:59,470 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2022-12-06 04:24:59,471 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:59,471 INFO L89 Accepts]: Start accepts. Operand has 32 places, 18 transitions, 86 flow [2022-12-06 04:24:59,471 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:59,471 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:59,471 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 18 transitions, 86 flow [2022-12-06 04:24:59,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 18 transitions, 86 flow [2022-12-06 04:24:59,479 INFO L130 PetriNetUnfolder]: 27/61 cut-off events. [2022-12-06 04:24:59,483 INFO L131 PetriNetUnfolder]: For 85/94 co-relation queries the response was YES. [2022-12-06 04:24:59,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 61 events. 27/61 cut-off events. For 85/94 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 155 event pairs, 15 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 181. Up to 39 conditions per place. [2022-12-06 04:24:59,484 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 18 transitions, 86 flow [2022-12-06 04:24:59,484 INFO L188 LiptonReduction]: Number of co-enabled transitions 32 [2022-12-06 04:24:59,544 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:24:59,545 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 04:24:59,545 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 91 flow [2022-12-06 04:24:59,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-06 04:24:59,545 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:59,546 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:59,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:24:59,546 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-06 04:24:59,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:59,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1238841398, now seen corresponding path program 1 times [2022-12-06 04:24:59,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:59,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259761263] [2022-12-06 04:24:59,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:59,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:59,647 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-06 04:24:59,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:59,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259761263] [2022-12-06 04:24:59,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259761263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:59,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:59,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:24:59,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800492870] [2022-12-06 04:24:59,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:59,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:24:59,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:59,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:24:59,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:24:59,650 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 04:24:59,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 18 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-06 04:24:59,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:59,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 04:24:59,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:59,704 INFO L130 PetriNetUnfolder]: 30/77 cut-off events. [2022-12-06 04:24:59,705 INFO L131 PetriNetUnfolder]: For 146/161 co-relation queries the response was YES. [2022-12-06 04:24:59,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 77 events. 30/77 cut-off events. For 146/161 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 213 event pairs, 5 based on Foata normal form. 11/87 useless extension candidates. Maximal degree in co-relation 289. Up to 46 conditions per place. [2022-12-06 04:24:59,705 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 18 selfloop transitions, 7 changer transitions 10/36 dead transitions. [2022-12-06 04:24:59,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 253 flow [2022-12-06 04:24:59,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:24:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:24:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-12-06 04:24:59,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4215686274509804 [2022-12-06 04:24:59,708 INFO L175 Difference]: Start difference. First operand has 30 places, 18 transitions, 91 flow. Second operand 6 states and 43 transitions. [2022-12-06 04:24:59,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 253 flow [2022-12-06 04:24:59,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 247 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:24:59,710 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 141 flow [2022-12-06 04:24:59,711 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2022-12-06 04:24:59,713 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2022-12-06 04:24:59,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:59,713 INFO L89 Accepts]: Start accepts. Operand has 36 places, 21 transitions, 141 flow [2022-12-06 04:24:59,714 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:59,714 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:59,714 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 141 flow [2022-12-06 04:24:59,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 21 transitions, 141 flow [2022-12-06 04:24:59,720 INFO L130 PetriNetUnfolder]: 12/41 cut-off events. [2022-12-06 04:24:59,720 INFO L131 PetriNetUnfolder]: For 117/133 co-relation queries the response was YES. [2022-12-06 04:24:59,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 41 events. 12/41 cut-off events. For 117/133 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 85 event pairs, 3 based on Foata normal form. 2/41 useless extension candidates. Maximal degree in co-relation 156. Up to 23 conditions per place. [2022-12-06 04:24:59,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 21 transitions, 141 flow [2022-12-06 04:24:59,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 24 [2022-12-06 04:24:59,757 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [259] $Ultimate##0-->L744: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg.offset_17| v_P1Thread1of1ForFork2_~arg.offset_17) (= v_~x~0_37 1) (= v_~y~0_101 1) (= |v_P1Thread1of1ForFork2_#in~arg.base_17| v_P1Thread1of1ForFork2_~arg.base_17)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_17|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_17|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_17|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_17, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_17, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_17|, ~y~0=v_~y~0_101, ~x~0=v_~x~0_37} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~y~0, ~x~0] and [260] $Ultimate##0-->L759: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.offset_21| v_P2Thread1of1ForFork0_~arg.offset_21) (= |v_P2Thread1of1ForFork0_#in~arg.base_21| v_P2Thread1of1ForFork0_~arg.base_21) (= v_~y~0_104 v_~__unbuffered_p2_EAX~0_64) (= v_~y~0_103 2)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~y~0=v_~y~0_104, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_21, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, ~y~0=v_~y~0_103, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0] [2022-12-06 04:24:59,790 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [261] $Ultimate##0-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg.base_19| v_P1Thread1of1ForFork2_~arg.base_19) (= v_~y~0_107 1) (= |v_P1Thread1of1ForFork2_#res.base_29| 0) (= v_~x~0_39 1) (= 0 |v_P1Thread1of1ForFork2_#res.offset_29|) (= v_~__unbuffered_cnt~0_235 (+ v_~__unbuffered_cnt~0_236 1)) (= |v_P1Thread1of1ForFork2_#in~arg.offset_19| v_P1Thread1of1ForFork2_~arg.offset_19)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_236, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_19, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_19, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_235, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~y~0=v_~y~0_107, ~x~0=v_~x~0_39, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork2_#res.base] and [260] $Ultimate##0-->L759: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.offset_21| v_P2Thread1of1ForFork0_~arg.offset_21) (= |v_P2Thread1of1ForFork0_#in~arg.base_21| v_P2Thread1of1ForFork0_~arg.base_21) (= v_~y~0_104 v_~__unbuffered_p2_EAX~0_64) (= v_~y~0_103 2)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~y~0=v_~y~0_104, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_21, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, ~y~0=v_~y~0_103, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0] [2022-12-06 04:24:59,861 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:24:59,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-06 04:24:59,863 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 144 flow [2022-12-06 04:24:59,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-06 04:24:59,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:59,864 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:59,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:24:59,864 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-06 04:24:59,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:59,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1231043709, now seen corresponding path program 1 times [2022-12-06 04:24:59,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:59,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765142699] [2022-12-06 04:24:59,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:59,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:59,973 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-06 04:24:59,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:59,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765142699] [2022-12-06 04:24:59,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765142699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:59,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:59,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:24:59,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834879425] [2022-12-06 04:24:59,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:59,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:24:59,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:59,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:24:59,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:24:59,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 04:24:59,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-06 04:24:59,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:59,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 04:24:59,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:00,037 INFO L130 PetriNetUnfolder]: 11/39 cut-off events. [2022-12-06 04:25:00,038 INFO L131 PetriNetUnfolder]: For 124/129 co-relation queries the response was YES. [2022-12-06 04:25:00,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 39 events. 11/39 cut-off events. For 124/129 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 87 event pairs, 0 based on Foata normal form. 5/44 useless extension candidates. Maximal degree in co-relation 177. Up to 24 conditions per place. [2022-12-06 04:25:00,038 INFO L137 encePairwiseOnDemand]: 8/17 looper letters, 11 selfloop transitions, 10 changer transitions 5/27 dead transitions. [2022-12-06 04:25:00,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 247 flow [2022-12-06 04:25:00,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:25:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:25:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-12-06 04:25:00,040 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29411764705882354 [2022-12-06 04:25:00,040 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 144 flow. Second operand 7 states and 35 transitions. [2022-12-06 04:25:00,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 247 flow [2022-12-06 04:25:00,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 194 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-12-06 04:25:00,041 INFO L231 Difference]: Finished difference. Result has 37 places, 20 transitions, 135 flow [2022-12-06 04:25:00,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=135, PETRI_PLACES=37, PETRI_TRANSITIONS=20} [2022-12-06 04:25:00,042 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2022-12-06 04:25:00,042 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:00,042 INFO L89 Accepts]: Start accepts. Operand has 37 places, 20 transitions, 135 flow [2022-12-06 04:25:00,043 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:00,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:00,044 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 20 transitions, 135 flow [2022-12-06 04:25:00,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 20 transitions, 135 flow [2022-12-06 04:25:00,047 INFO L130 PetriNetUnfolder]: 5/25 cut-off events. [2022-12-06 04:25:00,047 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-12-06 04:25:00,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 25 events. 5/25 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 37 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 79. Up to 11 conditions per place. [2022-12-06 04:25:00,048 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 20 transitions, 135 flow [2022-12-06 04:25:00,048 INFO L188 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-06 04:25:00,225 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:25:00,226 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 04:25:00,226 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 17 transitions, 130 flow [2022-12-06 04:25:00,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-06 04:25:00,227 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:00,227 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:00,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:25:00,227 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-06 04:25:00,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:00,227 INFO L85 PathProgramCache]: Analyzing trace with hash -375918411, now seen corresponding path program 1 times [2022-12-06 04:25:00,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:00,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230165855] [2022-12-06 04:25:00,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:00,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:00,362 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-06 04:25:00,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:00,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230165855] [2022-12-06 04:25:00,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230165855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:00,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:00,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:25:00,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153575356] [2022-12-06 04:25:00,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:00,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:25:00,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:00,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:25:00,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:25:00,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 04:25:00,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 17 transitions, 130 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-06 04:25:00,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:00,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 04:25:00,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:00,397 INFO L130 PetriNetUnfolder]: 5/19 cut-off events. [2022-12-06 04:25:00,397 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-06 04:25:00,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 19 events. 5/19 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 19 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 90. Up to 10 conditions per place. [2022-12-06 04:25:00,398 INFO L137 encePairwiseOnDemand]: 7/14 looper letters, 0 selfloop transitions, 0 changer transitions 18/18 dead transitions. [2022-12-06 04:25:00,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 18 transitions, 162 flow [2022-12-06 04:25:00,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:25:00,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:25:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-12-06 04:25:00,399 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22857142857142856 [2022-12-06 04:25:00,399 INFO L175 Difference]: Start difference. First operand has 32 places, 17 transitions, 130 flow. Second operand 5 states and 16 transitions. [2022-12-06 04:25:00,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 18 transitions, 162 flow [2022-12-06 04:25:00,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 18 transitions, 100 flow, removed 9 selfloop flow, removed 9 redundant places. [2022-12-06 04:25:00,400 INFO L231 Difference]: Finished difference. Result has 26 places, 0 transitions, 0 flow [2022-12-06 04:25:00,400 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=26, PETRI_TRANSITIONS=0} [2022-12-06 04:25:00,401 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2022-12-06 04:25:00,401 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:00,401 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 0 transitions, 0 flow [2022-12-06 04:25:00,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 04:25:00,401 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 04:25:00,402 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:00,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 04:25:00,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 04:25:00,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 04:25:00,402 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:00,403 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-06 04:25:00,403 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 04:25:00,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-06 04:25:00,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 04:25:00,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 04:25:00,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 04:25:00,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 04:25:00,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:25:00,407 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:00,409 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:25:00,409 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:25:00,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:25:00 BasicIcfg [2022-12-06 04:25:00,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:25:00,412 INFO L158 Benchmark]: Toolchain (without parser) took 6900.76ms. Allocated memory was 197.1MB in the beginning and 305.1MB in the end (delta: 108.0MB). Free memory was 158.2MB in the beginning and 196.2MB in the end (delta: -38.1MB). Peak memory consumption was 70.4MB. Max. memory is 8.0GB. [2022-12-06 04:25:00,412 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 173.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:25:00,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.18ms. Allocated memory is still 197.1MB. Free memory was 158.2MB in the beginning and 134.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-06 04:25:00,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.22ms. Allocated memory is still 197.1MB. Free memory was 134.6MB in the beginning and 132.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:25:00,413 INFO L158 Benchmark]: Boogie Preprocessor took 34.83ms. Allocated memory is still 197.1MB. Free memory was 132.9MB in the beginning and 131.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 04:25:00,413 INFO L158 Benchmark]: RCFGBuilder took 460.79ms. Allocated memory is still 197.1MB. Free memory was 131.4MB in the beginning and 117.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 04:25:00,413 INFO L158 Benchmark]: TraceAbstraction took 5830.09ms. Allocated memory was 197.1MB in the beginning and 305.1MB in the end (delta: 108.0MB). Free memory was 116.7MB in the beginning and 196.2MB in the end (delta: -79.5MB). Peak memory consumption was 29.5MB. Max. memory is 8.0GB. [2022-12-06 04:25:00,414 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.11ms. Allocated memory is still 197.1MB. Free memory is still 173.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 510.18ms. Allocated memory is still 197.1MB. Free memory was 158.2MB in the beginning and 134.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.22ms. Allocated memory is still 197.1MB. Free memory was 134.6MB in the beginning and 132.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.83ms. Allocated memory is still 197.1MB. Free memory was 132.9MB in the beginning and 131.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 460.79ms. Allocated memory is still 197.1MB. Free memory was 131.4MB in the beginning and 117.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5830.09ms. Allocated memory was 197.1MB in the beginning and 305.1MB in the end (delta: 108.0MB). Free memory was 116.7MB in the beginning and 196.2MB in the end (delta: -79.5MB). Peak memory consumption was 29.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 79 PlacesBefore, 27 PlacesAfterwards, 70 TransitionsBefore, 18 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 20 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 53 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 745, independent: 706, independent conditional: 706, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 745, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 745, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 745, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 654, independent: 621, independent conditional: 0, independent unconditional: 621, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 654, independent: 607, independent conditional: 0, independent unconditional: 607, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 133, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 745, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 654, unknown conditional: 0, unknown unconditional: 654] , Statistics on independence cache: Total cache size (in pairs): 971, Positive cache size: 938, Positive conditional cache size: 0, Positive unconditional cache size: 938, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, 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, 24 PlacesBefore, 24 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 55, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 48, unknown conditional: 0, unknown unconditional: 48] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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, 28 PlacesBefore, 28 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 12, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 41, Positive conditional cache size: 1, Positive unconditional cache size: 40, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 39, independent conditional: 5, independent unconditional: 34, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 39, independent conditional: 5, independent unconditional: 34, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 39, independent conditional: 5, independent unconditional: 34, dependent: 8, dependent conditional: 0, dependent unconditional: 8, 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: 47, independent: 39, independent conditional: 5, independent unconditional: 34, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 41, Positive conditional cache size: 1, Positive unconditional cache size: 40, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 43, independent: 36, independent conditional: 8, independent unconditional: 28, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 43, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 36 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 54, independent: 42, independent conditional: 15, independent unconditional: 27, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 54, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 59, Positive conditional cache size: 1, Positive unconditional cache size: 58, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 31 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 22, independent conditional: 6, independent unconditional: 16, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 22, independent conditional: 4, independent unconditional: 18, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 22, independent conditional: 4, independent unconditional: 18, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, 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: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 17, independent conditional: 2, independent unconditional: 15, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 65, Positive conditional cache size: 3, Positive unconditional cache size: 62, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 6, independent unconditional: 3, 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: 9, independent: 9, independent conditional: 6, independent unconditional: 3, 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: 9, independent: 9, independent conditional: 6, independent unconditional: 3, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 9, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 76, Positive conditional cache size: 4, Positive unconditional cache size: 72, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 34 PlacesBefore, 33 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 24 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 9, independent unconditional: 3, 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: 12, independent: 12, independent conditional: 8, independent unconditional: 4, 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: 12, independent: 12, independent conditional: 8, independent unconditional: 4, 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: 5, independent: 5, independent conditional: 2, independent unconditional: 3, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 12, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 94, Positive conditional cache size: 6, Positive unconditional cache size: 88, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 35 PlacesBefore, 32 PlacesAfterwards, 20 TransitionsBefore, 17 TransitionsAfterwards, 12 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 6, independent unconditional: 3, 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: 9, independent: 9, independent conditional: 6, independent unconditional: 3, 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: 9, independent: 9, independent conditional: 6, independent unconditional: 3, 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): 122, Positive cache size: 111, Positive conditional cache size: 6, Positive unconditional cache size: 105, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - 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): 122, Positive cache size: 111, Positive conditional cache size: 6, Positive unconditional cache size: 105, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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, 108 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.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 385 IncrementalHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 12 mSDtfsCounter, 385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=4, InterpolantAutomatonStates: 45, 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, 1.1s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 385 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-06 04:25:00,451 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...