/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/mix021_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:37:23,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:37:23,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:37:23,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:37:23,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:37:23,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:37:23,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:37:23,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:37:24,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:37:24,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:37:24,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:37:24,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:37:24,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:37:24,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:37:24,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:37:24,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:37:24,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:37:24,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:37:24,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:37:24,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:37:24,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:37:24,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:37:24,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:37:24,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:37:24,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:37:24,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:37:24,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:37:24,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:37:24,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:37:24,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:37:24,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:37:24,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:37:24,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:37:24,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:37:24,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:37:24,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:37:24,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:37:24,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:37:24,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:37:24,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:37:24,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:37:24,036 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:37:24,060 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:37:24,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:37:24,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:37:24,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:37:24,062 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:37:24,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:37:24,063 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:37:24,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:37:24,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:37:24,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:37:24,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:37:24,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:37:24,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:37:24,064 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:37:24,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:37:24,064 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:37:24,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:37:24,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:37:24,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:37:24,065 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:37:24,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:37:24,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:37:24,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:37:24,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:37:24,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:37:24,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:37:24,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:37:24,066 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:37:24,066 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:37:24,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:37:24,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:37:24,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:37:24,348 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:37:24,357 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:37:24,358 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2022-12-13 00:37:25,499 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:37:25,733 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:37:25,733 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2022-12-13 00:37:25,751 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c76abaf6/29e6ec3fee674ea781721033d0667b76/FLAGc0944f732 [2022-12-13 00:37:25,761 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c76abaf6/29e6ec3fee674ea781721033d0667b76 [2022-12-13 00:37:25,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:37:25,764 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:37:25,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:37:25,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:37:25,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:37:25,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:37:25" (1/1) ... [2022-12-13 00:37:25,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50cc95b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:25, skipping insertion in model container [2022-12-13 00:37:25,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:37:25" (1/1) ... [2022-12-13 00:37:25,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:37:25,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:37:25,942 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/mix021_tso.oepc.i[949,962] [2022-12-13 00:37:26,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:37:26,109 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:37:26,118 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/mix021_tso.oepc.i[949,962] [2022-12-13 00:37:26,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:26,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:26,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:37:26,236 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:37:26,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:26 WrapperNode [2022-12-13 00:37:26,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:37:26,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:37:26,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:37:26,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:37:26,242 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:37:26" (1/1) ... [2022-12-13 00:37:26,255 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:37:26" (1/1) ... [2022-12-13 00:37:26,288 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-13 00:37:26,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:37:26,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:37:26,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:37:26,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:37:26,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:26" (1/1) ... [2022-12-13 00:37:26,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:26" (1/1) ... [2022-12-13 00:37:26,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:26" (1/1) ... [2022-12-13 00:37:26,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:26" (1/1) ... [2022-12-13 00:37:26,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:26" (1/1) ... [2022-12-13 00:37:26,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:26" (1/1) ... [2022-12-13 00:37:26,307 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:26" (1/1) ... [2022-12-13 00:37:26,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:26" (1/1) ... [2022-12-13 00:37:26,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:37:26,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:37:26,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:37:26,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:37:26,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:26" (1/1) ... [2022-12-13 00:37:26,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:37:26,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:37:26,352 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:37:26,367 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:37:26,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:37:26,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:37:26,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:37:26,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:37:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:37:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:37:26,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:37:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:37:26,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:37:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:37:26,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:37:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 00:37:26,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 00:37:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:37:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:37:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:37:26,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:37:26,401 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:37:26,496 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:37:26,498 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:37:26,744 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:37:26,828 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:37:26,828 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:37:26,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:37:26 BoogieIcfgContainer [2022-12-13 00:37:26,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:37:26,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:37:26,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:37:26,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:37:26,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:37:25" (1/3) ... [2022-12-13 00:37:26,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c102444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:37:26, skipping insertion in model container [2022-12-13 00:37:26,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:26" (2/3) ... [2022-12-13 00:37:26,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c102444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:37:26, skipping insertion in model container [2022-12-13 00:37:26,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:37:26" (3/3) ... [2022-12-13 00:37:26,835 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2022-12-13 00:37:26,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:37:26,847 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:37:26,847 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:37:26,887 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:37:26,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-13 00:37:26,949 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-13 00:37:26,950 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:37:26,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-13 00:37:26,954 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-13 00:37:26,957 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-13 00:37:26,958 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:26,970 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-13 00:37:26,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-13 00:37:27,009 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-13 00:37:27,009 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:37:27,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-13 00:37:27,013 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-13 00:37:27,013 INFO L226 LiptonReduction]: Number of co-enabled transitions 2986 [2022-12-13 00:37:35,486 INFO L241 LiptonReduction]: Total number of compositions: 98 [2022-12-13 00:37:35,518 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:37:35,524 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;@47364de7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:37:35,524 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 00:37:35,538 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-13 00:37:35,538 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:37:35,538 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:35,539 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:35,539 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:35,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:35,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1718137257, now seen corresponding path program 1 times [2022-12-13 00:37:35,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:35,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712787489] [2022-12-13 00:37:35,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:35,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:35,953 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:37:35,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:35,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712787489] [2022-12-13 00:37:35,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712787489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:35,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:35,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:37:35,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332358004] [2022-12-13 00:37:35,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:35,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:37:35,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:35,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:37:35,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:37:35,974 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 72 [2022-12-13 00:37:35,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:37:35,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:35,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 72 [2022-12-13 00:37:35,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:41,912 INFO L130 PetriNetUnfolder]: 45079/65069 cut-off events. [2022-12-13 00:37:41,912 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2022-12-13 00:37:42,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125053 conditions, 65069 events. 45079/65069 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 3600. Compared 495417 event pairs, 11775 based on Foata normal form. 0/39954 useless extension candidates. Maximal degree in co-relation 125041. Up to 50025 conditions per place. [2022-12-13 00:37:42,098 INFO L137 encePairwiseOnDemand]: 67/72 looper letters, 40 selfloop transitions, 2 changer transitions 56/113 dead transitions. [2022-12-13 00:37:42,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 113 transitions, 437 flow [2022-12-13 00:37:42,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:37:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:37:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-12-13 00:37:42,108 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2022-12-13 00:37:42,110 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 156 flow. Second operand 3 states and 148 transitions. [2022-12-13 00:37:42,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 113 transitions, 437 flow [2022-12-13 00:37:42,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 113 transitions, 432 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 00:37:42,116 INFO L231 Difference]: Finished difference. Result has 80 places, 41 transitions, 94 flow [2022-12-13 00:37:42,117 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=80, PETRI_TRANSITIONS=41} [2022-12-13 00:37:42,122 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -4 predicate places. [2022-12-13 00:37:42,122 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:42,122 INFO L89 Accepts]: Start accepts. Operand has 80 places, 41 transitions, 94 flow [2022-12-13 00:37:42,126 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:42,126 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:42,127 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 41 transitions, 94 flow [2022-12-13 00:37:42,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 94 flow [2022-12-13 00:37:42,136 INFO L130 PetriNetUnfolder]: 0/41 cut-off events. [2022-12-13 00:37:42,136 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:37:42,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 99 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:37:42,140 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 41 transitions, 94 flow [2022-12-13 00:37:42,140 INFO L226 LiptonReduction]: Number of co-enabled transitions 1006 [2022-12-13 00:37:42,324 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:42,326 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-13 00:37:42,326 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 94 flow [2022-12-13 00:37:42,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:37:42,326 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:42,326 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:42,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:37:42,329 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:42,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:42,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1222412776, now seen corresponding path program 1 times [2022-12-13 00:37:42,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:42,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144867092] [2022-12-13 00:37:42,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:42,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:42,516 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:37:42,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:42,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144867092] [2022-12-13 00:37:42,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144867092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:42,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:42,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:37:42,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76826886] [2022-12-13 00:37:42,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:42,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:37:42,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:42,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:37:42,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:37:42,519 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2022-12-13 00:37:42,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:37:42,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:42,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2022-12-13 00:37:42,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:43,298 INFO L130 PetriNetUnfolder]: 6909/10167 cut-off events. [2022-12-13 00:37:43,298 INFO L131 PetriNetUnfolder]: For 468/468 co-relation queries the response was YES. [2022-12-13 00:37:43,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20259 conditions, 10167 events. 6909/10167 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 61247 event pairs, 2349 based on Foata normal form. 200/8354 useless extension candidates. Maximal degree in co-relation 20249. Up to 6461 conditions per place. [2022-12-13 00:37:43,395 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 38 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2022-12-13 00:37:43,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 202 flow [2022-12-13 00:37:43,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:37:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:37:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-13 00:37:43,397 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6747967479674797 [2022-12-13 00:37:43,397 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 94 flow. Second operand 3 states and 83 transitions. [2022-12-13 00:37:43,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 202 flow [2022-12-13 00:37:43,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:37:43,401 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 98 flow [2022-12-13 00:37:43,401 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2022-12-13 00:37:43,402 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -31 predicate places. [2022-12-13 00:37:43,402 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:43,402 INFO L89 Accepts]: Start accepts. Operand has 53 places, 41 transitions, 98 flow [2022-12-13 00:37:43,403 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:43,403 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:43,403 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 41 transitions, 98 flow [2022-12-13 00:37:43,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 41 transitions, 98 flow [2022-12-13 00:37:43,408 INFO L130 PetriNetUnfolder]: 0/41 cut-off events. [2022-12-13 00:37:43,408 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:37:43,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 104 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:37:43,409 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 41 transitions, 98 flow [2022-12-13 00:37:43,409 INFO L226 LiptonReduction]: Number of co-enabled transitions 1000 [2022-12-13 00:37:43,505 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:37:43,507 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 00:37:43,507 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 96 flow [2022-12-13 00:37:43,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:37:43,507 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:43,507 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:43,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:37:43,508 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:43,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:43,516 INFO L85 PathProgramCache]: Analyzing trace with hash -759855160, now seen corresponding path program 1 times [2022-12-13 00:37:43,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:43,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591578373] [2022-12-13 00:37:43,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:43,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:43,916 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:37:43,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:43,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591578373] [2022-12-13 00:37:43,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591578373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:43,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:43,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:37:43,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096120326] [2022-12-13 00:37:43,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:43,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:37:43,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:43,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:37:43,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:37:43,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 00:37:43,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:37:43,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:43,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 00:37:43,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:45,617 INFO L130 PetriNetUnfolder]: 20292/29060 cut-off events. [2022-12-13 00:37:45,617 INFO L131 PetriNetUnfolder]: For 2268/2268 co-relation queries the response was YES. [2022-12-13 00:37:45,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59724 conditions, 29060 events. 20292/29060 cut-off events. For 2268/2268 co-relation queries the response was YES. Maximal size of possible extension queue 1049. Compared 184796 event pairs, 1069 based on Foata normal form. 600/24357 useless extension candidates. Maximal degree in co-relation 59713. Up to 20126 conditions per place. [2022-12-13 00:37:45,789 INFO L137 encePairwiseOnDemand]: 28/40 looper letters, 61 selfloop transitions, 13 changer transitions 0/84 dead transitions. [2022-12-13 00:37:45,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 84 transitions, 348 flow [2022-12-13 00:37:45,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:37:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:37:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2022-12-13 00:37:45,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.725 [2022-12-13 00:37:45,791 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 96 flow. Second operand 4 states and 116 transitions. [2022-12-13 00:37:45,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 84 transitions, 348 flow [2022-12-13 00:37:45,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 84 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:37:45,794 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 177 flow [2022-12-13 00:37:45,794 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2022-12-13 00:37:45,795 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -29 predicate places. [2022-12-13 00:37:45,795 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:45,795 INFO L89 Accepts]: Start accepts. Operand has 55 places, 51 transitions, 177 flow [2022-12-13 00:37:45,795 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:45,796 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:45,796 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions, 177 flow [2022-12-13 00:37:45,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 177 flow [2022-12-13 00:37:45,876 INFO L130 PetriNetUnfolder]: 640/1561 cut-off events. [2022-12-13 00:37:45,877 INFO L131 PetriNetUnfolder]: For 270/270 co-relation queries the response was YES. [2022-12-13 00:37:45,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3072 conditions, 1561 events. 640/1561 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 12209 event pairs, 364 based on Foata normal form. 0/1171 useless extension candidates. Maximal degree in co-relation 3062. Up to 853 conditions per place. [2022-12-13 00:37:45,893 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 51 transitions, 177 flow [2022-12-13 00:37:45,893 INFO L226 LiptonReduction]: Number of co-enabled transitions 1238 [2022-12-13 00:37:45,913 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:45,914 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 00:37:45,914 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 177 flow [2022-12-13 00:37:45,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:37:45,914 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:45,915 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:45,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:37:45,915 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:45,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2080673313, now seen corresponding path program 1 times [2022-12-13 00:37:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:45,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102866448] [2022-12-13 00:37:45,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:45,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:46,521 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:37:46,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:46,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102866448] [2022-12-13 00:37:46,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102866448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:46,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:46,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:37:46,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912339487] [2022-12-13 00:37:46,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:46,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:37:46,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:46,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:37:46,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:37:46,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2022-12-13 00:37:46,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:37:46,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:46,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2022-12-13 00:37:46,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:48,718 INFO L130 PetriNetUnfolder]: 17220/25506 cut-off events. [2022-12-13 00:37:48,718 INFO L131 PetriNetUnfolder]: For 10980/11120 co-relation queries the response was YES. [2022-12-13 00:37:48,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65755 conditions, 25506 events. 17220/25506 cut-off events. For 10980/11120 co-relation queries the response was YES. Maximal size of possible extension queue 1139. Compared 172333 event pairs, 4427 based on Foata normal form. 180/20866 useless extension candidates. Maximal degree in co-relation 65742. Up to 20047 conditions per place. [2022-12-13 00:37:48,883 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 68 selfloop transitions, 9 changer transitions 0/93 dead transitions. [2022-12-13 00:37:48,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 93 transitions, 481 flow [2022-12-13 00:37:48,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:37:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:37:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-12-13 00:37:48,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.69375 [2022-12-13 00:37:48,886 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 177 flow. Second operand 4 states and 111 transitions. [2022-12-13 00:37:48,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 93 transitions, 481 flow [2022-12-13 00:37:48,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 481 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:37:48,892 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 255 flow [2022-12-13 00:37:48,892 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2022-12-13 00:37:48,893 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -24 predicate places. [2022-12-13 00:37:48,893 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:48,893 INFO L89 Accepts]: Start accepts. Operand has 60 places, 59 transitions, 255 flow [2022-12-13 00:37:48,894 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:48,895 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:48,895 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 59 transitions, 255 flow [2022-12-13 00:37:48,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 59 transitions, 255 flow [2022-12-13 00:37:49,017 INFO L130 PetriNetUnfolder]: 827/2006 cut-off events. [2022-12-13 00:37:49,017 INFO L131 PetriNetUnfolder]: For 959/969 co-relation queries the response was YES. [2022-12-13 00:37:49,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4517 conditions, 2006 events. 827/2006 cut-off events. For 959/969 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 16460 event pairs, 374 based on Foata normal form. 1/1497 useless extension candidates. Maximal degree in co-relation 4503. Up to 1059 conditions per place. [2022-12-13 00:37:49,035 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 59 transitions, 255 flow [2022-12-13 00:37:49,035 INFO L226 LiptonReduction]: Number of co-enabled transitions 1470 [2022-12-13 00:37:49,038 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:49,042 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 00:37:49,043 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 255 flow [2022-12-13 00:37:49,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:37:49,043 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:49,043 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:49,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:37:49,043 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:49,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:49,043 INFO L85 PathProgramCache]: Analyzing trace with hash -638750091, now seen corresponding path program 1 times [2022-12-13 00:37:49,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:49,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312328659] [2022-12-13 00:37:49,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:49,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:49,353 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:37:49,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:49,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312328659] [2022-12-13 00:37:49,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312328659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:49,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:49,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:37:49,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461436185] [2022-12-13 00:37:49,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:49,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:37:49,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:49,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:37:49,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:37:49,358 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2022-12-13 00:37:49,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:49,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:49,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2022-12-13 00:37:49,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:51,044 INFO L130 PetriNetUnfolder]: 17285/25667 cut-off events. [2022-12-13 00:37:51,044 INFO L131 PetriNetUnfolder]: For 23159/23382 co-relation queries the response was YES. [2022-12-13 00:37:51,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73446 conditions, 25667 events. 17285/25667 cut-off events. For 23159/23382 co-relation queries the response was YES. Maximal size of possible extension queue 1131. Compared 174021 event pairs, 2749 based on Foata normal form. 131/21024 useless extension candidates. Maximal degree in co-relation 73429. Up to 19078 conditions per place. [2022-12-13 00:37:51,263 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 73 selfloop transitions, 12 changer transitions 0/101 dead transitions. [2022-12-13 00:37:51,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 101 transitions, 594 flow [2022-12-13 00:37:51,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:37:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:37:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-12-13 00:37:51,265 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7 [2022-12-13 00:37:51,265 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 255 flow. Second operand 4 states and 112 transitions. [2022-12-13 00:37:51,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 101 transitions, 594 flow [2022-12-13 00:37:51,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 101 transitions, 594 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:37:51,274 INFO L231 Difference]: Finished difference. Result has 64 places, 65 transitions, 331 flow [2022-12-13 00:37:51,274 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=331, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2022-12-13 00:37:51,276 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -20 predicate places. [2022-12-13 00:37:51,276 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:51,276 INFO L89 Accepts]: Start accepts. Operand has 64 places, 65 transitions, 331 flow [2022-12-13 00:37:51,277 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:51,277 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:51,277 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 65 transitions, 331 flow [2022-12-13 00:37:51,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 65 transitions, 331 flow [2022-12-13 00:37:51,395 INFO L130 PetriNetUnfolder]: 812/2019 cut-off events. [2022-12-13 00:37:51,395 INFO L131 PetriNetUnfolder]: For 1518/1557 co-relation queries the response was YES. [2022-12-13 00:37:51,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4936 conditions, 2019 events. 812/2019 cut-off events. For 1518/1557 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 16826 event pairs, 342 based on Foata normal form. 39/1544 useless extension candidates. Maximal degree in co-relation 4919. Up to 1050 conditions per place. [2022-12-13 00:37:51,414 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 65 transitions, 331 flow [2022-12-13 00:37:51,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 1602 [2022-12-13 00:37:51,564 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:37:51,672 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [481] $Ultimate##0-->L796: Formula: (and (= v_~y$w_buff1~0_142 v_~y$w_buff0~0_138) (not (= 0 |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|)) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_19) (= 2 v_~y$w_buff0~0_137) (= v_~y$r_buff0_thd0~0_129 v_~y$r_buff1_thd0~0_125) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= v_~y$w_buff0_used~0_245 1) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_53) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_245 256) 0)) (not (= (mod v_~y$w_buff1_used~0_220 256) 0)))) 1 0) |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~y$w_buff0_used~0_246 v_~y$w_buff1_used~0_220) (= v_~y$r_buff0_thd4~0_49 v_~y$r_buff1_thd4~0_47) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff1_thd2~0_49) (= |v_P2Thread1of1ForFork2_~arg#1.offset_7| |v_P2Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_66 1) (= |v_P2Thread1of1ForFork2_#in~arg#1.base_7| |v_P2Thread1of1ForFork2_~arg#1.base_7|)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_246, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_138, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_245, P2Thread1of1ForFork2_~arg#1.offset=|v_P2Thread1of1ForFork2_~arg#1.offset_7|, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_142, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_137, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_~arg#1.base=|v_P2Thread1of1ForFork2_~arg#1.base_7|, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_220} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 00:37:51,760 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:37:51,816 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [481] $Ultimate##0-->L796: Formula: (and (= v_~y$w_buff1~0_142 v_~y$w_buff0~0_138) (not (= 0 |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|)) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_19) (= 2 v_~y$w_buff0~0_137) (= v_~y$r_buff0_thd0~0_129 v_~y$r_buff1_thd0~0_125) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= v_~y$w_buff0_used~0_245 1) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_53) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_245 256) 0)) (not (= (mod v_~y$w_buff1_used~0_220 256) 0)))) 1 0) |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~y$w_buff0_used~0_246 v_~y$w_buff1_used~0_220) (= v_~y$r_buff0_thd4~0_49 v_~y$r_buff1_thd4~0_47) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff1_thd2~0_49) (= |v_P2Thread1of1ForFork2_~arg#1.offset_7| |v_P2Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_66 1) (= |v_P2Thread1of1ForFork2_#in~arg#1.base_7| |v_P2Thread1of1ForFork2_~arg#1.base_7|)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_246, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_138, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_245, P2Thread1of1ForFork2_~arg#1.offset=|v_P2Thread1of1ForFork2_~arg#1.offset_7|, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_142, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_137, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_~arg#1.base=|v_P2Thread1of1ForFork2_~arg#1.base_7|, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_220} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 00:37:51,904 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:37:51,904 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 628 [2022-12-13 00:37:51,904 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 351 flow [2022-12-13 00:37:51,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:51,905 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:51,905 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:51,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:37:51,905 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:51,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:51,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2007781242, now seen corresponding path program 1 times [2022-12-13 00:37:51,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:51,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452469075] [2022-12-13 00:37:51,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:51,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:52,248 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:37:52,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:52,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452469075] [2022-12-13 00:37:52,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452469075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:52,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:52,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:37:52,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739255059] [2022-12-13 00:37:52,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:52,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:37:52,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:52,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:37:52,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:37:52,251 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2022-12-13 00:37:52,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 351 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:52,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:52,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2022-12-13 00:37:52,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:54,309 INFO L130 PetriNetUnfolder]: 16825/24841 cut-off events. [2022-12-13 00:37:54,309 INFO L131 PetriNetUnfolder]: For 38256/38532 co-relation queries the response was YES. [2022-12-13 00:37:54,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76469 conditions, 24841 events. 16825/24841 cut-off events. For 38256/38532 co-relation queries the response was YES. Maximal size of possible extension queue 1181. Compared 166599 event pairs, 2866 based on Foata normal form. 152/20223 useless extension candidates. Maximal degree in co-relation 76449. Up to 19117 conditions per place. [2022-12-13 00:37:54,521 INFO L137 encePairwiseOnDemand]: 41/46 looper letters, 62 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2022-12-13 00:37:54,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 85 transitions, 575 flow [2022-12-13 00:37:54,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:37:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:37:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-12-13 00:37:54,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2022-12-13 00:37:54,523 INFO L175 Difference]: Start difference. First operand has 63 places, 64 transitions, 351 flow. Second operand 3 states and 88 transitions. [2022-12-13 00:37:54,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 85 transitions, 575 flow [2022-12-13 00:37:54,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 85 transitions, 530 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-13 00:37:54,619 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 337 flow [2022-12-13 00:37:54,619 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=337, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2022-12-13 00:37:54,619 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -20 predicate places. [2022-12-13 00:37:54,619 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:54,619 INFO L89 Accepts]: Start accepts. Operand has 64 places, 64 transitions, 337 flow [2022-12-13 00:37:54,620 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:54,620 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:54,620 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 64 transitions, 337 flow [2022-12-13 00:37:54,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 64 transitions, 337 flow [2022-12-13 00:37:54,768 INFO L130 PetriNetUnfolder]: 791/1966 cut-off events. [2022-12-13 00:37:54,769 INFO L131 PetriNetUnfolder]: For 1651/1656 co-relation queries the response was YES. [2022-12-13 00:37:54,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4681 conditions, 1966 events. 791/1966 cut-off events. For 1651/1656 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 16378 event pairs, 332 based on Foata normal form. 2/1457 useless extension candidates. Maximal degree in co-relation 4663. Up to 1021 conditions per place. [2022-12-13 00:37:54,789 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 64 transitions, 337 flow [2022-12-13 00:37:54,789 INFO L226 LiptonReduction]: Number of co-enabled transitions 1552 [2022-12-13 00:37:54,793 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:54,793 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-13 00:37:54,793 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 337 flow [2022-12-13 00:37:54,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:54,794 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:54,794 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:54,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:37:54,794 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:54,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:54,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1087884341, now seen corresponding path program 1 times [2022-12-13 00:37:54,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:54,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024885026] [2022-12-13 00:37:54,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:54,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:55,020 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:37:55,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:55,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024885026] [2022-12-13 00:37:55,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024885026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:55,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:55,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:37:55,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832315374] [2022-12-13 00:37:55,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:55,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:37:55,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:55,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:37:55,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:37:55,022 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2022-12-13 00:37:55,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 337 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:55,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:55,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2022-12-13 00:37:55,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:57,139 INFO L130 PetriNetUnfolder]: 17709/26000 cut-off events. [2022-12-13 00:37:57,139 INFO L131 PetriNetUnfolder]: For 35929/36343 co-relation queries the response was YES. [2022-12-13 00:37:57,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78248 conditions, 26000 events. 17709/26000 cut-off events. For 35929/36343 co-relation queries the response was YES. Maximal size of possible extension queue 1243. Compared 173662 event pairs, 3158 based on Foata normal form. 116/21174 useless extension candidates. Maximal degree in co-relation 78227. Up to 19728 conditions per place. [2022-12-13 00:37:57,295 INFO L137 encePairwiseOnDemand]: 37/46 looper letters, 72 selfloop transitions, 15 changer transitions 0/103 dead transitions. [2022-12-13 00:37:57,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 103 transitions, 662 flow [2022-12-13 00:37:57,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:37:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:37:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-12-13 00:37:57,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6195652173913043 [2022-12-13 00:37:57,296 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 337 flow. Second operand 4 states and 114 transitions. [2022-12-13 00:37:57,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 103 transitions, 662 flow [2022-12-13 00:37:57,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 103 transitions, 639 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 00:37:57,317 INFO L231 Difference]: Finished difference. Result has 65 places, 72 transitions, 416 flow [2022-12-13 00:37:57,317 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=416, PETRI_PLACES=65, PETRI_TRANSITIONS=72} [2022-12-13 00:37:57,318 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -19 predicate places. [2022-12-13 00:37:57,318 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:57,318 INFO L89 Accepts]: Start accepts. Operand has 65 places, 72 transitions, 416 flow [2022-12-13 00:37:57,319 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:57,319 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:57,319 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 72 transitions, 416 flow [2022-12-13 00:37:57,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 72 transitions, 416 flow [2022-12-13 00:37:57,441 INFO L130 PetriNetUnfolder]: 884/2123 cut-off events. [2022-12-13 00:37:57,441 INFO L131 PetriNetUnfolder]: For 1800/1827 co-relation queries the response was YES. [2022-12-13 00:37:57,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5689 conditions, 2123 events. 884/2123 cut-off events. For 1800/1827 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 17495 event pairs, 324 based on Foata normal form. 3/1591 useless extension candidates. Maximal degree in co-relation 5671. Up to 1138 conditions per place. [2022-12-13 00:37:57,461 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 72 transitions, 416 flow [2022-12-13 00:37:57,461 INFO L226 LiptonReduction]: Number of co-enabled transitions 1712 [2022-12-13 00:37:57,464 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:57,465 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-13 00:37:57,465 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 72 transitions, 416 flow [2022-12-13 00:37:57,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:57,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:57,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:57,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:37:57,465 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:37:57,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:57,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1087942001, now seen corresponding path program 2 times [2022-12-13 00:37:57,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:57,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535741935] [2022-12-13 00:37:57,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:57,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:57,924 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:37:57,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:57,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535741935] [2022-12-13 00:37:57,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535741935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:57,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:57,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:37:57,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497677950] [2022-12-13 00:37:57,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:57,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:37:57,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:57,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:37:57,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:37:57,926 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2022-12-13 00:37:57,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 72 transitions, 416 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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:37:57,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:57,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2022-12-13 00:37:57,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:00,279 INFO L130 PetriNetUnfolder]: 21519/30430 cut-off events. [2022-12-13 00:38:00,279 INFO L131 PetriNetUnfolder]: For 36635/36635 co-relation queries the response was YES. [2022-12-13 00:38:00,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97447 conditions, 30430 events. 21519/30430 cut-off events. For 36635/36635 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 185815 event pairs, 2417 based on Foata normal form. 50/25017 useless extension candidates. Maximal degree in co-relation 97426. Up to 24934 conditions per place. [2022-12-13 00:38:00,462 INFO L137 encePairwiseOnDemand]: 35/46 looper letters, 109 selfloop transitions, 33 changer transitions 0/152 dead transitions. [2022-12-13 00:38:00,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 152 transitions, 1063 flow [2022-12-13 00:38:00,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:38:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:38:00,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2022-12-13 00:38:00,464 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5579710144927537 [2022-12-13 00:38:00,464 INFO L175 Difference]: Start difference. First operand has 65 places, 72 transitions, 416 flow. Second operand 6 states and 154 transitions. [2022-12-13 00:38:00,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 152 transitions, 1063 flow [2022-12-13 00:38:00,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 152 transitions, 1031 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 00:38:00,484 INFO L231 Difference]: Finished difference. Result has 71 places, 92 transitions, 648 flow [2022-12-13 00:38:00,485 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=648, PETRI_PLACES=71, PETRI_TRANSITIONS=92} [2022-12-13 00:38:00,485 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -13 predicate places. [2022-12-13 00:38:00,485 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:00,485 INFO L89 Accepts]: Start accepts. Operand has 71 places, 92 transitions, 648 flow [2022-12-13 00:38:00,486 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:00,486 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:00,486 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 92 transitions, 648 flow [2022-12-13 00:38:00,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 92 transitions, 648 flow [2022-12-13 00:38:00,624 INFO L130 PetriNetUnfolder]: 972/2305 cut-off events. [2022-12-13 00:38:00,624 INFO L131 PetriNetUnfolder]: For 3363/3430 co-relation queries the response was YES. [2022-12-13 00:38:00,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7124 conditions, 2305 events. 972/2305 cut-off events. For 3363/3430 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 19216 event pairs, 296 based on Foata normal form. 5/1740 useless extension candidates. Maximal degree in co-relation 7103. Up to 1251 conditions per place. [2022-12-13 00:38:00,643 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 92 transitions, 648 flow [2022-12-13 00:38:00,643 INFO L226 LiptonReduction]: Number of co-enabled transitions 2038 [2022-12-13 00:38:00,646 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:38:00,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-13 00:38:00,647 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 92 transitions, 648 flow [2022-12-13 00:38:00,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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:38:00,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:00,647 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:00,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:38:00,648 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:38:00,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:00,648 INFO L85 PathProgramCache]: Analyzing trace with hash 312839833, now seen corresponding path program 1 times [2022-12-13 00:38:00,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:00,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641726562] [2022-12-13 00:38:00,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:00,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:01,303 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:38:01,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:01,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641726562] [2022-12-13 00:38:01,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641726562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:01,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:01,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:38:01,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659009902] [2022-12-13 00:38:01,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:01,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:38:01,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:01,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:38:01,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:38:01,305 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2022-12-13 00:38:01,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 92 transitions, 648 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:38:01,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:01,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2022-12-13 00:38:01,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:03,685 INFO L130 PetriNetUnfolder]: 20886/30756 cut-off events. [2022-12-13 00:38:03,685 INFO L131 PetriNetUnfolder]: For 80612/81212 co-relation queries the response was YES. [2022-12-13 00:38:03,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111022 conditions, 30756 events. 20886/30756 cut-off events. For 80612/81212 co-relation queries the response was YES. Maximal size of possible extension queue 1596. Compared 211530 event pairs, 3403 based on Foata normal form. 298/25294 useless extension candidates. Maximal degree in co-relation 110998. Up to 20185 conditions per place. [2022-12-13 00:38:03,949 INFO L137 encePairwiseOnDemand]: 37/46 looper letters, 99 selfloop transitions, 29 changer transitions 0/146 dead transitions. [2022-12-13 00:38:03,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 146 transitions, 1236 flow [2022-12-13 00:38:03,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:38:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:38:03,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-12-13 00:38:03,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6413043478260869 [2022-12-13 00:38:03,951 INFO L175 Difference]: Start difference. First operand has 71 places, 92 transitions, 648 flow. Second operand 4 states and 118 transitions. [2022-12-13 00:38:03,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 146 transitions, 1236 flow [2022-12-13 00:38:04,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 146 transitions, 1199 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 00:38:04,013 INFO L231 Difference]: Finished difference. Result has 74 places, 104 transitions, 830 flow [2022-12-13 00:38:04,014 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=830, PETRI_PLACES=74, PETRI_TRANSITIONS=104} [2022-12-13 00:38:04,014 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -10 predicate places. [2022-12-13 00:38:04,014 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:04,014 INFO L89 Accepts]: Start accepts. Operand has 74 places, 104 transitions, 830 flow [2022-12-13 00:38:04,015 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:04,015 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:04,015 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 104 transitions, 830 flow [2022-12-13 00:38:04,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 104 transitions, 830 flow [2022-12-13 00:38:04,358 INFO L130 PetriNetUnfolder]: 1178/2708 cut-off events. [2022-12-13 00:38:04,358 INFO L131 PetriNetUnfolder]: For 6163/6410 co-relation queries the response was YES. [2022-12-13 00:38:04,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9537 conditions, 2708 events. 1178/2708 cut-off events. For 6163/6410 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 22423 event pairs, 290 based on Foata normal form. 4/2082 useless extension candidates. Maximal degree in co-relation 9514. Up to 1515 conditions per place. [2022-12-13 00:38:04,388 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 104 transitions, 830 flow [2022-12-13 00:38:04,388 INFO L226 LiptonReduction]: Number of co-enabled transitions 2306 [2022-12-13 00:38:04,393 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:38:04,394 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 380 [2022-12-13 00:38:04,394 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 104 transitions, 830 flow [2022-12-13 00:38:04,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:38:04,394 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:04,394 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:04,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:38:04,394 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:38:04,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:04,395 INFO L85 PathProgramCache]: Analyzing trace with hash 665585821, now seen corresponding path program 2 times [2022-12-13 00:38:04,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:04,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407179436] [2022-12-13 00:38:04,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:04,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:04,931 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:38:04,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:04,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407179436] [2022-12-13 00:38:04,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407179436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:04,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:04,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:38:04,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857588246] [2022-12-13 00:38:04,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:04,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:38:04,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:04,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:38:04,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:38:04,933 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2022-12-13 00:38:04,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 104 transitions, 830 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:38:04,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:04,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2022-12-13 00:38:04,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:07,600 INFO L130 PetriNetUnfolder]: 21870/32216 cut-off events. [2022-12-13 00:38:07,600 INFO L131 PetriNetUnfolder]: For 119667/120268 co-relation queries the response was YES. [2022-12-13 00:38:07,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127440 conditions, 32216 events. 21870/32216 cut-off events. For 119667/120268 co-relation queries the response was YES. Maximal size of possible extension queue 1731. Compared 224337 event pairs, 2960 based on Foata normal form. 268/26280 useless extension candidates. Maximal degree in co-relation 127414. Up to 21944 conditions per place. [2022-12-13 00:38:07,987 INFO L137 encePairwiseOnDemand]: 34/46 looper letters, 112 selfloop transitions, 37 changer transitions 0/167 dead transitions. [2022-12-13 00:38:07,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 167 transitions, 1551 flow [2022-12-13 00:38:07,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:38:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:38:07,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2022-12-13 00:38:07,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6217391304347826 [2022-12-13 00:38:07,990 INFO L175 Difference]: Start difference. First operand has 74 places, 104 transitions, 830 flow. Second operand 5 states and 143 transitions. [2022-12-13 00:38:07,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 167 transitions, 1551 flow [2022-12-13 00:38:08,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 167 transitions, 1513 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:38:08,035 INFO L231 Difference]: Finished difference. Result has 77 places, 116 transitions, 1070 flow [2022-12-13 00:38:08,035 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1070, PETRI_PLACES=77, PETRI_TRANSITIONS=116} [2022-12-13 00:38:08,036 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -7 predicate places. [2022-12-13 00:38:08,036 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:08,036 INFO L89 Accepts]: Start accepts. Operand has 77 places, 116 transitions, 1070 flow [2022-12-13 00:38:08,037 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:08,037 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:08,037 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 116 transitions, 1070 flow [2022-12-13 00:38:08,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 116 transitions, 1070 flow [2022-12-13 00:38:08,273 INFO L130 PetriNetUnfolder]: 1239/2839 cut-off events. [2022-12-13 00:38:08,273 INFO L131 PetriNetUnfolder]: For 8998/9249 co-relation queries the response was YES. [2022-12-13 00:38:08,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10601 conditions, 2839 events. 1239/2839 cut-off events. For 8998/9249 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 23857 event pairs, 324 based on Foata normal form. 4/2185 useless extension candidates. Maximal degree in co-relation 10577. Up to 1600 conditions per place. [2022-12-13 00:38:08,304 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 116 transitions, 1070 flow [2022-12-13 00:38:08,305 INFO L226 LiptonReduction]: Number of co-enabled transitions 2518 [2022-12-13 00:38:08,310 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:38:08,311 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 275 [2022-12-13 00:38:08,311 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 116 transitions, 1070 flow [2022-12-13 00:38:08,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:38:08,311 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:08,311 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:08,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:38:08,311 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:38:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:08,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1015560438, now seen corresponding path program 1 times [2022-12-13 00:38:08,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:08,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082584576] [2022-12-13 00:38:08,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:08,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:08,759 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:38:08,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:08,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082584576] [2022-12-13 00:38:08,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082584576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:08,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:08,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:38:08,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530955726] [2022-12-13 00:38:08,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:08,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:38:08,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:08,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:38:08,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:38:08,760 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2022-12-13 00:38:08,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 116 transitions, 1070 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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:38:08,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:08,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2022-12-13 00:38:08,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:11,378 INFO L130 PetriNetUnfolder]: 22535/32910 cut-off events. [2022-12-13 00:38:11,378 INFO L131 PetriNetUnfolder]: For 158456/159107 co-relation queries the response was YES. [2022-12-13 00:38:11,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134420 conditions, 32910 events. 22535/32910 cut-off events. For 158456/159107 co-relation queries the response was YES. Maximal size of possible extension queue 1822. Compared 225917 event pairs, 6388 based on Foata normal form. 270/26512 useless extension candidates. Maximal degree in co-relation 134393. Up to 23831 conditions per place. [2022-12-13 00:38:11,663 INFO L137 encePairwiseOnDemand]: 35/46 looper letters, 116 selfloop transitions, 39 changer transitions 0/173 dead transitions. [2022-12-13 00:38:11,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 173 transitions, 1861 flow [2022-12-13 00:38:11,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:38:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:38:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2022-12-13 00:38:11,665 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5782608695652174 [2022-12-13 00:38:11,665 INFO L175 Difference]: Start difference. First operand has 77 places, 116 transitions, 1070 flow. Second operand 5 states and 133 transitions. [2022-12-13 00:38:11,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 173 transitions, 1861 flow [2022-12-13 00:38:11,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 173 transitions, 1726 flow, removed 35 selfloop flow, removed 3 redundant places. [2022-12-13 00:38:11,801 INFO L231 Difference]: Finished difference. Result has 80 places, 134 transitions, 1339 flow [2022-12-13 00:38:11,801 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1339, PETRI_PLACES=80, PETRI_TRANSITIONS=134} [2022-12-13 00:38:11,802 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -4 predicate places. [2022-12-13 00:38:11,802 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:11,802 INFO L89 Accepts]: Start accepts. Operand has 80 places, 134 transitions, 1339 flow [2022-12-13 00:38:11,804 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:11,805 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:11,805 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 134 transitions, 1339 flow [2022-12-13 00:38:11,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 134 transitions, 1339 flow [2022-12-13 00:38:12,028 INFO L130 PetriNetUnfolder]: 1189/2819 cut-off events. [2022-12-13 00:38:12,028 INFO L131 PetriNetUnfolder]: For 8603/8854 co-relation queries the response was YES. [2022-12-13 00:38:12,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10246 conditions, 2819 events. 1189/2819 cut-off events. For 8603/8854 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 24317 event pairs, 302 based on Foata normal form. 4/2137 useless extension candidates. Maximal degree in co-relation 10221. Up to 1542 conditions per place. [2022-12-13 00:38:12,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 134 transitions, 1339 flow [2022-12-13 00:38:12,067 INFO L226 LiptonReduction]: Number of co-enabled transitions 2802 [2022-12-13 00:38:12,095 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:38:12,097 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 295 [2022-12-13 00:38:12,097 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 134 transitions, 1339 flow [2022-12-13 00:38:12,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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:38:12,097 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:12,098 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:12,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:38:12,098 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:38:12,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:12,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1419475111, now seen corresponding path program 1 times [2022-12-13 00:38:12,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:12,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110774270] [2022-12-13 00:38:12,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:12,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:12,481 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:38:12,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:12,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110774270] [2022-12-13 00:38:12,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110774270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:12,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:12,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:38:12,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428140188] [2022-12-13 00:38:12,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:12,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:38:12,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:12,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:38:12,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:38:12,482 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2022-12-13 00:38:12,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 134 transitions, 1339 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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:38:12,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:12,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2022-12-13 00:38:12,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:17,050 INFO L130 PetriNetUnfolder]: 37322/53712 cut-off events. [2022-12-13 00:38:17,050 INFO L131 PetriNetUnfolder]: For 180877/180877 co-relation queries the response was YES. [2022-12-13 00:38:17,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201334 conditions, 53712 events. 37322/53712 cut-off events. For 180877/180877 co-relation queries the response was YES. Maximal size of possible extension queue 2361. Compared 367551 event pairs, 2475 based on Foata normal form. 504/44048 useless extension candidates. Maximal degree in co-relation 201306. Up to 19823 conditions per place. [2022-12-13 00:38:17,435 INFO L137 encePairwiseOnDemand]: 31/46 looper letters, 137 selfloop transitions, 78 changer transitions 67/292 dead transitions. [2022-12-13 00:38:17,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 292 transitions, 3331 flow [2022-12-13 00:38:17,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:38:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:38:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2022-12-13 00:38:17,437 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6304347826086957 [2022-12-13 00:38:17,437 INFO L175 Difference]: Start difference. First operand has 80 places, 134 transitions, 1339 flow. Second operand 6 states and 174 transitions. [2022-12-13 00:38:17,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 292 transitions, 3331 flow [2022-12-13 00:38:17,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 292 transitions, 3318 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 00:38:17,590 INFO L231 Difference]: Finished difference. Result has 88 places, 156 transitions, 1846 flow [2022-12-13 00:38:17,590 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1326, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1846, PETRI_PLACES=88, PETRI_TRANSITIONS=156} [2022-12-13 00:38:17,590 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, 4 predicate places. [2022-12-13 00:38:17,590 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:17,591 INFO L89 Accepts]: Start accepts. Operand has 88 places, 156 transitions, 1846 flow [2022-12-13 00:38:17,592 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:17,592 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:17,592 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 156 transitions, 1846 flow [2022-12-13 00:38:17,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 156 transitions, 1846 flow [2022-12-13 00:38:17,860 INFO L130 PetriNetUnfolder]: 1276/3241 cut-off events. [2022-12-13 00:38:17,860 INFO L131 PetriNetUnfolder]: For 12185/12588 co-relation queries the response was YES. [2022-12-13 00:38:17,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13375 conditions, 3241 events. 1276/3241 cut-off events. For 12185/12588 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 30204 event pairs, 302 based on Foata normal form. 6/2442 useless extension candidates. Maximal degree in co-relation 13345. Up to 1726 conditions per place. [2022-12-13 00:38:17,899 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 156 transitions, 1846 flow [2022-12-13 00:38:17,899 INFO L226 LiptonReduction]: Number of co-enabled transitions 2964 [2022-12-13 00:38:17,911 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:38:17,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 322 [2022-12-13 00:38:17,912 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 156 transitions, 1846 flow [2022-12-13 00:38:17,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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:38:17,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:17,912 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:17,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:38:17,913 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:38:17,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:17,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1561589462, now seen corresponding path program 1 times [2022-12-13 00:38:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:17,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111052172] [2022-12-13 00:38:17,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:17,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:18,001 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:38:18,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:18,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111052172] [2022-12-13 00:38:18,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111052172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:18,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:18,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:38:18,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043392382] [2022-12-13 00:38:18,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:18,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:38:18,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:18,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:38:18,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:38:18,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2022-12-13 00:38:18,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 156 transitions, 1846 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:38:18,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:18,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2022-12-13 00:38:18,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:26,087 INFO L130 PetriNetUnfolder]: 61416/87605 cut-off events. [2022-12-13 00:38:26,087 INFO L131 PetriNetUnfolder]: For 520247/524577 co-relation queries the response was YES. [2022-12-13 00:38:26,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343215 conditions, 87605 events. 61416/87605 cut-off events. For 520247/524577 co-relation queries the response was YES. Maximal size of possible extension queue 5225. Compared 665642 event pairs, 18419 based on Foata normal form. 5719/58895 useless extension candidates. Maximal degree in co-relation 343182. Up to 66685 conditions per place. [2022-12-13 00:38:26,846 INFO L137 encePairwiseOnDemand]: 31/46 looper letters, 333 selfloop transitions, 26 changer transitions 34/415 dead transitions. [2022-12-13 00:38:26,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 415 transitions, 5964 flow [2022-12-13 00:38:26,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:38:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:38:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2022-12-13 00:38:26,848 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7391304347826086 [2022-12-13 00:38:26,848 INFO L175 Difference]: Start difference. First operand has 88 places, 156 transitions, 1846 flow. Second operand 5 states and 170 transitions. [2022-12-13 00:38:26,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 415 transitions, 5964 flow [2022-12-13 00:38:27,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 415 transitions, 5946 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-12-13 00:38:27,305 INFO L231 Difference]: Finished difference. Result has 95 places, 171 transitions, 1914 flow [2022-12-13 00:38:27,305 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1687, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1914, PETRI_PLACES=95, PETRI_TRANSITIONS=171} [2022-12-13 00:38:27,305 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, 11 predicate places. [2022-12-13 00:38:27,305 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:27,305 INFO L89 Accepts]: Start accepts. Operand has 95 places, 171 transitions, 1914 flow [2022-12-13 00:38:27,306 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:27,306 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:27,306 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 171 transitions, 1914 flow [2022-12-13 00:38:27,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 171 transitions, 1914 flow [2022-12-13 00:38:31,466 INFO L130 PetriNetUnfolder]: 31693/50171 cut-off events. [2022-12-13 00:38:31,467 INFO L131 PetriNetUnfolder]: For 119990/147319 co-relation queries the response was YES. [2022-12-13 00:38:31,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182535 conditions, 50171 events. 31693/50171 cut-off events. For 119990/147319 co-relation queries the response was YES. Maximal size of possible extension queue 6609. Compared 485017 event pairs, 15722 based on Foata normal form. 186/22516 useless extension candidates. Maximal degree in co-relation 182500. Up to 40897 conditions per place. [2022-12-13 00:38:32,265 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 171 transitions, 1914 flow [2022-12-13 00:38:32,265 INFO L226 LiptonReduction]: Number of co-enabled transitions 4598 [2022-12-13 00:38:32,587 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [506] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (mod v_~main$tmp_guard0~0_54 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_54 (ite (= (ite (= v_~__unbuffered_cnt~0_313 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_49|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_43|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [498] L754-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork3_#res.offset_9| 0) (= |v_P0Thread1of1ForFork3_#res.base_9| 0) (= v_~__unbuffered_cnt~0_305 (+ v_~__unbuffered_cnt~0_306 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_306} OutVars{P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_305, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset] [2022-12-13 00:38:32,619 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [506] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (mod v_~main$tmp_guard0~0_54 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_54 (ite (= (ite (= v_~__unbuffered_cnt~0_313 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_49|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_43|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [434] L776-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_78 1) v_~__unbuffered_cnt~0_77) (= |v_P1Thread1of1ForFork1_#res.offset_13| 0) (= |v_P1Thread1of1ForFork1_#res.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_13|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-13 00:38:32,649 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [506] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (mod v_~main$tmp_guard0~0_54 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_54 (ite (= (ite (= v_~__unbuffered_cnt~0_313 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_49|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_43|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [382] L806-->L809: 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:38:32,669 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [506] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (mod v_~main$tmp_guard0~0_54 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_54 (ite (= (ite (= v_~__unbuffered_cnt~0_313 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_49|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_43|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [390] L829-->L832: Formula: (= (+ v_~__unbuffered_cnt~0_8 1) v_~__unbuffered_cnt~0_7) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:38:32,689 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [506] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (mod v_~main$tmp_guard0~0_54 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_54 (ite (= (ite (= v_~__unbuffered_cnt~0_313 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_49|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_43|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [435] L806-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork2_#res#1.offset_5| 0) (= |v_P2Thread1of1ForFork2_#res#1.base_5| 0) (= (+ v_~__unbuffered_cnt~0_92 1) v_~__unbuffered_cnt~0_91)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92} OutVars{P2Thread1of1ForFork2_#res#1.offset=|v_P2Thread1of1ForFork2_#res#1.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, P2Thread1of1ForFork2_#res#1.base=|v_P2Thread1of1ForFork2_#res#1.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res#1.base] [2022-12-13 00:38:32,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [506] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (mod v_~main$tmp_guard0~0_54 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_54 (ite (= (ite (= v_~__unbuffered_cnt~0_313 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_49|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_43|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [428] L829-->P3FINAL: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= |v_P3Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_60 1) v_~__unbuffered_cnt~0_59)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-13 00:38:32,745 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [506] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (mod v_~main$tmp_guard0~0_54 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_54 (ite (= (ite (= v_~__unbuffered_cnt~0_313 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_49|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_43|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [488] L806-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res#1.offset_23| 0) (= v_~__unbuffered_cnt~0_231 (+ v_~__unbuffered_cnt~0_232 1)) (= |v_P2Thread1of1ForFork2_#res#1.base_23| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_232} OutVars{P2Thread1of1ForFork2_#res#1.offset=|v_P2Thread1of1ForFork2_#res#1.offset_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_231, P2Thread1of1ForFork2_#res#1.base=|v_P2Thread1of1ForFork2_#res#1.base_23|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res#1.base] [2022-12-13 00:38:32,774 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [506] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (mod v_~main$tmp_guard0~0_54 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_54 (ite (= (ite (= v_~__unbuffered_cnt~0_313 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_49|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_43|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [367] L754-->L759: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:38:32,794 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [506] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (mod v_~main$tmp_guard0~0_54 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_54 (ite (= (ite (= v_~__unbuffered_cnt~0_313 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_49|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_43|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [465] L829-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_11| 0) (= |v_P3Thread1of1ForFork0_#res.offset_11| 0) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_11|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-13 00:38:32,822 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [506] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (mod v_~main$tmp_guard0~0_54 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_54 (ite (= (ite (= v_~__unbuffered_cnt~0_313 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_49|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_43|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [374] L776-->L779: 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:38:32,842 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [506] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (mod v_~main$tmp_guard0~0_54 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_54 (ite (= (ite (= v_~__unbuffered_cnt~0_313 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_49|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_43|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [497] L754-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork3_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_301 (+ v_~__unbuffered_cnt~0_302 1)) (= |v_P0Thread1of1ForFork3_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_302} OutVars{P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_301, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset] [2022-12-13 00:38:32,868 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [506] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (mod v_~main$tmp_guard0~0_54 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_54 (ite (= (ite (= v_~__unbuffered_cnt~0_313 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_49|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_43|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [406] L776-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= |v_P1Thread1of1ForFork1_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-13 00:38:33,191 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:38:33,192 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5887 [2022-12-13 00:38:33,192 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 170 transitions, 1956 flow [2022-12-13 00:38:33,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:38:33,192 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:33,192 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:33,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:38:33,192 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:38:33,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:33,192 INFO L85 PathProgramCache]: Analyzing trace with hash -668982515, now seen corresponding path program 1 times [2022-12-13 00:38:33,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:33,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737598425] [2022-12-13 00:38:33,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:33,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:33,445 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:38:33,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:33,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737598425] [2022-12-13 00:38:33,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737598425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:33,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:33,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:38:33,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620802637] [2022-12-13 00:38:33,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:33,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:38:33,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:33,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:38:33,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:38:33,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 58 [2022-12-13 00:38:33,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 170 transitions, 1956 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:33,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:33,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 58 [2022-12-13 00:38:33,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand