/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-a802222-m [2022-12-13 09:31:56,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:31:56,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:31:56,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:31:56,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:31:56,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:31:56,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:31:56,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:31:56,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:31:56,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:31:56,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:31:56,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:31:56,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:31:56,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:31:56,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:31:56,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:31:56,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:31:56,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:31:56,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:31:56,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:31:56,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:31:56,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:31:56,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:31:56,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:31:56,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:31:56,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:31:56,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:31:56,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:31:56,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:31:56,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:31:56,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:31:56,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:31:56,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:31:56,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:31:56,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:31:56,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:31:56,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:31:56,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:31:56,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:31:56,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:31:56,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:31:56,624 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-13 09:31:56,652 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:31:56,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:31:56,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:31:56,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:31:56,654 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:31:56,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:31:56,655 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:31:56,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:31:56,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:31:56,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:31:56,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:31:56,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:31:56,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:31:56,657 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:31:56,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:31:56,657 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:31:56,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:31:56,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:31:56,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:31:56,657 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:31:56,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:31:56,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:31:56,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:31:56,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:31:56,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:31:56,658 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:31:56,658 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:31:56,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:31:56,659 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:31:56,659 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-13 09:31:56,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:31:56,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:31:56,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:31:56,991 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:31:56,991 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:31:56,992 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-13 09:31:58,102 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:31:58,378 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:31:58,378 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_tso.i [2022-12-13 09:31:58,404 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2351cbefe/21eb7d4090854475b71fb2c71d4de135/FLAGf23260523 [2022-12-13 09:31:58,424 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2351cbefe/21eb7d4090854475b71fb2c71d4de135 [2022-12-13 09:31:58,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:31:58,428 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:31:58,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:31:58,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:31:58,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:31:58,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:31:58" (1/1) ... [2022-12-13 09:31:58,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@366325f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:58, skipping insertion in model container [2022-12-13 09:31:58,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:31:58" (1/1) ... [2022-12-13 09:31:58,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:31:58,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:31:58,674 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-13 09:31:58,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:31:58,857 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:31:58,871 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_tso.i[945,958] [2022-12-13 09:31:58,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:58,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:58,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:31:58,960 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:31:58,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:58 WrapperNode [2022-12-13 09:31:58,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:31:58,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:31:58,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:31:58,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:31:58,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:58" (1/1) ... [2022-12-13 09:31:58,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:58" (1/1) ... [2022-12-13 09:31:59,018 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2022-12-13 09:31:59,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:31:59,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:31:59,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:31:59,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:31:59,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:58" (1/1) ... [2022-12-13 09:31:59,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:58" (1/1) ... [2022-12-13 09:31:59,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:58" (1/1) ... [2022-12-13 09:31:59,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:58" (1/1) ... [2022-12-13 09:31:59,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:58" (1/1) ... [2022-12-13 09:31:59,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:58" (1/1) ... [2022-12-13 09:31:59,048 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:58" (1/1) ... [2022-12-13 09:31:59,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:58" (1/1) ... [2022-12-13 09:31:59,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:31:59,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:31:59,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:31:59,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:31:59,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:58" (1/1) ... [2022-12-13 09:31:59,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:31:59,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:31:59,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:31:59,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:31:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:31:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:31:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:31:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:31:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:31:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:31:59,127 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:31:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:31:59,127 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:31:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:31:59,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:31:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:31:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:31:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:31:59,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:31:59,130 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:31:59,287 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:31:59,288 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:31:59,462 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:31:59,467 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:31:59,468 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:31:59,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:31:59 BoogieIcfgContainer [2022-12-13 09:31:59,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:31:59,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:31:59,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:31:59,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:31:59,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:31:58" (1/3) ... [2022-12-13 09:31:59,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9fbb00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:31:59, skipping insertion in model container [2022-12-13 09:31:59,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:58" (2/3) ... [2022-12-13 09:31:59,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9fbb00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:31:59, skipping insertion in model container [2022-12-13 09:31:59,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:31:59" (3/3) ... [2022-12-13 09:31:59,477 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_tso.i [2022-12-13 09:31:59,495 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:31:59,495 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 09:31:59,495 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:31:59,572 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:31:59,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 85 transitions, 185 flow [2022-12-13 09:31:59,669 INFO L130 PetriNetUnfolder]: 2/82 cut-off events. [2022-12-13 09:31:59,670 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:31:59,674 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-13 09:31:59,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 85 transitions, 185 flow [2022-12-13 09:31:59,679 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 70 transitions, 149 flow [2022-12-13 09:31:59,681 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:59,702 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 70 transitions, 149 flow [2022-12-13 09:31:59,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 70 transitions, 149 flow [2022-12-13 09:31:59,736 INFO L130 PetriNetUnfolder]: 1/70 cut-off events. [2022-12-13 09:31:59,736 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:31:59,737 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-13 09:31:59,740 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 70 transitions, 149 flow [2022-12-13 09:31:59,740 INFO L226 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-13 09:32:01,972 INFO L241 LiptonReduction]: Total number of compositions: 53 [2022-12-13 09:32:01,992 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:32:01,998 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;@759653ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:32:01,998 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 09:32:02,003 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-13 09:32:02,003 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:32:02,003 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:02,004 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:02,004 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:32:02,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:02,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1488658015, now seen corresponding path program 1 times [2022-12-13 09:32:02,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:02,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807892138] [2022-12-13 09:32:02,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:02,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:02,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:02,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:02,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807892138] [2022-12-13 09:32:02,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807892138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:02,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:02,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:32:02,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20201686] [2022-12-13 09:32:02,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:02,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:32:02,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:02,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:32:02,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:32:02,495 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 09:32:02,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:02,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:02,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 09:32:02,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:02,739 INFO L130 PetriNetUnfolder]: 1244/2099 cut-off events. [2022-12-13 09:32:02,739 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-13 09:32:02,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4115 conditions, 2099 events. 1244/2099 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 11889 event pairs, 409 based on Foata normal form. 87/1762 useless extension candidates. Maximal degree in co-relation 4104. Up to 1212 conditions per place. [2022-12-13 09:32:02,759 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 31 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2022-12-13 09:32:02,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 175 flow [2022-12-13 09:32:02,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:02,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:32:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-13 09:32:02,769 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2022-12-13 09:32:02,770 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 58 transitions. [2022-12-13 09:32:02,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 175 flow [2022-12-13 09:32:02,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:32:02,778 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 104 flow [2022-12-13 09:32:02,780 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2022-12-13 09:32:02,783 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2022-12-13 09:32:02,783 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:02,784 INFO L89 Accepts]: Start accepts. Operand has 37 places, 31 transitions, 104 flow [2022-12-13 09:32:02,786 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:02,786 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:02,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 104 flow [2022-12-13 09:32:02,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 104 flow [2022-12-13 09:32:02,800 INFO L130 PetriNetUnfolder]: 47/200 cut-off events. [2022-12-13 09:32:02,800 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 09:32:02,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 200 events. 47/200 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1247 event pairs, 17 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 344. Up to 63 conditions per place. [2022-12-13 09:32:02,804 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 104 flow [2022-12-13 09:32:02,805 INFO L226 LiptonReduction]: Number of co-enabled transitions 428 [2022-12-13 09:32:02,811 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:32:02,812 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 09:32:02,812 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 104 flow [2022-12-13 09:32:02,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:02,813 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:02,813 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:02,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:32:02,813 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:32:02,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:02,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1096242255, now seen corresponding path program 1 times [2022-12-13 09:32:02,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:02,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473055189] [2022-12-13 09:32:02,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:02,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:02,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:02,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:02,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473055189] [2022-12-13 09:32:02,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473055189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:02,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:02,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:32:02,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091129631] [2022-12-13 09:32:02,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:02,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:32:02,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:02,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:32:02,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:32:02,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 09:32:02,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:02,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:02,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 09:32:02,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:03,114 INFO L130 PetriNetUnfolder]: 1162/1944 cut-off events. [2022-12-13 09:32:03,115 INFO L131 PetriNetUnfolder]: For 643/643 co-relation queries the response was YES. [2022-12-13 09:32:03,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4741 conditions, 1944 events. 1162/1944 cut-off events. For 643/643 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 10222 event pairs, 252 based on Foata normal form. 20/1558 useless extension candidates. Maximal degree in co-relation 4729. Up to 936 conditions per place. [2022-12-13 09:32:03,129 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 37 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2022-12-13 09:32:03,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 246 flow [2022-12-13 09:32:03,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:32:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:32:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-13 09:32:03,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2022-12-13 09:32:03,131 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 104 flow. Second operand 4 states and 66 transitions. [2022-12-13 09:32:03,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 246 flow [2022-12-13 09:32:03,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:32:03,138 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 140 flow [2022-12-13 09:32:03,138 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-13 09:32:03,139 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-13 09:32:03,139 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:03,139 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 140 flow [2022-12-13 09:32:03,140 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:03,140 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:03,141 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 140 flow [2022-12-13 09:32:03,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 140 flow [2022-12-13 09:32:03,154 INFO L130 PetriNetUnfolder]: 35/159 cut-off events. [2022-12-13 09:32:03,155 INFO L131 PetriNetUnfolder]: For 69/75 co-relation queries the response was YES. [2022-12-13 09:32:03,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 159 events. 35/159 cut-off events. For 69/75 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 871 event pairs, 11 based on Foata normal form. 1/109 useless extension candidates. Maximal degree in co-relation 322. Up to 53 conditions per place. [2022-12-13 09:32:03,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 140 flow [2022-12-13 09:32:03,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-13 09:32:03,161 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:32:03,163 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 09:32:03,163 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 140 flow [2022-12-13 09:32:03,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:03,163 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:03,163 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:03,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:32:03,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:32:03,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:03,166 INFO L85 PathProgramCache]: Analyzing trace with hash -376252985, now seen corresponding path program 1 times [2022-12-13 09:32:03,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:03,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301807830] [2022-12-13 09:32:03,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:03,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:03,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:03,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301807830] [2022-12-13 09:32:03,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301807830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:03,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:03,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:32:03,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366007932] [2022-12-13 09:32:03,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:03,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:32:03,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:03,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:32:03,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:32:03,333 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 09:32:03,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:03,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:03,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 09:32:03,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:03,551 INFO L130 PetriNetUnfolder]: 1250/2124 cut-off events. [2022-12-13 09:32:03,551 INFO L131 PetriNetUnfolder]: For 1437/1437 co-relation queries the response was YES. [2022-12-13 09:32:03,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5398 conditions, 2124 events. 1250/2124 cut-off events. For 1437/1437 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 11921 event pairs, 299 based on Foata normal form. 95/1769 useless extension candidates. Maximal degree in co-relation 5383. Up to 1122 conditions per place. [2022-12-13 09:32:03,561 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 37 selfloop transitions, 8 changer transitions 16/67 dead transitions. [2022-12-13 09:32:03,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 398 flow [2022-12-13 09:32:03,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:32:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:32:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-12-13 09:32:03,565 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6230769230769231 [2022-12-13 09:32:03,565 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 140 flow. Second operand 5 states and 81 transitions. [2022-12-13 09:32:03,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 398 flow [2022-12-13 09:32:03,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 67 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:32:03,571 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 158 flow [2022-12-13 09:32:03,572 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-12-13 09:32:03,573 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2022-12-13 09:32:03,573 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:03,573 INFO L89 Accepts]: Start accepts. Operand has 46 places, 33 transitions, 158 flow [2022-12-13 09:32:03,575 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:03,575 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:03,575 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 33 transitions, 158 flow [2022-12-13 09:32:03,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 33 transitions, 158 flow [2022-12-13 09:32:03,581 INFO L130 PetriNetUnfolder]: 13/71 cut-off events. [2022-12-13 09:32:03,581 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-12-13 09:32:03,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 71 events. 13/71 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 263 event pairs, 2 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 171. Up to 26 conditions per place. [2022-12-13 09:32:03,582 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 33 transitions, 158 flow [2022-12-13 09:32:03,582 INFO L226 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-13 09:32:03,583 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:32:03,587 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 09:32:03,587 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 158 flow [2022-12-13 09:32:03,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:03,588 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:03,588 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:03,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:32:03,588 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:32:03,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:03,588 INFO L85 PathProgramCache]: Analyzing trace with hash -468864653, now seen corresponding path program 1 times [2022-12-13 09:32:03,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:03,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428960317] [2022-12-13 09:32:03,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:03,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:03,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:03,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428960317] [2022-12-13 09:32:03,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428960317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:03,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:03,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:32:03,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541077310] [2022-12-13 09:32:03,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:03,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:32:03,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:03,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:32:03,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:32:03,703 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 09:32:03,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:03,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:03,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 09:32:03,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:03,808 INFO L130 PetriNetUnfolder]: 610/1042 cut-off events. [2022-12-13 09:32:03,808 INFO L131 PetriNetUnfolder]: For 1033/1033 co-relation queries the response was YES. [2022-12-13 09:32:03,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3023 conditions, 1042 events. 610/1042 cut-off events. For 1033/1033 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4942 event pairs, 151 based on Foata normal form. 9/833 useless extension candidates. Maximal degree in co-relation 3005. Up to 679 conditions per place. [2022-12-13 09:32:03,817 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 37 selfloop transitions, 9 changer transitions 0/52 dead transitions. [2022-12-13 09:32:03,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 52 transitions, 310 flow [2022-12-13 09:32:03,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:32:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:32:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-13 09:32:03,819 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2022-12-13 09:32:03,819 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 158 flow. Second operand 4 states and 68 transitions. [2022-12-13 09:32:03,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 52 transitions, 310 flow [2022-12-13 09:32:03,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 276 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-13 09:32:03,824 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 167 flow [2022-12-13 09:32:03,824 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-12-13 09:32:03,824 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2022-12-13 09:32:03,824 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:03,825 INFO L89 Accepts]: Start accepts. Operand has 45 places, 34 transitions, 167 flow [2022-12-13 09:32:03,825 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:03,825 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:03,825 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 167 flow [2022-12-13 09:32:03,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 167 flow [2022-12-13 09:32:03,831 INFO L130 PetriNetUnfolder]: 12/69 cut-off events. [2022-12-13 09:32:03,831 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-12-13 09:32:03,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 69 events. 12/69 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 251 event pairs, 2 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 163. Up to 24 conditions per place. [2022-12-13 09:32:03,832 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 34 transitions, 167 flow [2022-12-13 09:32:03,833 INFO L226 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-13 09:32:03,834 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:32:03,834 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 09:32:03,835 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 167 flow [2022-12-13 09:32:03,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:03,835 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:03,835 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:03,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:32:03,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:32:03,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:03,836 INFO L85 PathProgramCache]: Analyzing trace with hash -532317499, now seen corresponding path program 1 times [2022-12-13 09:32:03,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:03,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193350995] [2022-12-13 09:32:03,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:03,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:03,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:03,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193350995] [2022-12-13 09:32:03,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193350995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:03,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:03,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:32:03,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073605363] [2022-12-13 09:32:03,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:03,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:32:03,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:03,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:32:03,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:32:03,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 09:32:03,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:03,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:03,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 09:32:03,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:04,052 INFO L130 PetriNetUnfolder]: 581/1002 cut-off events. [2022-12-13 09:32:04,053 INFO L131 PetriNetUnfolder]: For 1082/1082 co-relation queries the response was YES. [2022-12-13 09:32:04,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2880 conditions, 1002 events. 581/1002 cut-off events. For 1082/1082 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4663 event pairs, 176 based on Foata normal form. 12/803 useless extension candidates. Maximal degree in co-relation 2863. Up to 491 conditions per place. [2022-12-13 09:32:04,061 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 36 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2022-12-13 09:32:04,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 298 flow [2022-12-13 09:32:04,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:32:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:32:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-13 09:32:04,062 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2022-12-13 09:32:04,062 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 167 flow. Second operand 4 states and 62 transitions. [2022-12-13 09:32:04,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 298 flow [2022-12-13 09:32:04,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 291 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 09:32:04,066 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 195 flow [2022-12-13 09:32:04,066 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2022-12-13 09:32:04,067 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2022-12-13 09:32:04,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:04,067 INFO L89 Accepts]: Start accepts. Operand has 49 places, 35 transitions, 195 flow [2022-12-13 09:32:04,068 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:04,068 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:04,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 35 transitions, 195 flow [2022-12-13 09:32:04,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 35 transitions, 195 flow [2022-12-13 09:32:04,074 INFO L130 PetriNetUnfolder]: 9/64 cut-off events. [2022-12-13 09:32:04,075 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-12-13 09:32:04,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 64 events. 9/64 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 237 event pairs, 2 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 162. Up to 19 conditions per place. [2022-12-13 09:32:04,076 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 35 transitions, 195 flow [2022-12-13 09:32:04,076 INFO L226 LiptonReduction]: Number of co-enabled transitions 390 [2022-12-13 09:32:04,077 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:32:04,078 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 09:32:04,078 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 195 flow [2022-12-13 09:32:04,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:04,078 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:04,078 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:04,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:32:04,078 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:32:04,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:04,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1586531691, now seen corresponding path program 1 times [2022-12-13 09:32:04,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:04,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832647389] [2022-12-13 09:32:04,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:04,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:04,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:04,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:04,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832647389] [2022-12-13 09:32:04,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832647389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:04,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:04,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:32:04,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376234278] [2022-12-13 09:32:04,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:04,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:32:04,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:04,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:32:04,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:32:04,222 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 09:32:04,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:04,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:04,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 09:32:04,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:04,377 INFO L130 PetriNetUnfolder]: 831/1446 cut-off events. [2022-12-13 09:32:04,377 INFO L131 PetriNetUnfolder]: For 2007/2007 co-relation queries the response was YES. [2022-12-13 09:32:04,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4233 conditions, 1446 events. 831/1446 cut-off events. For 2007/2007 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7445 event pairs, 272 based on Foata normal form. 36/1155 useless extension candidates. Maximal degree in co-relation 4213. Up to 617 conditions per place. [2022-12-13 09:32:04,387 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 33 selfloop transitions, 8 changer transitions 14/60 dead transitions. [2022-12-13 09:32:04,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 392 flow [2022-12-13 09:32:04,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:32:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:32:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-12-13 09:32:04,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5923076923076923 [2022-12-13 09:32:04,388 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 195 flow. Second operand 5 states and 77 transitions. [2022-12-13 09:32:04,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 392 flow [2022-12-13 09:32:04,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 376 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 09:32:04,394 INFO L231 Difference]: Finished difference. Result has 52 places, 31 transitions, 173 flow [2022-12-13 09:32:04,394 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=52, PETRI_TRANSITIONS=31} [2022-12-13 09:32:04,395 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2022-12-13 09:32:04,395 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:04,395 INFO L89 Accepts]: Start accepts. Operand has 52 places, 31 transitions, 173 flow [2022-12-13 09:32:04,396 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:04,396 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:04,396 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 31 transitions, 173 flow [2022-12-13 09:32:04,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 31 transitions, 173 flow [2022-12-13 09:32:04,401 INFO L130 PetriNetUnfolder]: 6/47 cut-off events. [2022-12-13 09:32:04,401 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 09:32:04,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 47 events. 6/47 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 143 event pairs, 2 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 127. Up to 16 conditions per place. [2022-12-13 09:32:04,401 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 31 transitions, 173 flow [2022-12-13 09:32:04,402 INFO L226 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-13 09:32:04,438 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [228] $Ultimate##0-->L756: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~y~0_35 v_~__unbuffered_p2_EAX~0_20)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_35, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~y~0=v_~y~0_35, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0] and [178] L726-->L729: Formula: (= v_~__unbuffered_p0_EBX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0] [2022-12-13 09:32:04,511 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [228] $Ultimate##0-->L756: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~y~0_35 v_~__unbuffered_p2_EAX~0_20)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_35, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~y~0=v_~y~0_35, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0] and [254] $Ultimate##0-->L726: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_61 v_~__unbuffered_p0_EAX~0_40)) 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_40, 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-13 09:32:04,565 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [258] $Ultimate##0-->L729: Formula: (and (= v_~__unbuffered_p0_EBX~0_55 v_~x~0_36) (= |v_P2Thread1of1ForFork0_#in~arg.base_11| v_P2Thread1of1ForFork0_~arg.base_11) (= v_~y~0_84 v_~__unbuffered_p2_EAX~0_54) (= |v_P2Thread1of1ForFork0_#in~arg.offset_11| v_P2Thread1of1ForFork0_~arg.offset_11)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, ~y~0=v_~y~0_84, ~x~0=v_~x~0_36, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_11, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_55, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~y~0=v_~y~0_84, ~x~0=v_~x~0_36, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, ~__unbuffered_p0_EBX~0, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0] and [190] L756-->L759: Formula: (= 2 v_~y~0_4) InVars {} OutVars{~y~0=v_~y~0_4} AuxVars[] AssignedVars[~y~0] [2022-12-13 09:32:04,601 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 09:32:04,601 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-13 09:32:04,602 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 166 flow [2022-12-13 09:32:04,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:04,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:04,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:04,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:32:04,602 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:32:04,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:04,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1221983431, now seen corresponding path program 1 times [2022-12-13 09:32:04,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:04,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359782274] [2022-12-13 09:32:04,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:04,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:04,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:04,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359782274] [2022-12-13 09:32:04,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359782274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:04,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:04,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:32:04,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144376648] [2022-12-13 09:32:04,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:04,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:32:04,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:04,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:32:04,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:32:04,692 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2022-12-13 09:32:04,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:04,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:04,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2022-12-13 09:32:04,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:04,827 INFO L130 PetriNetUnfolder]: 501/856 cut-off events. [2022-12-13 09:32:04,827 INFO L131 PetriNetUnfolder]: For 1551/1551 co-relation queries the response was YES. [2022-12-13 09:32:04,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2529 conditions, 856 events. 501/856 cut-off events. For 1551/1551 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4044 event pairs, 123 based on Foata normal form. 36/669 useless extension candidates. Maximal degree in co-relation 2507. Up to 355 conditions per place. [2022-12-13 09:32:04,832 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 21 selfloop transitions, 3 changer transitions 21/50 dead transitions. [2022-12-13 09:32:04,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 308 flow [2022-12-13 09:32:04,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:32:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:32:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-13 09:32:04,833 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2022-12-13 09:32:04,834 INFO L175 Difference]: Start difference. First operand has 47 places, 28 transitions, 166 flow. Second operand 6 states and 76 transitions. [2022-12-13 09:32:04,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 308 flow [2022-12-13 09:32:04,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 265 flow, removed 12 selfloop flow, removed 8 redundant places. [2022-12-13 09:32:04,836 INFO L231 Difference]: Finished difference. Result has 45 places, 23 transitions, 88 flow [2022-12-13 09:32:04,836 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=88, PETRI_PLACES=45, PETRI_TRANSITIONS=23} [2022-12-13 09:32:04,837 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2022-12-13 09:32:04,837 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:04,837 INFO L89 Accepts]: Start accepts. Operand has 45 places, 23 transitions, 88 flow [2022-12-13 09:32:04,838 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:04,838 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:04,838 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 23 transitions, 88 flow [2022-12-13 09:32:04,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 23 transitions, 88 flow [2022-12-13 09:32:04,841 INFO L130 PetriNetUnfolder]: 1/25 cut-off events. [2022-12-13 09:32:04,841 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-13 09:32:04,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 25 events. 1/25 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 40 event pairs, 1 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 49. Up to 7 conditions per place. [2022-12-13 09:32:04,842 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 23 transitions, 88 flow [2022-12-13 09:32:04,842 INFO L226 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-13 09:32:04,889 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:32:04,890 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 09:32:04,890 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 23 transitions, 88 flow [2022-12-13 09:32:04,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:04,890 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:04,890 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:04,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:32:04,891 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:32:04,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:04,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1221990065, now seen corresponding path program 1 times [2022-12-13 09:32:04,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:04,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510372259] [2022-12-13 09:32:04,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:04,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:04,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:04,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510372259] [2022-12-13 09:32:04,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510372259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:04,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:04,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:32:04,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533193323] [2022-12-13 09:32:04,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:04,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:32:04,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:04,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:32:04,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:32:04,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-13 09:32:04,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 23 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:04,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:04,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-13 09:32:04,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:05,101 INFO L130 PetriNetUnfolder]: 548/894 cut-off events. [2022-12-13 09:32:05,101 INFO L131 PetriNetUnfolder]: For 2523/2530 co-relation queries the response was YES. [2022-12-13 09:32:05,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2397 conditions, 894 events. 548/894 cut-off events. For 2523/2530 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 4405 event pairs, 242 based on Foata normal form. 67/517 useless extension candidates. Maximal degree in co-relation 2380. Up to 667 conditions per place. [2022-12-13 09:32:05,107 INFO L137 encePairwiseOnDemand]: 11/23 looper letters, 23 selfloop transitions, 10 changer transitions 24/60 dead transitions. [2022-12-13 09:32:05,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 319 flow [2022-12-13 09:32:05,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:32:05,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:32:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-13 09:32:05,109 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6434782608695652 [2022-12-13 09:32:05,109 INFO L175 Difference]: Start difference. First operand has 42 places, 23 transitions, 88 flow. Second operand 5 states and 74 transitions. [2022-12-13 09:32:05,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 319 flow [2022-12-13 09:32:05,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 60 transitions, 278 flow, removed 3 selfloop flow, removed 8 redundant places. [2022-12-13 09:32:05,113 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 158 flow [2022-12-13 09:32:05,113 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2022-12-13 09:32:05,113 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-13 09:32:05,113 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:05,114 INFO L89 Accepts]: Start accepts. Operand has 41 places, 32 transitions, 158 flow [2022-12-13 09:32:05,114 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:05,114 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:05,114 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 32 transitions, 158 flow [2022-12-13 09:32:05,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 158 flow [2022-12-13 09:32:05,149 INFO L130 PetriNetUnfolder]: 375/591 cut-off events. [2022-12-13 09:32:05,149 INFO L131 PetriNetUnfolder]: For 692/947 co-relation queries the response was YES. [2022-12-13 09:32:05,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 591 events. 375/591 cut-off events. For 692/947 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 2791 event pairs, 213 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 1835. Up to 493 conditions per place. [2022-12-13 09:32:05,153 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 32 transitions, 158 flow [2022-12-13 09:32:05,153 INFO L226 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-13 09:32:05,309 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:32:05,310 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-13 09:32:05,310 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 170 flow [2022-12-13 09:32:05,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:05,311 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:05,311 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:05,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:32:05,311 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:32:05,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:05,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1181553337, now seen corresponding path program 1 times [2022-12-13 09:32:05,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:05,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470298470] [2022-12-13 09:32:05,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:05,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:05,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:05,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470298470] [2022-12-13 09:32:05,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470298470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:05,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:05,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:32:05,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095636425] [2022-12-13 09:32:05,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:05,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:32:05,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:05,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:32:05,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:32:05,397 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-13 09:32:05,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:05,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:05,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-13 09:32:05,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:05,505 INFO L130 PetriNetUnfolder]: 398/710 cut-off events. [2022-12-13 09:32:05,505 INFO L131 PetriNetUnfolder]: For 1226/1397 co-relation queries the response was YES. [2022-12-13 09:32:05,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2859 conditions, 710 events. 398/710 cut-off events. For 1226/1397 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 3808 event pairs, 65 based on Foata normal form. 73/442 useless extension candidates. Maximal degree in co-relation 2844. Up to 568 conditions per place. [2022-12-13 09:32:05,510 INFO L137 encePairwiseOnDemand]: 11/29 looper letters, 24 selfloop transitions, 19 changer transitions 22/68 dead transitions. [2022-12-13 09:32:05,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 504 flow [2022-12-13 09:32:05,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:32:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:32:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-12-13 09:32:05,511 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4885057471264368 [2022-12-13 09:32:05,511 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 170 flow. Second operand 6 states and 85 transitions. [2022-12-13 09:32:05,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 504 flow [2022-12-13 09:32:05,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 492 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 09:32:05,517 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 310 flow [2022-12-13 09:32:05,517 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2022-12-13 09:32:05,518 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2022-12-13 09:32:05,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:05,518 INFO L89 Accepts]: Start accepts. Operand has 45 places, 41 transitions, 310 flow [2022-12-13 09:32:05,520 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:05,520 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:05,520 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 41 transitions, 310 flow [2022-12-13 09:32:05,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 41 transitions, 310 flow [2022-12-13 09:32:05,548 INFO L130 PetriNetUnfolder]: 252/453 cut-off events. [2022-12-13 09:32:05,548 INFO L131 PetriNetUnfolder]: For 1150/1441 co-relation queries the response was YES. [2022-12-13 09:32:05,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2135 conditions, 453 events. 252/453 cut-off events. For 1150/1441 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 2259 event pairs, 63 based on Foata normal form. 2/225 useless extension candidates. Maximal degree in co-relation 2120. Up to 361 conditions per place. [2022-12-13 09:32:05,552 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 41 transitions, 310 flow [2022-12-13 09:32:05,552 INFO L226 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-13 09:32:05,649 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [259] $Ultimate##0-->L744: Formula: (and (= v_~x~0_38 1) (= v_~y~0_86 1) (= |v_P1Thread1of1ForFork2_#in~arg.offset_16| v_P1Thread1of1ForFork2_~arg.offset_16) (= |v_P1Thread1of1ForFork2_#in~arg.base_16| v_P1Thread1of1ForFork2_~arg.base_16)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_16|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_16|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_16|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_16, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_16, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_16|, ~y~0=v_~y~0_86, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~y~0, ~x~0] and [261] $Ultimate##0-->L759: Formula: (and (= v_~y~0_91 v_~__unbuffered_p2_EAX~0_58) (= v_~y~0_90 2) (= |v_P2Thread1of1ForFork0_#in~arg.base_15| v_P2Thread1of1ForFork0_~arg.base_15) (= |v_P2Thread1of1ForFork0_#in~arg.offset_15| v_P2Thread1of1ForFork0_~arg.offset_15)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, ~y~0=v_~y~0_91, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_15, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_58, ~y~0=v_~y~0_90, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0] [2022-12-13 09:32:05,686 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [263] $Ultimate##0-->L749: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg.offset_18| v_P1Thread1of1ForFork2_~arg.offset_18) (= v_~__unbuffered_cnt~0_583 (+ v_~__unbuffered_cnt~0_584 1)) (= v_~x~0_42 1) (= v_~y~0_98 1) (= |v_P1Thread1of1ForFork2_#in~arg.base_18| v_P1Thread1of1ForFork2_~arg.base_18)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_584, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_18|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_18|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_18, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_18|, ~y~0=v_~y~0_98, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0] and [261] $Ultimate##0-->L759: Formula: (and (= v_~y~0_91 v_~__unbuffered_p2_EAX~0_58) (= v_~y~0_90 2) (= |v_P2Thread1of1ForFork0_#in~arg.base_15| v_P2Thread1of1ForFork0_~arg.base_15) (= |v_P2Thread1of1ForFork0_#in~arg.offset_15| v_P2Thread1of1ForFork0_~arg.offset_15)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, ~y~0=v_~y~0_91, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_15, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_58, ~y~0=v_~y~0_90, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0] [2022-12-13 09:32:05,730 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [264] $Ultimate##0-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg.offset_20| v_P1Thread1of1ForFork2_~arg.offset_20) (= v_~y~0_100 1) (= |v_P1Thread1of1ForFork2_#res.base_73| 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_73|) (= v_~__unbuffered_cnt~0_587 (+ v_~__unbuffered_cnt~0_588 1)) (= v_~x~0_44 1) (= |v_P1Thread1of1ForFork2_#in~arg.base_20| v_P1Thread1of1ForFork2_~arg.base_20)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_588, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_20|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_20|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_20, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_20, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_73|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_587, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_20|, ~y~0=v_~y~0_100, ~x~0=v_~x~0_44, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_73|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork2_#res.base] and [261] $Ultimate##0-->L759: Formula: (and (= v_~y~0_91 v_~__unbuffered_p2_EAX~0_58) (= v_~y~0_90 2) (= |v_P2Thread1of1ForFork0_#in~arg.base_15| v_P2Thread1of1ForFork0_~arg.base_15) (= |v_P2Thread1of1ForFork0_#in~arg.offset_15| v_P2Thread1of1ForFork0_~arg.offset_15)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, ~y~0=v_~y~0_91, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_15, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_58, ~y~0=v_~y~0_90, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0] [2022-12-13 09:32:05,788 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] $Ultimate##0-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg.offset_22| v_P1Thread1of1ForFork2_~arg.offset_22) (= |v_P1Thread1of1ForFork2_#in~arg.base_22| v_P1Thread1of1ForFork2_~arg.base_22) (= 0 |v_P1Thread1of1ForFork2_#res.offset_75|) (= |v_P1Thread1of1ForFork2_#res.base_75| 0) (= v_~x~0_46 1) (= v_~__unbuffered_cnt~0_591 (+ v_~__unbuffered_cnt~0_592 1)) (= v_~y~0_102 1)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_592, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_22|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_22|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_22, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_22, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_75|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_591, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_22|, ~y~0=v_~y~0_102, ~x~0=v_~x~0_46, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_75|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork2_#res.base] and [261] $Ultimate##0-->L759: Formula: (and (= v_~y~0_91 v_~__unbuffered_p2_EAX~0_58) (= v_~y~0_90 2) (= |v_P2Thread1of1ForFork0_#in~arg.base_15| v_P2Thread1of1ForFork0_~arg.base_15) (= |v_P2Thread1of1ForFork0_#in~arg.offset_15| v_P2Thread1of1ForFork0_~arg.offset_15)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, ~y~0=v_~y~0_91, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_15, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_58, ~y~0=v_~y~0_90, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0] [2022-12-13 09:32:05,906 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:32:05,907 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 389 [2022-12-13 09:32:05,907 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 326 flow [2022-12-13 09:32:05,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:05,907 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:05,907 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:05,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:32:05,907 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:32:05,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:05,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1238397249, now seen corresponding path program 1 times [2022-12-13 09:32:05,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:05,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009374916] [2022-12-13 09:32:05,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:05,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:06,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:06,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009374916] [2022-12-13 09:32:06,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009374916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:06,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:06,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:32:06,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378832341] [2022-12-13 09:32:06,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:06,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:32:06,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:06,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:32:06,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:32:06,050 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 09:32:06,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 326 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:06,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:06,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 09:32:06,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:06,186 INFO L130 PetriNetUnfolder]: 165/374 cut-off events. [2022-12-13 09:32:06,186 INFO L131 PetriNetUnfolder]: For 1125/1212 co-relation queries the response was YES. [2022-12-13 09:32:06,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2071 conditions, 374 events. 165/374 cut-off events. For 1125/1212 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2080 event pairs, 0 based on Foata normal form. 59/263 useless extension candidates. Maximal degree in co-relation 2053. Up to 310 conditions per place. [2022-12-13 09:32:06,188 INFO L137 encePairwiseOnDemand]: 10/31 looper letters, 11 selfloop transitions, 28 changer transitions 12/53 dead transitions. [2022-12-13 09:32:06,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 540 flow [2022-12-13 09:32:06,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:32:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:32:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-12-13 09:32:06,190 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33640552995391704 [2022-12-13 09:32:06,190 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 326 flow. Second operand 7 states and 73 transitions. [2022-12-13 09:32:06,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 540 flow [2022-12-13 09:32:06,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 417 flow, removed 49 selfloop flow, removed 5 redundant places. [2022-12-13 09:32:06,196 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 305 flow [2022-12-13 09:32:06,196 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=305, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2022-12-13 09:32:06,197 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2022-12-13 09:32:06,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:06,197 INFO L89 Accepts]: Start accepts. Operand has 46 places, 39 transitions, 305 flow [2022-12-13 09:32:06,198 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:06,198 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:06,198 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 305 flow [2022-12-13 09:32:06,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 39 transitions, 305 flow [2022-12-13 09:32:06,211 INFO L130 PetriNetUnfolder]: 81/214 cut-off events. [2022-12-13 09:32:06,211 INFO L131 PetriNetUnfolder]: For 411/429 co-relation queries the response was YES. [2022-12-13 09:32:06,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 214 events. 81/214 cut-off events. For 411/429 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1074 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 990. Up to 163 conditions per place. [2022-12-13 09:32:06,213 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 39 transitions, 305 flow [2022-12-13 09:32:06,213 INFO L226 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-13 09:32:06,528 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:32:06,529 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 332 [2022-12-13 09:32:06,529 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 309 flow [2022-12-13 09:32:06,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:06,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:06,529 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:06,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:32:06,529 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:32:06,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:06,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1237920102, now seen corresponding path program 1 times [2022-12-13 09:32:06,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:06,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832854542] [2022-12-13 09:32:06,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:06,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:06,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:06,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832854542] [2022-12-13 09:32:06,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832854542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:06,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:06,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:32:06,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225071052] [2022-12-13 09:32:06,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:06,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:32:06,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:06,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:32:06,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:32:06,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-13 09:32:06,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 309 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:06,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:06,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-13 09:32:06,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:06,662 INFO L130 PetriNetUnfolder]: 81/152 cut-off events. [2022-12-13 09:32:06,662 INFO L131 PetriNetUnfolder]: For 395/395 co-relation queries the response was YES. [2022-12-13 09:32:06,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 890 conditions, 152 events. 81/152 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 568 event pairs, 0 based on Foata normal form. 27/114 useless extension candidates. Maximal degree in co-relation 879. Up to 136 conditions per place. [2022-12-13 09:32:06,663 INFO L137 encePairwiseOnDemand]: 12/27 looper letters, 0 selfloop transitions, 0 changer transitions 39/39 dead transitions. [2022-12-13 09:32:06,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 385 flow [2022-12-13 09:32:06,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:32:06,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:32:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 09:32:06,664 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31851851851851853 [2022-12-13 09:32:06,664 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 309 flow. Second operand 5 states and 43 transitions. [2022-12-13 09:32:06,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 385 flow [2022-12-13 09:32:06,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 242 flow, removed 27 selfloop flow, removed 8 redundant places. [2022-12-13 09:32:06,668 INFO L231 Difference]: Finished difference. Result has 35 places, 0 transitions, 0 flow [2022-12-13 09:32:06,668 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=35, PETRI_TRANSITIONS=0} [2022-12-13 09:32:06,669 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2022-12-13 09:32:06,669 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:06,669 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 0 transitions, 0 flow [2022-12-13 09:32:06,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 09:32:06,669 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 09:32:06,670 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:32:06,670 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-13 09:32:06,670 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 09:32:06,670 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 09:32:06,670 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:32:06,671 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 09:32:06,671 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 09:32:06,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:06,673 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 09:32:06,673 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 09:32:06,674 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 09:32:06,674 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 09:32:06,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:32:06,674 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:06,676 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:32:06,677 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:32:06,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:32:06 BasicIcfg [2022-12-13 09:32:06,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:32:06,679 INFO L158 Benchmark]: Toolchain (without parser) took 8252.01ms. Allocated memory was 178.3MB in the beginning and 265.3MB in the end (delta: 87.0MB). Free memory was 153.5MB in the beginning and 131.3MB in the end (delta: 22.2MB). Peak memory consumption was 110.4MB. Max. memory is 8.0GB. [2022-12-13 09:32:06,679 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory was 155.1MB in the beginning and 155.0MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:32:06,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.97ms. Allocated memory is still 178.3MB. Free memory was 153.1MB in the beginning and 130.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-13 09:32:06,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.82ms. Allocated memory is still 178.3MB. Free memory was 130.0MB in the beginning and 127.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:32:06,680 INFO L158 Benchmark]: Boogie Preprocessor took 31.58ms. Allocated memory is still 178.3MB. Free memory was 127.9MB in the beginning and 126.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:32:06,680 INFO L158 Benchmark]: RCFGBuilder took 418.28ms. Allocated memory is still 178.3MB. Free memory was 126.3MB in the beginning and 112.2MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 09:32:06,681 INFO L158 Benchmark]: TraceAbstraction took 7207.22ms. Allocated memory was 178.3MB in the beginning and 265.3MB in the end (delta: 87.0MB). Free memory was 111.1MB in the beginning and 131.3MB in the end (delta: -20.2MB). Peak memory consumption was 68.4MB. Max. memory is 8.0GB. [2022-12-13 09:32:06,682 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory was 155.1MB in the beginning and 155.0MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 528.97ms. Allocated memory is still 178.3MB. Free memory was 153.1MB in the beginning and 130.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.82ms. Allocated memory is still 178.3MB. Free memory was 130.0MB in the beginning and 127.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.58ms. Allocated memory is still 178.3MB. Free memory was 127.9MB in the beginning and 126.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 418.28ms. Allocated memory is still 178.3MB. Free memory was 126.3MB in the beginning and 112.2MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 7207.22ms. Allocated memory was 178.3MB in the beginning and 265.3MB in the end (delta: 87.0MB). Free memory was 111.1MB in the beginning and 131.3MB in the end (delta: -20.2MB). Peak memory consumption was 68.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 79 PlacesBefore, 36 PlacesAfterwards, 70 TransitionsBefore, 27 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 20 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 53 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 950, independent: 897, independent conditional: 897, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 799, independent: 761, independent conditional: 0, independent unconditional: 761, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 799, independent: 761, independent conditional: 0, independent unconditional: 761, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 799, independent: 734, independent conditional: 0, independent unconditional: 734, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 161, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 950, independent: 136, independent conditional: 136, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 799, unknown conditional: 799, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 799, Positive cache size: 761, Positive conditional cache size: 761, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 3, independent unconditional: 7, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 3, independent unconditional: 7, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 10, Positive conditional cache size: 10, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 16, Positive conditional cache size: 16, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 14, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 18, Positive conditional cache size: 18, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 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: 14, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 20, Positive conditional cache size: 20, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 17, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 23, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 51 PlacesBefore, 47 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 138, independent: 126, independent conditional: 126, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 54, independent conditional: 24, independent unconditional: 30, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 57, independent: 54, independent conditional: 24, independent unconditional: 30, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 57, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 57, unknown conditional: 57, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 77, Positive conditional cache size: 77, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 46, independent conditional: 4, independent unconditional: 42, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 51, independent: 46, independent conditional: 4, independent unconditional: 42, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 51, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 38, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 51, unknown conditional: 51, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 123, Positive conditional cache size: 123, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 39 PlacesBefore, 39 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 24, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 24, independent unconditional: 7, 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: 31, independent: 31, independent conditional: 0, independent unconditional: 31, 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: 51, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 154, Positive conditional cache size: 154, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 43 PlacesBefore, 42 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 76, independent conditional: 76, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 36, independent conditional: 31, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, independent: 36, independent conditional: 31, 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: 36, independent: 36, independent conditional: 0, independent unconditional: 36, 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: 76, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 36, unknown conditional: 36, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 190, Positive conditional cache size: 190, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 43 PlacesBefore, 40 PlacesAfterwards, 39 TransitionsBefore, 36 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 63, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 208, Positive conditional cache size: 208, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 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: 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: 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: 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): 219, Positive cache size: 208, Positive conditional cache size: 208, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 7.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 306 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 708 IncrementalHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 24 mSDtfsCounter, 708 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=9, InterpolantAutomatonStates: 54, 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.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 532 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 09:32:06,711 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...