/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:54:02,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:54:02,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:54:02,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:54:02,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:54:02,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:54:02,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:54:02,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:54:02,114 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:54:02,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:54:02,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:54:02,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:54:02,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:54:02,122 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:54:02,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:54:02,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:54:02,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:54:02,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:54:02,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:54:02,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:54:02,131 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:54:02,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:54:02,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:54:02,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:54:02,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:54:02,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:54:02,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:54:02,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:54:02,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:54:02,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:54:02,140 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:54:02,140 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:54:02,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:54:02,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:54:02,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:54:02,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:54:02,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:54:02,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:54:02,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:54:02,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:54:02,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:54:02,150 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:54:02,176 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:54:02,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:54:02,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:54:02,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:54:02,178 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:54:02,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:54:02,179 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:54:02,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:54:02,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:54:02,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:54:02,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:54:02,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:54:02,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:54:02,180 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:54:02,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:54:02,181 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:54:02,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:54:02,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:54:02,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:54:02,181 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:54:02,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:54:02,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:54:02,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:54:02,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:54:02,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:54:02,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:54:02,182 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:54:02,182 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:54:02,182 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 00:54:02,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:54:02,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:54:02,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:54:02,527 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:54:02,527 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:54:02,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_tso.i [2022-12-13 00:54:03,528 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:54:03,713 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:54:03,714 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_tso.i [2022-12-13 00:54:03,723 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3450d3e4/e3951d4366c44a62b01d0c9cfb359374/FLAG519276a68 [2022-12-13 00:54:03,770 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3450d3e4/e3951d4366c44a62b01d0c9cfb359374 [2022-12-13 00:54:03,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:54:03,773 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:54:03,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:54:03,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:54:03,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:54:03,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:54:03" (1/1) ... [2022-12-13 00:54:03,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e2e3b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:03, skipping insertion in model container [2022-12-13 00:54:03,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:54:03" (1/1) ... [2022-12-13 00:54:03,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:54:03,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:54:03,920 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/safe032_tso.i[945,958] [2022-12-13 00:54:04,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:54:04,053 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:54:04,065 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/safe032_tso.i[945,958] [2022-12-13 00:54:04,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:04,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:04,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:54:04,147 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:54:04,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:04 WrapperNode [2022-12-13 00:54:04,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:54:04,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:54:04,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:54:04,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:54:04,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:04" (1/1) ... [2022-12-13 00:54:04,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:04" (1/1) ... [2022-12-13 00:54:04,180 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2022-12-13 00:54:04,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:54:04,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:54:04,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:54:04,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:54:04,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:04" (1/1) ... [2022-12-13 00:54:04,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:04" (1/1) ... [2022-12-13 00:54:04,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:04" (1/1) ... [2022-12-13 00:54:04,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:04" (1/1) ... [2022-12-13 00:54:04,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:04" (1/1) ... [2022-12-13 00:54:04,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:04" (1/1) ... [2022-12-13 00:54:04,207 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:04" (1/1) ... [2022-12-13 00:54:04,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:04" (1/1) ... [2022-12-13 00:54:04,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:54:04,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:54:04,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:54:04,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:54:04,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:04" (1/1) ... [2022-12-13 00:54:04,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:54:04,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:54:04,265 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 00:54:04,293 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 00:54:04,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:54:04,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:54:04,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:54:04,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:54:04,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:54:04,309 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:54:04,309 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:54:04,309 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:54:04,309 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:54:04,309 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:54:04,309 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:54:04,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:54:04,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:54:04,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:54:04,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:54:04,311 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 00:54:04,485 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:54:04,487 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:54:04,603 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:54:04,607 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:54:04,608 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:54:04,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:54:04 BoogieIcfgContainer [2022-12-13 00:54:04,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:54:04,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:54:04,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:54:04,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:54:04,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:54:03" (1/3) ... [2022-12-13 00:54:04,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b279897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:54:04, skipping insertion in model container [2022-12-13 00:54:04,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:04" (2/3) ... [2022-12-13 00:54:04,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b279897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:54:04, skipping insertion in model container [2022-12-13 00:54:04,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:54:04" (3/3) ... [2022-12-13 00:54:04,615 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_tso.i [2022-12-13 00:54:04,627 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:54:04,628 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 00:54:04,628 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:54:04,684 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:54:04,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 84 transitions, 183 flow [2022-12-13 00:54:04,782 INFO L130 PetriNetUnfolder]: 2/81 cut-off events. [2022-12-13 00:54:04,782 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:04,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-12-13 00:54:04,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 84 transitions, 183 flow [2022-12-13 00:54:04,791 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 69 transitions, 147 flow [2022-12-13 00:54:04,793 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:04,818 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 69 transitions, 147 flow [2022-12-13 00:54:04,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 69 transitions, 147 flow [2022-12-13 00:54:04,854 INFO L130 PetriNetUnfolder]: 1/69 cut-off events. [2022-12-13 00:54:04,854 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:04,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 69 events. 1/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 37 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 00:54:04,857 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 69 transitions, 147 flow [2022-12-13 00:54:04,857 INFO L226 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-13 00:54:06,631 INFO L241 LiptonReduction]: Total number of compositions: 52 [2022-12-13 00:54:06,650 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:54:06,657 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;@6cdc7911, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:54:06,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 00:54:06,665 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-13 00:54:06,666 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:06,666 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:06,667 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:06,667 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 00:54:06,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:06,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1779919686, now seen corresponding path program 1 times [2022-12-13 00:54:06,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:06,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611587870] [2022-12-13 00:54:06,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:06,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:07,084 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 00:54:07,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:07,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611587870] [2022-12-13 00:54:07,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611587870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:07,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:07,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:54:07,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860590540] [2022-12-13 00:54:07,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:07,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:54:07,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:07,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:54:07,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:54:07,109 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2022-12-13 00:54:07,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 00:54:07,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:07,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2022-12-13 00:54:07,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:07,258 INFO L130 PetriNetUnfolder]: 461/791 cut-off events. [2022-12-13 00:54:07,258 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 00:54:07,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1564 conditions, 791 events. 461/791 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4123 event pairs, 155 based on Foata normal form. 32/642 useless extension candidates. Maximal degree in co-relation 1553. Up to 507 conditions per place. [2022-12-13 00:54:07,268 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 25 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2022-12-13 00:54:07,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 35 transitions, 136 flow [2022-12-13 00:54:07,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:54:07,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:54:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-13 00:54:07,277 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 00:54:07,278 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 54 transitions. [2022-12-13 00:54:07,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 35 transitions, 136 flow [2022-12-13 00:54:07,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 132 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:54:07,283 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 66 flow [2022-12-13 00:54:07,285 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2022-12-13 00:54:07,289 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2022-12-13 00:54:07,289 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:07,289 INFO L89 Accepts]: Start accepts. Operand has 36 places, 26 transitions, 66 flow [2022-12-13 00:54:07,291 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:07,291 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:07,292 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 66 flow [2022-12-13 00:54:07,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 66 flow [2022-12-13 00:54:07,295 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-13 00:54:07,295 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:07,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 62 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:54:07,297 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 66 flow [2022-12-13 00:54:07,297 INFO L226 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-13 00:54:07,340 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:07,342 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 00:54:07,342 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 66 flow [2022-12-13 00:54:07,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 00:54:07,342 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:07,342 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:07,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:54:07,343 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 00:54:07,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:07,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1078865772, now seen corresponding path program 1 times [2022-12-13 00:54:07,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:07,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255155848] [2022-12-13 00:54:07,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:07,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:07,422 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 00:54:07,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:07,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255155848] [2022-12-13 00:54:07,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255155848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:07,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:07,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:54:07,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234869421] [2022-12-13 00:54:07,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:07,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:54:07,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:07,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:54:07,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:54:07,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 26 [2022-12-13 00:54:07,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:07,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:07,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 26 [2022-12-13 00:54:07,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:07,488 INFO L130 PetriNetUnfolder]: 460/809 cut-off events. [2022-12-13 00:54:07,488 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-12-13 00:54:07,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1629 conditions, 809 events. 460/809 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4317 event pairs, 130 based on Foata normal form. 6/639 useless extension candidates. Maximal degree in co-relation 1618. Up to 670 conditions per place. [2022-12-13 00:54:07,492 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 26 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-12-13 00:54:07,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 150 flow [2022-12-13 00:54:07,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:54:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:54:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-13 00:54:07,493 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2022-12-13 00:54:07,493 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 66 flow. Second operand 3 states and 54 transitions. [2022-12-13 00:54:07,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 150 flow [2022-12-13 00:54:07,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:54:07,494 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 81 flow [2022-12-13 00:54:07,494 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2022-12-13 00:54:07,495 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2022-12-13 00:54:07,495 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:07,495 INFO L89 Accepts]: Start accepts. Operand has 37 places, 28 transitions, 81 flow [2022-12-13 00:54:07,495 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:07,495 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:07,496 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 28 transitions, 81 flow [2022-12-13 00:54:07,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 81 flow [2022-12-13 00:54:07,498 INFO L130 PetriNetUnfolder]: 3/35 cut-off events. [2022-12-13 00:54:07,499 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 00:54:07,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 35 events. 3/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 95 event pairs, 1 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2022-12-13 00:54:07,499 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 81 flow [2022-12-13 00:54:07,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-13 00:54:07,500 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:07,501 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 00:54:07,501 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 81 flow [2022-12-13 00:54:07,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:07,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:07,501 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:07,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:54:07,502 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 00:54:07,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:07,502 INFO L85 PathProgramCache]: Analyzing trace with hash 903137074, now seen corresponding path program 1 times [2022-12-13 00:54:07,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:07,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703698643] [2022-12-13 00:54:07,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:07,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:07,600 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 00:54:07,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:07,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703698643] [2022-12-13 00:54:07,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703698643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:07,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:07,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:54:07,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979218551] [2022-12-13 00:54:07,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:07,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:54:07,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:07,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:54:07,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:54:07,602 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 00:54:07,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:07,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:07,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 00:54:07,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:07,737 INFO L130 PetriNetUnfolder]: 1097/1824 cut-off events. [2022-12-13 00:54:07,737 INFO L131 PetriNetUnfolder]: For 514/514 co-relation queries the response was YES. [2022-12-13 00:54:07,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4075 conditions, 1824 events. 1097/1824 cut-off events. For 514/514 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 9917 event pairs, 197 based on Foata normal form. 126/1578 useless extension candidates. Maximal degree in co-relation 4063. Up to 736 conditions per place. [2022-12-13 00:54:07,743 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 39 selfloop transitions, 10 changer transitions 7/62 dead transitions. [2022-12-13 00:54:07,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 62 transitions, 287 flow [2022-12-13 00:54:07,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:54:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:54:07,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-13 00:54:07,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7403846153846154 [2022-12-13 00:54:07,744 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 81 flow. Second operand 4 states and 77 transitions. [2022-12-13 00:54:07,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 62 transitions, 287 flow [2022-12-13 00:54:07,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 62 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:54:07,746 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 151 flow [2022-12-13 00:54:07,746 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2022-12-13 00:54:07,747 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-12-13 00:54:07,747 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:07,747 INFO L89 Accepts]: Start accepts. Operand has 42 places, 34 transitions, 151 flow [2022-12-13 00:54:07,748 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:07,748 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:07,748 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 34 transitions, 151 flow [2022-12-13 00:54:07,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 34 transitions, 151 flow [2022-12-13 00:54:07,754 INFO L130 PetriNetUnfolder]: 22/115 cut-off events. [2022-12-13 00:54:07,754 INFO L131 PetriNetUnfolder]: For 47/53 co-relation queries the response was YES. [2022-12-13 00:54:07,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 115 events. 22/115 cut-off events. For 47/53 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 550 event pairs, 1 based on Foata normal form. 1/81 useless extension candidates. Maximal degree in co-relation 241. Up to 39 conditions per place. [2022-12-13 00:54:07,755 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 34 transitions, 151 flow [2022-12-13 00:54:07,755 INFO L226 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-13 00:54:07,773 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:54:07,774 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 00:54:07,774 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 153 flow [2022-12-13 00:54:07,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:07,775 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:07,775 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:07,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:54:07,775 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 00:54:07,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:07,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1725699691, now seen corresponding path program 1 times [2022-12-13 00:54:07,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:07,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769560909] [2022-12-13 00:54:07,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:07,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:07,879 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 00:54:07,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:07,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769560909] [2022-12-13 00:54:07,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769560909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:07,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:07,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:54:07,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910658246] [2022-12-13 00:54:07,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:07,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:54:07,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:07,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:54:07,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:54:07,881 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 00:54:07,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:07,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:07,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 00:54:07,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:08,044 INFO L130 PetriNetUnfolder]: 949/1604 cut-off events. [2022-12-13 00:54:08,044 INFO L131 PetriNetUnfolder]: For 1010/1010 co-relation queries the response was YES. [2022-12-13 00:54:08,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4321 conditions, 1604 events. 949/1604 cut-off events. For 1010/1010 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8439 event pairs, 225 based on Foata normal form. 12/1270 useless extension candidates. Maximal degree in co-relation 4305. Up to 528 conditions per place. [2022-12-13 00:54:08,050 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 38 selfloop transitions, 13 changer transitions 16/73 dead transitions. [2022-12-13 00:54:08,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 73 transitions, 419 flow [2022-12-13 00:54:08,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:54:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:54:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-13 00:54:08,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2022-12-13 00:54:08,056 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 153 flow. Second operand 6 states and 98 transitions. [2022-12-13 00:54:08,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 73 transitions, 419 flow [2022-12-13 00:54:08,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 73 transitions, 419 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:54:08,061 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 224 flow [2022-12-13 00:54:08,062 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2022-12-13 00:54:08,063 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2022-12-13 00:54:08,063 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:08,063 INFO L89 Accepts]: Start accepts. Operand has 51 places, 37 transitions, 224 flow [2022-12-13 00:54:08,065 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:08,065 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:08,065 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 37 transitions, 224 flow [2022-12-13 00:54:08,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 37 transitions, 224 flow [2022-12-13 00:54:08,072 INFO L130 PetriNetUnfolder]: 18/105 cut-off events. [2022-12-13 00:54:08,072 INFO L131 PetriNetUnfolder]: For 169/192 co-relation queries the response was YES. [2022-12-13 00:54:08,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 105 events. 18/105 cut-off events. For 169/192 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 480 event pairs, 0 based on Foata normal form. 2/76 useless extension candidates. Maximal degree in co-relation 287. Up to 31 conditions per place. [2022-12-13 00:54:08,073 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 37 transitions, 224 flow [2022-12-13 00:54:08,073 INFO L226 LiptonReduction]: Number of co-enabled transitions 402 [2022-12-13 00:54:08,087 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [176] L724-->L729: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] and [248] $Ultimate##0-->L724: 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_46 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{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_46, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 00:54:08,107 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:54:08,113 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 00:54:08,113 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 229 flow [2022-12-13 00:54:08,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:08,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:08,114 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:08,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:54:08,114 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 00:54:08,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:08,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1008540495, now seen corresponding path program 2 times [2022-12-13 00:54:08,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:08,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773045659] [2022-12-13 00:54:08,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:08,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:08,190 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 00:54:08,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:08,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773045659] [2022-12-13 00:54:08,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773045659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:08,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:08,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:54:08,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136201127] [2022-12-13 00:54:08,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:08,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:54:08,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:08,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:54:08,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:54:08,192 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2022-12-13 00:54:08,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 229 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:08,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:08,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2022-12-13 00:54:08,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:08,377 INFO L130 PetriNetUnfolder]: 928/1664 cut-off events. [2022-12-13 00:54:08,377 INFO L131 PetriNetUnfolder]: For 3076/3122 co-relation queries the response was YES. [2022-12-13 00:54:08,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4730 conditions, 1664 events. 928/1664 cut-off events. For 3076/3122 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 10062 event pairs, 239 based on Foata normal form. 37/961 useless extension candidates. Maximal degree in co-relation 4708. Up to 1150 conditions per place. [2022-12-13 00:54:08,385 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 53 selfloop transitions, 17 changer transitions 11/90 dead transitions. [2022-12-13 00:54:08,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 90 transitions, 662 flow [2022-12-13 00:54:08,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:54:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:54:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-13 00:54:08,386 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6928571428571428 [2022-12-13 00:54:08,387 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 229 flow. Second operand 5 states and 97 transitions. [2022-12-13 00:54:08,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 90 transitions, 662 flow [2022-12-13 00:54:08,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 90 transitions, 639 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 00:54:08,391 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 333 flow [2022-12-13 00:54:08,392 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2022-12-13 00:54:08,392 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2022-12-13 00:54:08,392 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:08,392 INFO L89 Accepts]: Start accepts. Operand has 55 places, 51 transitions, 333 flow [2022-12-13 00:54:08,393 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:08,393 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:08,393 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions, 333 flow [2022-12-13 00:54:08,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 333 flow [2022-12-13 00:54:08,451 INFO L130 PetriNetUnfolder]: 482/951 cut-off events. [2022-12-13 00:54:08,451 INFO L131 PetriNetUnfolder]: For 1110/1487 co-relation queries the response was YES. [2022-12-13 00:54:08,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2966 conditions, 951 events. 482/951 cut-off events. For 1110/1487 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 6346 event pairs, 207 based on Foata normal form. 10/419 useless extension candidates. Maximal degree in co-relation 2943. Up to 827 conditions per place. [2022-12-13 00:54:08,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 51 transitions, 333 flow [2022-12-13 00:54:08,457 INFO L226 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-13 00:54:08,466 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L789: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|) (= v_~main$tmp_guard0~0_34 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [183] L746-->L751: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:54:08,480 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L789: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|) (= v_~main$tmp_guard0~0_34 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [234] L761-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= |v_P2Thread1of1ForFork0_#res.offset_9| 0) (= |v_P2Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 00:54:08,510 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L789: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|) (= v_~main$tmp_guard0~0_34 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [222] L746-->P1FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_32 1) v_~__unbuffered_cnt~0_31) (= |v_P1Thread1of1ForFork2_#res.base_5| 0) (= |v_P1Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 00:54:08,542 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L789: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|) (= v_~main$tmp_guard0~0_34 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [233] L761-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1)) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 00:54:08,571 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L789: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|) (= v_~main$tmp_guard0~0_34 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [238] L746-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_103 (+ v_~__unbuffered_cnt~0_104 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_17|) (= |v_P1Thread1of1ForFork2_#res.base_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_17|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 00:54:08,592 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L789: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|) (= v_~main$tmp_guard0~0_34 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [189] L761-->L766: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:54:08,691 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] $Ultimate##0-->L761: Formula: (and (= v_~y~0_77 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_17| v_P2Thread1of1ForFork0_~arg.base_17) (= v_~x~0_78 2) (= |v_P2Thread1of1ForFork0_#in~arg.offset_17| v_P2Thread1of1ForFork0_~arg.offset_17)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_17, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_17, ~y~0=v_~y~0_77, ~x~0=v_~x~0_78, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0, ~x~0] and [248] $Ultimate##0-->L724: 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_46 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{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_46, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 00:54:08,713 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:54:08,716 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 324 [2022-12-13 00:54:08,716 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 299 flow [2022-12-13 00:54:08,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:08,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:08,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:08,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:54:08,717 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 00:54:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:08,717 INFO L85 PathProgramCache]: Analyzing trace with hash 648464106, now seen corresponding path program 1 times [2022-12-13 00:54:08,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:08,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027556065] [2022-12-13 00:54:08,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:08,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:08,826 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 00:54:08,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:08,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027556065] [2022-12-13 00:54:08,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027556065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:08,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:08,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:54:08,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476894735] [2022-12-13 00:54:08,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:08,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:54:08,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:08,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:54:08,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:54:08,828 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2022-12-13 00:54:08,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:08,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:08,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2022-12-13 00:54:08,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:09,012 INFO L130 PetriNetUnfolder]: 607/1209 cut-off events. [2022-12-13 00:54:09,013 INFO L131 PetriNetUnfolder]: For 2491/2619 co-relation queries the response was YES. [2022-12-13 00:54:09,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4888 conditions, 1209 events. 607/1209 cut-off events. For 2491/2619 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 7547 event pairs, 41 based on Foata normal form. 44/747 useless extension candidates. Maximal degree in co-relation 4862. Up to 889 conditions per place. [2022-12-13 00:54:09,019 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 35 selfloop transitions, 26 changer transitions 23/93 dead transitions. [2022-12-13 00:54:09,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 93 transitions, 775 flow [2022-12-13 00:54:09,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:54:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:54:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2022-12-13 00:54:09,021 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2022-12-13 00:54:09,021 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 299 flow. Second operand 6 states and 114 transitions. [2022-12-13 00:54:09,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 93 transitions, 775 flow [2022-12-13 00:54:09,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 93 transitions, 763 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 00:54:09,038 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 425 flow [2022-12-13 00:54:09,038 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=425, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2022-12-13 00:54:09,040 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2022-12-13 00:54:09,040 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:09,040 INFO L89 Accepts]: Start accepts. Operand has 59 places, 53 transitions, 425 flow [2022-12-13 00:54:09,042 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:09,042 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:09,042 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 53 transitions, 425 flow [2022-12-13 00:54:09,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 53 transitions, 425 flow [2022-12-13 00:54:09,077 INFO L130 PetriNetUnfolder]: 117/480 cut-off events. [2022-12-13 00:54:09,077 INFO L131 PetriNetUnfolder]: For 1316/2328 co-relation queries the response was YES. [2022-12-13 00:54:09,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2094 conditions, 480 events. 117/480 cut-off events. For 1316/2328 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 4107 event pairs, 27 based on Foata normal form. 3/250 useless extension candidates. Maximal degree in co-relation 2068. Up to 412 conditions per place. [2022-12-13 00:54:09,082 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 53 transitions, 425 flow [2022-12-13 00:54:09,083 INFO L226 LiptonReduction]: Number of co-enabled transitions 430 [2022-12-13 00:54:09,093 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L789: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|) (= v_~main$tmp_guard0~0_34 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [233] L761-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1)) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 00:54:09,115 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L789: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|) (= v_~main$tmp_guard0~0_34 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [238] L746-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_103 (+ v_~__unbuffered_cnt~0_104 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_17|) (= |v_P1Thread1of1ForFork2_#res.base_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_17|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 00:54:09,146 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L789: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|) (= v_~main$tmp_guard0~0_34 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [189] L761-->L766: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:54:09,171 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L789: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|) (= v_~main$tmp_guard0~0_34 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [183] L746-->L751: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:54:09,185 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L789: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|) (= v_~main$tmp_guard0~0_34 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [222] L746-->P1FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_32 1) v_~__unbuffered_cnt~0_31) (= |v_P1Thread1of1ForFork2_#res.base_5| 0) (= |v_P1Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 00:54:09,210 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L789: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|) (= v_~main$tmp_guard0~0_34 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [234] L761-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= |v_P2Thread1of1ForFork0_#res.offset_9| 0) (= |v_P2Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 00:54:09,331 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:54:09,332 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 292 [2022-12-13 00:54:09,332 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 355 flow [2022-12-13 00:54:09,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:09,332 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:09,332 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:09,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:54:09,332 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 00:54:09,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:09,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1196352356, now seen corresponding path program 1 times [2022-12-13 00:54:09,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:09,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192607501] [2022-12-13 00:54:09,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:09,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:09,435 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 00:54:09,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:09,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192607501] [2022-12-13 00:54:09,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192607501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:09,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:09,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:54:09,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433931666] [2022-12-13 00:54:09,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:09,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:54:09,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:09,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:54:09,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:54:09,437 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 00:54:09,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 355 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:09,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:09,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 00:54:09,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:09,511 INFO L130 PetriNetUnfolder]: 262/546 cut-off events. [2022-12-13 00:54:09,511 INFO L131 PetriNetUnfolder]: For 1613/1777 co-relation queries the response was YES. [2022-12-13 00:54:09,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2644 conditions, 546 events. 262/546 cut-off events. For 1613/1777 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2983 event pairs, 14 based on Foata normal form. 29/336 useless extension candidates. Maximal degree in co-relation 2628. Up to 328 conditions per place. [2022-12-13 00:54:09,514 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 0 selfloop transitions, 0 changer transitions 58/58 dead transitions. [2022-12-13 00:54:09,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 521 flow [2022-12-13 00:54:09,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:54:09,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:54:09,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-13 00:54:09,515 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2022-12-13 00:54:09,515 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 355 flow. Second operand 5 states and 74 transitions. [2022-12-13 00:54:09,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 521 flow [2022-12-13 00:54:09,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 424 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-12-13 00:54:09,524 INFO L231 Difference]: Finished difference. Result has 53 places, 0 transitions, 0 flow [2022-12-13 00:54:09,524 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=53, PETRI_TRANSITIONS=0} [2022-12-13 00:54:09,525 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2022-12-13 00:54:09,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:09,525 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 0 transitions, 0 flow [2022-12-13 00:54:09,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 00:54:09,526 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 00:54:09,526 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:09,526 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 00:54:09,526 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 00:54:09,526 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 00:54:09,526 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:09,527 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 00:54:09,527 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 00:54:09,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:09,531 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 00:54:09,531 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 00:54:09,531 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 00:54:09,531 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 00:54:09,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:54:09,532 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-12-13 00:54:09,534 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:54:09,534 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:54:09,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:54:09 BasicIcfg [2022-12-13 00:54:09,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:54:09,538 INFO L158 Benchmark]: Toolchain (without parser) took 5764.99ms. Allocated memory was 187.7MB in the beginning and 289.4MB in the end (delta: 101.7MB). Free memory was 166.8MB in the beginning and 116.5MB in the end (delta: 50.3MB). Peak memory consumption was 152.0MB. Max. memory is 8.0GB. [2022-12-13 00:54:09,538 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory was 108.4MB in the beginning and 108.4MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:54:09,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.21ms. Allocated memory is still 187.7MB. Free memory was 166.5MB in the beginning and 143.0MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-13 00:54:09,538 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.00ms. Allocated memory is still 187.7MB. Free memory was 143.0MB in the beginning and 141.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:54:09,538 INFO L158 Benchmark]: Boogie Preprocessor took 29.02ms. Allocated memory is still 187.7MB. Free memory was 141.0MB in the beginning and 139.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 00:54:09,539 INFO L158 Benchmark]: RCFGBuilder took 398.99ms. Allocated memory is still 187.7MB. Free memory was 139.2MB in the beginning and 159.5MB in the end (delta: -20.3MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-12-13 00:54:09,539 INFO L158 Benchmark]: TraceAbstraction took 4926.75ms. Allocated memory was 187.7MB in the beginning and 289.4MB in the end (delta: 101.7MB). Free memory was 158.5MB in the beginning and 116.5MB in the end (delta: 42.0MB). Peak memory consumption was 143.7MB. Max. memory is 8.0GB. [2022-12-13 00:54:09,540 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 127.9MB. Free memory was 108.4MB in the beginning and 108.4MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 374.21ms. Allocated memory is still 187.7MB. Free memory was 166.5MB in the beginning and 143.0MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.00ms. Allocated memory is still 187.7MB. Free memory was 143.0MB in the beginning and 141.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.02ms. Allocated memory is still 187.7MB. Free memory was 141.0MB in the beginning and 139.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 398.99ms. Allocated memory is still 187.7MB. Free memory was 139.2MB in the beginning and 159.5MB in the end (delta: -20.3MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * TraceAbstraction took 4926.75ms. Allocated memory was 187.7MB in the beginning and 289.4MB in the end (delta: 101.7MB). Free memory was 158.5MB in the beginning and 116.5MB in the end (delta: 42.0MB). Peak memory consumption was 143.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 78 PlacesBefore, 36 PlacesAfterwards, 69 TransitionsBefore, 27 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 52 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1112, independent: 1058, independent conditional: 1058, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1112, independent: 1058, independent conditional: 0, independent unconditional: 1058, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1112, independent: 1058, independent conditional: 0, independent unconditional: 1058, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1112, independent: 1058, independent conditional: 0, independent unconditional: 1058, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 801, independent: 769, independent conditional: 0, independent unconditional: 769, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 801, independent: 756, independent conditional: 0, independent unconditional: 756, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 90, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1112, independent: 289, independent conditional: 0, independent unconditional: 289, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 801, unknown conditional: 0, unknown unconditional: 801] , Statistics on independence cache: Total cache size (in pairs): 1232, Positive cache size: 1200, Positive conditional cache size: 0, Positive unconditional cache size: 1200, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 157, independent: 135, independent conditional: 135, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 157, independent: 135, independent conditional: 16, independent unconditional: 119, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 157, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 157, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 157, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 121, Positive conditional cache size: 0, Positive unconditional cache size: 121, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119, independent: 103, independent conditional: 103, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 119, independent: 103, independent conditional: 8, independent unconditional: 95, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 119, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 119, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 119, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 121, Positive conditional cache size: 0, Positive unconditional cache size: 121, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 15, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 27, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 402 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 11, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 19, independent: 16, independent conditional: 6, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 136, Positive conditional cache size: 1, Positive unconditional cache size: 135, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 55 PlacesBefore, 53 PlacesAfterwards, 51 TransitionsBefore, 44 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 176, independent: 176, independent conditional: 176, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 176, independent: 176, independent conditional: 169, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 176, independent: 176, independent conditional: 87, independent unconditional: 89, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 176, independent: 176, independent conditional: 87, independent unconditional: 89, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 53, independent: 53, independent conditional: 26, independent unconditional: 27, 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: 53, independent: 53, independent conditional: 0, independent unconditional: 53, 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: 176, independent: 123, independent conditional: 61, independent unconditional: 62, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 53, unknown conditional: 26, unknown unconditional: 27] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 201, Positive conditional cache size: 27, Positive unconditional cache size: 174, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 82, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 59 PlacesBefore, 56 PlacesAfterwards, 53 TransitionsBefore, 45 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, independent: 111, independent conditional: 111, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 111, independent: 111, independent conditional: 107, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, independent: 111, independent conditional: 60, independent unconditional: 51, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, independent: 111, independent conditional: 60, independent unconditional: 51, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 17, independent unconditional: 4, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 111, independent: 90, independent conditional: 43, independent unconditional: 47, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 21, unknown conditional: 17, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 242, Positive conditional cache size: 46, Positive unconditional cache size: 196, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 47, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 242, Positive conditional cache size: 46, Positive unconditional cache size: 196, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 107 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: 4.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 488 IncrementalHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 8 mSDtfsCounter, 488 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred in iteration=6, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 00:54:09,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...