/usr/bin/java -Xmx16000000000 -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/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 12:49:15,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 12:49:15,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 12:49:15,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 12:49:15,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 12:49:15,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 12:49:15,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 12:49:15,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 12:49:15,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 12:49:15,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 12:49:15,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 12:49:15,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 12:49:15,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 12:49:15,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 12:49:15,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 12:49:15,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 12:49:15,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 12:49:15,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 12:49:15,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 12:49:15,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 12:49:15,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 12:49:15,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 12:49:15,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 12:49:15,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 12:49:15,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 12:49:15,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 12:49:15,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 12:49:15,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 12:49:15,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 12:49:15,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 12:49:15,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 12:49:15,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 12:49:15,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 12:49:15,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 12:49:15,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 12:49:15,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 12:49:15,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 12:49:15,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 12:49:15,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 12:49:15,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 12:49:15,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 12:49:15,727 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 [2021-03-25 12:49:15,748 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 12:49:15,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 12:49:15,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 12:49:15,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 12:49:15,750 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 12:49:15,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 12:49:15,750 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 12:49:15,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 12:49:15,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 12:49:15,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 12:49:15,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 12:49:15,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 12:49:15,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 12:49:15,751 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 12:49:15,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 12:49:15,752 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 12:49:15,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 12:49:15,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 12:49:15,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 12:49:15,752 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 12:49:15,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 12:49:15,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 12:49:15,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 12:49:15,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 12:49:15,753 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 12:49:15,753 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 12:49:15,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 12:49:15,754 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 12:49:15,754 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 12:49:15,754 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true 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 [2021-03-25 12:49:16,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 12:49:16,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 12:49:16,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 12:49:16,041 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 12:49:16,045 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 12:49:16,047 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2021-03-25 12:49:16,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f74a93b1/92e3cc9e5c6847fbbffc12e7338cddd7/FLAGd09f180df [2021-03-25 12:49:16,688 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 12:49:16,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2021-03-25 12:49:16,703 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f74a93b1/92e3cc9e5c6847fbbffc12e7338cddd7/FLAGd09f180df [2021-03-25 12:49:17,120 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f74a93b1/92e3cc9e5c6847fbbffc12e7338cddd7 [2021-03-25 12:49:17,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 12:49:17,124 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 12:49:17,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 12:49:17,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 12:49:17,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 12:49:17,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 12:49:17" (1/1) ... [2021-03-25 12:49:17,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@978b61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:49:17, skipping insertion in model container [2021-03-25 12:49:17,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 12:49:17" (1/1) ... [2021-03-25 12:49:17,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 12:49:17,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 12:49:17,327 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-25 12:49:17,563 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i[55547,55560] [2021-03-25 12:49:17,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 12:49:17,591 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 12:49:17,621 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-25 12:49:17,644 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i[55547,55560] [2021-03-25 12:49:17,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 12:49:17,798 INFO L208 MainTranslator]: Completed translation [2021-03-25 12:49:17,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:49:17 WrapperNode [2021-03-25 12:49:17,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 12:49:17,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 12:49:17,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 12:49:17,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 12:49:17,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:49:17" (1/1) ... [2021-03-25 12:49:17,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:49:17" (1/1) ... [2021-03-25 12:49:17,867 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 12:49:17,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 12:49:17,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 12:49:17,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 12:49:17,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:49:17" (1/1) ... [2021-03-25 12:49:17,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:49:17" (1/1) ... [2021-03-25 12:49:17,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:49:17" (1/1) ... [2021-03-25 12:49:17,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:49:17" (1/1) ... [2021-03-25 12:49:17,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:49:17" (1/1) ... [2021-03-25 12:49:17,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:49:17" (1/1) ... [2021-03-25 12:49:17,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:49:17" (1/1) ... [2021-03-25 12:49:17,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 12:49:17,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 12:49:17,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 12:49:17,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 12:49:17,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:49:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 12:49:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 12:49:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 12:49:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 12:49:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 12:49:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 12:49:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2021-03-25 12:49:17,970 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2021-03-25 12:49:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-25 12:49:17,970 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-25 12:49:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-25 12:49:17,971 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-25 12:49:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-25 12:49:17,971 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-25 12:49:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 12:49:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-03-25 12:49:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 12:49:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 12:49:17,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 12:49:17,972 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 12:49:18,351 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 12:49:18,352 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-03-25 12:49:18,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 12:49:18 BoogieIcfgContainer [2021-03-25 12:49:18,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 12:49:18,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 12:49:18,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 12:49:18,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 12:49:18,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 12:49:17" (1/3) ... [2021-03-25 12:49:18,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fb0509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 12:49:18, skipping insertion in model container [2021-03-25 12:49:18,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 12:49:17" (2/3) ... [2021-03-25 12:49:18,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fb0509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 12:49:18, skipping insertion in model container [2021-03-25 12:49:18,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 12:49:18" (3/3) ... [2021-03-25 12:49:18,364 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2021-03-25 12:49:18,368 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 12:49:18,375 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-25 12:49:18,375 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 12:49:18,415 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,415 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,416 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,416 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,419 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,419 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,420 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,420 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,420 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,421 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,421 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,421 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,421 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,421 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,422 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,423 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,423 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,423 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,423 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,423 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,425 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,425 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,425 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,425 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,426 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,426 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,426 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,427 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,427 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,427 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,428 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,428 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,428 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,429 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,429 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,429 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,429 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,430 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,430 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,430 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,430 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,430 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,431 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,431 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,431 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,431 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,431 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,431 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,431 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,431 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,432 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,432 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,432 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,432 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,432 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,432 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,432 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,432 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,432 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,433 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,433 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,433 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,433 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,433 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,433 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,434 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,434 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,434 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,434 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,434 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,434 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,434 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,434 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,434 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,435 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,435 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,435 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,435 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,435 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,435 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,437 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,437 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,437 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,437 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,437 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,438 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,440 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,441 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,441 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,441 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,443 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,443 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,443 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,443 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,443 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,444 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,444 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,444 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,444 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,444 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,444 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,444 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,444 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,445 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,445 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,445 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,445 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,445 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,445 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,445 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,445 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,445 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,446 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,446 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,446 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,446 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,446 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,446 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,446 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,447 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,447 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,447 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,447 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,447 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,448 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,448 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,448 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,448 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,448 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,448 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,448 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,448 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,449 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,449 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,450 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,450 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,450 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,450 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,450 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,450 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,451 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,451 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,451 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,451 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,452 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,452 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,452 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,452 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,453 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,453 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,453 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,453 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,454 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,454 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,455 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,455 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,455 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,456 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,456 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,456 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,456 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,456 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,456 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,456 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,456 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,456 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,456 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,457 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,457 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,457 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,457 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,457 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,457 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,457 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,457 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,458 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,458 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,458 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,458 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,458 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,459 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,459 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,459 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,459 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,459 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,459 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,459 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,459 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,460 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,460 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,460 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,460 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,465 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,465 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,465 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,465 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,473 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,473 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,473 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,474 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,475 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,475 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,475 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,475 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,477 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,477 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,477 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,477 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,477 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,477 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,479 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,488 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,488 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,489 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,489 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,489 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,489 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,489 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,489 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,489 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,489 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,489 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,490 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,490 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,490 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,490 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,490 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,490 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,490 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,490 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,490 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,491 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,491 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,491 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,495 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,496 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,496 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,496 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,497 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,497 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,497 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,498 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,498 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,498 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,499 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,499 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,499 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,499 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,503 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,503 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,503 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,503 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,504 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,504 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,504 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,504 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,505 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,505 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,506 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,506 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 12:49:18,619 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2021-03-25 12:49:18,640 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-03-25 12:49:18,660 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 12:49:18,660 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 12:49:18,660 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 12:49:18,660 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 12:49:18,660 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 12:49:18,660 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 12:49:18,661 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 12:49:18,661 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 12:49:18,676 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 248 transitions, 876 flow [2021-03-25 12:49:18,765 INFO L129 PetriNetUnfolder]: 61/274 cut-off events. [2021-03-25 12:49:18,765 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-03-25 12:49:18,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 274 events. 61/274 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 804 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 330. Up to 24 conditions per place. [2021-03-25 12:49:18,774 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 248 transitions, 876 flow [2021-03-25 12:49:18,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 140 transitions, 433 flow [2021-03-25 12:49:18,782 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:18,791 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 140 transitions, 433 flow [2021-03-25 12:49:18,794 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 140 transitions, 433 flow [2021-03-25 12:49:18,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 140 transitions, 433 flow [2021-03-25 12:49:18,834 INFO L129 PetriNetUnfolder]: 61/274 cut-off events. [2021-03-25 12:49:18,835 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-03-25 12:49:18,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 274 events. 61/274 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 770 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 330. Up to 24 conditions per place. [2021-03-25 12:49:18,844 INFO L142 LiptonReduction]: Number of co-enabled transitions 4156 [2021-03-25 12:49:20,765 INFO L154 LiptonReduction]: Checked pairs total: 2005 [2021-03-25 12:49:20,766 INFO L156 LiptonReduction]: Total number of compositions: 60 [2021-03-25 12:49:20,768 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1987 [2021-03-25 12:49:20,777 INFO L129 PetriNetUnfolder]: 2/17 cut-off events. [2021-03-25 12:49:20,777 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 12:49:20,777 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:20,778 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:20,778 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:20,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:20,782 INFO L82 PathProgramCache]: Analyzing trace with hash -828543654, now seen corresponding path program 1 times [2021-03-25 12:49:20,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:20,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638513467] [2021-03-25 12:49:20,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:21,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:21,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:21,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:21,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 12:49:21,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:21,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:49:21,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:21,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:49:21,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:21,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:49:21,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:21,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:49:21,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:21,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:21,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:21,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:21,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638513467] [2021-03-25 12:49:21,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:21,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 12:49:21,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533686250] [2021-03-25 12:49:21,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 12:49:21,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:21,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 12:49:21,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-25 12:49:21,106 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 319 [2021-03-25 12:49:21,116 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 84 transitions, 321 flow. Second operand has 8 states, 8 states have (on average 183.375) internal successors, (1467), 8 states have internal predecessors, (1467), 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) [2021-03-25 12:49:21,116 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:21,116 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 319 [2021-03-25 12:49:21,117 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:21,749 INFO L129 PetriNetUnfolder]: 2937/4425 cut-off events. [2021-03-25 12:49:21,749 INFO L130 PetriNetUnfolder]: For 1350/1355 co-relation queries the response was YES. [2021-03-25 12:49:21,768 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9334 conditions, 4425 events. 2937/4425 cut-off events. For 1350/1355 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 23287 event pairs, 1090 based on Foata normal form. 121/3543 useless extension candidates. Maximal degree in co-relation 9299. Up to 1639 conditions per place. [2021-03-25 12:49:21,799 INFO L132 encePairwiseOnDemand]: 306/319 looper letters, 75 selfloop transitions, 12 changer transitions 6/134 dead transitions. [2021-03-25 12:49:21,799 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 134 transitions, 640 flow [2021-03-25 12:49:21,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 12:49:21,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 12:49:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1918 transitions. [2021-03-25 12:49:21,863 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6012539184952979 [2021-03-25 12:49:21,864 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1918 transitions. [2021-03-25 12:49:21,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1918 transitions. [2021-03-25 12:49:21,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:21,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1918 transitions. [2021-03-25 12:49:21,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 191.8) internal successors, (1918), 10 states have internal predecessors, (1918), 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) [2021-03-25 12:49:21,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 319.0) internal successors, (3509), 11 states have internal predecessors, (3509), 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) [2021-03-25 12:49:21,891 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 319.0) internal successors, (3509), 11 states have internal predecessors, (3509), 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) [2021-03-25 12:49:21,892 INFO L185 Difference]: Start difference. First operand has 63 places, 84 transitions, 321 flow. Second operand 10 states and 1918 transitions. [2021-03-25 12:49:21,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 134 transitions, 640 flow [2021-03-25 12:49:21,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 134 transitions, 516 flow, removed 0 selfloop flow, removed 12 redundant places. [2021-03-25 12:49:21,914 INFO L241 Difference]: Finished difference. Result has 64 places, 87 transitions, 271 flow [2021-03-25 12:49:21,915 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=271, PETRI_PLACES=64, PETRI_TRANSITIONS=87} [2021-03-25 12:49:21,916 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places. [2021-03-25 12:49:21,916 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:21,916 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 87 transitions, 271 flow [2021-03-25 12:49:21,917 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 87 transitions, 271 flow [2021-03-25 12:49:21,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 87 transitions, 271 flow [2021-03-25 12:49:21,934 INFO L129 PetriNetUnfolder]: 115/269 cut-off events. [2021-03-25 12:49:21,934 INFO L130 PetriNetUnfolder]: For 12/13 co-relation queries the response was YES. [2021-03-25 12:49:21,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 269 events. 115/269 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 882 event pairs, 1 based on Foata normal form. 1/188 useless extension candidates. Maximal degree in co-relation 322. Up to 48 conditions per place. [2021-03-25 12:49:21,938 INFO L142 LiptonReduction]: Number of co-enabled transitions 1404 [2021-03-25 12:49:22,079 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2021-03-25 12:49:22,233 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2021-03-25 12:49:23,025 INFO L154 LiptonReduction]: Checked pairs total: 165 [2021-03-25 12:49:23,026 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-25 12:49:23,026 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1110 [2021-03-25 12:49:23,027 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 77 transitions, 249 flow [2021-03-25 12:49:23,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 183.375) internal successors, (1467), 8 states have internal predecessors, (1467), 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) [2021-03-25 12:49:23,029 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:23,029 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:23,029 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 12:49:23,029 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:23,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:23,032 INFO L82 PathProgramCache]: Analyzing trace with hash -198967952, now seen corresponding path program 2 times [2021-03-25 12:49:23,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:23,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113959814] [2021-03-25 12:49:23,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:23,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:23,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:23,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:23,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:49:23,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:23,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:49:23,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:23,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:23,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:23,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:23,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113959814] [2021-03-25 12:49:23,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:23,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 12:49:23,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674875129] [2021-03-25 12:49:23,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 12:49:23,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:23,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 12:49:23,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 12:49:23,142 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 330 [2021-03-25 12:49:23,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 77 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 226.6) internal successors, (1133), 5 states have internal predecessors, (1133), 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) [2021-03-25 12:49:23,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:23,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 330 [2021-03-25 12:49:23,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:23,626 INFO L129 PetriNetUnfolder]: 3689/5210 cut-off events. [2021-03-25 12:49:23,626 INFO L130 PetriNetUnfolder]: For 1287/1287 co-relation queries the response was YES. [2021-03-25 12:49:23,642 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10056 conditions, 5210 events. 3689/5210 cut-off events. For 1287/1287 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 24422 event pairs, 1782 based on Foata normal form. 2/3926 useless extension candidates. Maximal degree in co-relation 9004. Up to 2932 conditions per place. [2021-03-25 12:49:23,669 INFO L132 encePairwiseOnDemand]: 323/330 looper letters, 58 selfloop transitions, 6 changer transitions 0/105 dead transitions. [2021-03-25 12:49:23,670 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 105 transitions, 459 flow [2021-03-25 12:49:23,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 12:49:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 12:49:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1412 transitions. [2021-03-25 12:49:23,673 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7131313131313132 [2021-03-25 12:49:23,673 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1412 transitions. [2021-03-25 12:49:23,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1412 transitions. [2021-03-25 12:49:23,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:23,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1412 transitions. [2021-03-25 12:49:23,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 235.33333333333334) internal successors, (1412), 6 states have internal predecessors, (1412), 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) [2021-03-25 12:49:23,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 330.0) internal successors, (2310), 7 states have internal predecessors, (2310), 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) [2021-03-25 12:49:23,681 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 330.0) internal successors, (2310), 7 states have internal predecessors, (2310), 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) [2021-03-25 12:49:23,681 INFO L185 Difference]: Start difference. First operand has 53 places, 77 transitions, 249 flow. Second operand 6 states and 1412 transitions. [2021-03-25 12:49:23,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 105 transitions, 459 flow [2021-03-25 12:49:23,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 105 transitions, 446 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-03-25 12:49:23,706 INFO L241 Difference]: Finished difference. Result has 57 places, 81 transitions, 285 flow [2021-03-25 12:49:23,706 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=57, PETRI_TRANSITIONS=81} [2021-03-25 12:49:23,707 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, -6 predicate places. [2021-03-25 12:49:23,707 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:23,707 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 81 transitions, 285 flow [2021-03-25 12:49:23,707 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 81 transitions, 285 flow [2021-03-25 12:49:23,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 81 transitions, 285 flow [2021-03-25 12:49:23,727 INFO L129 PetriNetUnfolder]: 174/355 cut-off events. [2021-03-25 12:49:23,728 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2021-03-25 12:49:23,729 INFO L84 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 355 events. 174/355 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1247 event pairs, 1 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 395. Up to 72 conditions per place. [2021-03-25 12:49:23,736 INFO L142 LiptonReduction]: Number of co-enabled transitions 1154 [2021-03-25 12:49:23,745 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:49:23,746 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:49:23,746 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-03-25 12:49:23,747 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 81 transitions, 285 flow [2021-03-25 12:49:23,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 226.6) internal successors, (1133), 5 states have internal predecessors, (1133), 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) [2021-03-25 12:49:23,748 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:23,748 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:23,748 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 12:49:23,748 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:23,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:23,749 INFO L82 PathProgramCache]: Analyzing trace with hash 571325816, now seen corresponding path program 1 times [2021-03-25 12:49:23,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:23,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963343016] [2021-03-25 12:49:23,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:23,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:23,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:49:23,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:23,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:49:23,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:23,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:49:23,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:23,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:23,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:23,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:23,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:23,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963343016] [2021-03-25 12:49:23,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:23,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 12:49:23,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807880761] [2021-03-25 12:49:23,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 12:49:23,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:23,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 12:49:23,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 12:49:23,807 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 330 [2021-03-25 12:49:23,808 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 81 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 186.16666666666666) internal successors, (1117), 6 states have internal predecessors, (1117), 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) [2021-03-25 12:49:23,808 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:23,808 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 330 [2021-03-25 12:49:23,808 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:24,356 INFO L129 PetriNetUnfolder]: 4641/6448 cut-off events. [2021-03-25 12:49:24,356 INFO L130 PetriNetUnfolder]: For 2624/2624 co-relation queries the response was YES. [2021-03-25 12:49:24,372 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12783 conditions, 6448 events. 4641/6448 cut-off events. For 2624/2624 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 29829 event pairs, 2033 based on Foata normal form. 2/4762 useless extension candidates. Maximal degree in co-relation 10336. Up to 2184 conditions per place. [2021-03-25 12:49:24,403 INFO L132 encePairwiseOnDemand]: 323/330 looper letters, 81 selfloop transitions, 13 changer transitions 0/132 dead transitions. [2021-03-25 12:49:24,403 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 132 transitions, 606 flow [2021-03-25 12:49:24,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:49:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:49:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1386 transitions. [2021-03-25 12:49:24,407 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6 [2021-03-25 12:49:24,407 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1386 transitions. [2021-03-25 12:49:24,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1386 transitions. [2021-03-25 12:49:24,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:24,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1386 transitions. [2021-03-25 12:49:24,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 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) [2021-03-25 12:49:24,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 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) [2021-03-25 12:49:24,416 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 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) [2021-03-25 12:49:24,416 INFO L185 Difference]: Start difference. First operand has 57 places, 81 transitions, 285 flow. Second operand 7 states and 1386 transitions. [2021-03-25 12:49:24,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 132 transitions, 606 flow [2021-03-25 12:49:24,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 132 transitions, 595 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-25 12:49:24,429 INFO L241 Difference]: Finished difference. Result has 64 places, 83 transitions, 332 flow [2021-03-25 12:49:24,429 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=332, PETRI_PLACES=64, PETRI_TRANSITIONS=83} [2021-03-25 12:49:24,430 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places. [2021-03-25 12:49:24,430 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:24,430 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 83 transitions, 332 flow [2021-03-25 12:49:24,432 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 83 transitions, 332 flow [2021-03-25 12:49:24,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 83 transitions, 332 flow [2021-03-25 12:49:24,453 INFO L129 PetriNetUnfolder]: 230/456 cut-off events. [2021-03-25 12:49:24,453 INFO L130 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2021-03-25 12:49:24,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 456 events. 230/456 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1753 event pairs, 0 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 525. Up to 96 conditions per place. [2021-03-25 12:49:24,459 INFO L142 LiptonReduction]: Number of co-enabled transitions 1222 [2021-03-25 12:49:24,472 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:49:24,472 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:49:24,472 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42 [2021-03-25 12:49:24,473 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 83 transitions, 332 flow [2021-03-25 12:49:24,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 186.16666666666666) internal successors, (1117), 6 states have internal predecessors, (1117), 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) [2021-03-25 12:49:24,473 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:24,474 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:24,474 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 12:49:24,474 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:24,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:24,474 INFO L82 PathProgramCache]: Analyzing trace with hash -690009964, now seen corresponding path program 1 times [2021-03-25 12:49:24,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:24,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872955090] [2021-03-25 12:49:24,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:24,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:24,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:24,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:24,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:49:24,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:24,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:24,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:24,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872955090] [2021-03-25 12:49:24,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:24,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 12:49:24,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207480319] [2021-03-25 12:49:24,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 12:49:24,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:24,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 12:49:24,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 12:49:24,549 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 330 [2021-03-25 12:49:24,550 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 83 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 260.25) internal successors, (1041), 4 states have internal predecessors, (1041), 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) [2021-03-25 12:49:24,550 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:24,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 330 [2021-03-25 12:49:24,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:25,170 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_19| (select (select |v_#memory_int_124| v_~v~0.base_42) v_~v~0.offset_42)) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_19|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_124|, ~v~0.base=v_~v~0.base_42} OutVars{~v~0.offset=v_~v~0.offset_42, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_19|, #memory_int=|v_#memory_int_124|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ~v~0.base=v_~v~0.base_42, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start___VERIFIER_assert_#in~expression][33], [Black: 186#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 229#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), 44#L1156-1true, 173#(= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1), Black: 197#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 198#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 203#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 208#true, 122#L1164-2true, Black: 210#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 178#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 215#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 182#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 219#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5))]) [2021-03-25 12:49:25,171 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,171 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,171 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,171 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,171 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_19| (select (select |v_#memory_int_124| v_~v~0.base_42) v_~v~0.offset_42)) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_19|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_124|, ~v~0.base=v_~v~0.base_42} OutVars{~v~0.offset=v_~v~0.offset_42, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_19|, #memory_int=|v_#memory_int_124|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ~v~0.base=v_~v~0.base_42, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start___VERIFIER_assert_#in~expression][32], [224#true, Black: 186#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 44#L1156-1true, 173#(= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1), Black: 197#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 198#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 203#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 208#true, 122#L1164-2true, Black: 210#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 178#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 215#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 182#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 219#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5))]) [2021-03-25 12:49:25,171 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,171 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,171 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,171 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,172 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_19| (select (select |v_#memory_int_124| v_~v~0.base_42) v_~v~0.offset_42)) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_19|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_124|, ~v~0.base=v_~v~0.base_42} OutVars{~v~0.offset=v_~v~0.offset_42, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_19|, #memory_int=|v_#memory_int_124|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ~v~0.base=v_~v~0.base_42, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start___VERIFIER_assert_#in~expression][34], [Black: 186#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 229#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), 44#L1156-1true, Black: 197#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), 173#(= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1), Black: 198#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 203#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 208#true, 122#L1164-2true, Black: 210#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 215#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 178#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 182#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 219#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5))]) [2021-03-25 12:49:25,172 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,172 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,172 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,172 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,173 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_19| (select (select |v_#memory_int_124| v_~v~0.base_42) v_~v~0.offset_42)) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_19|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_124|, ~v~0.base=v_~v~0.base_42} OutVars{~v~0.offset=v_~v~0.offset_42, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_19|, #memory_int=|v_#memory_int_124|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ~v~0.base=v_~v~0.base_42, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start___VERIFIER_assert_#in~expression][42], [224#true, Black: 186#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 44#L1156-1true, Black: 197#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), 173#(= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1), Black: 198#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 203#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 208#true, 122#L1164-2true, Black: 210#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 215#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 178#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 182#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 219#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5))]) [2021-03-25 12:49:25,173 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,173 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,173 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,173 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,173 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_19| (select (select |v_#memory_int_124| v_~v~0.base_42) v_~v~0.offset_42)) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_19|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_124|, ~v~0.base=v_~v~0.base_42} OutVars{~v~0.offset=v_~v~0.offset_42, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_19|, #memory_int=|v_#memory_int_124|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ~v~0.base=v_~v~0.base_42, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start___VERIFIER_assert_#in~expression][37], [Black: 186#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 229#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), 44#L1156-1true, 173#(= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1), Black: 197#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 198#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 203#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 208#true, 122#L1164-2true, Black: 210#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 178#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 215#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 219#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 182#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-25 12:49:25,173 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,173 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,174 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,174 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,174 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_19| (select (select |v_#memory_int_124| v_~v~0.base_42) v_~v~0.offset_42)) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_19|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_124|, ~v~0.base=v_~v~0.base_42} OutVars{~v~0.offset=v_~v~0.offset_42, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_19|, #memory_int=|v_#memory_int_124|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ~v~0.base=v_~v~0.base_42, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start___VERIFIER_assert_#in~expression][36], [224#true, Black: 186#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 44#L1156-1true, 173#(= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1), Black: 197#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 198#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 203#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 208#true, 122#L1164-2true, Black: 210#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 178#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 215#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 219#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 182#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-25 12:49:25,174 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,174 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,174 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,174 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:25,175 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_19| (select (select |v_#memory_int_124| v_~v~0.base_42) v_~v~0.offset_42)) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_19|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_124|, ~v~0.base=v_~v~0.base_42} OutVars{~v~0.offset=v_~v~0.offset_42, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_19|, #memory_int=|v_#memory_int_124|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ~v~0.base=v_~v~0.base_42, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start___VERIFIER_assert_#in~expression][31], [Black: 186#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 229#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), 44#L1156-1true, 173#(= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1), Black: 197#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 198#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 203#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 208#true, 122#L1164-2true, Black: 210#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 215#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 178#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 182#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 219#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5))]) [2021-03-25 12:49:25,175 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-03-25 12:49:25,175 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 12:49:25,175 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 12:49:25,175 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 12:49:25,175 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_19| (select (select |v_#memory_int_124| v_~v~0.base_42) v_~v~0.offset_42)) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_19|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_124|, ~v~0.base=v_~v~0.base_42} OutVars{~v~0.offset=v_~v~0.offset_42, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_19|, #memory_int=|v_#memory_int_124|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ~v~0.base=v_~v~0.base_42, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start___VERIFIER_assert_#in~expression][30], [224#true, Black: 186#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 44#L1156-1true, 173#(= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1), Black: 197#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 198#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 203#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 208#true, 122#L1164-2true, Black: 210#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 215#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 178#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 219#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 182#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-25 12:49:25,176 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-03-25 12:49:25,176 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 12:49:25,176 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 12:49:25,176 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 12:49:25,178 INFO L129 PetriNetUnfolder]: 5286/7883 cut-off events. [2021-03-25 12:49:25,178 INFO L130 PetriNetUnfolder]: For 8271/8273 co-relation queries the response was YES. [2021-03-25 12:49:25,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18097 conditions, 7883 events. 5286/7883 cut-off events. For 8271/8273 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 45064 event pairs, 494 based on Foata normal form. 184/6376 useless extension candidates. Maximal degree in co-relation 10174. Up to 1976 conditions per place. [2021-03-25 12:49:25,261 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 49 selfloop transitions, 20 changer transitions 3/125 dead transitions. [2021-03-25 12:49:25,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 125 transitions, 600 flow [2021-03-25 12:49:25,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 12:49:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 12:49:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1350 transitions. [2021-03-25 12:49:25,265 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2021-03-25 12:49:25,265 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1350 transitions. [2021-03-25 12:49:25,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1350 transitions. [2021-03-25 12:49:25,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:25,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1350 transitions. [2021-03-25 12:49:25,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 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) [2021-03-25 12:49:25,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 330.0) internal successors, (1980), 6 states have internal predecessors, (1980), 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) [2021-03-25 12:49:25,272 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 330.0) internal successors, (1980), 6 states have internal predecessors, (1980), 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) [2021-03-25 12:49:25,273 INFO L185 Difference]: Start difference. First operand has 64 places, 83 transitions, 332 flow. Second operand 5 states and 1350 transitions. [2021-03-25 12:49:25,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 125 transitions, 600 flow [2021-03-25 12:49:25,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 125 transitions, 571 flow, removed 7 selfloop flow, removed 2 redundant places. [2021-03-25 12:49:25,327 INFO L241 Difference]: Finished difference. Result has 70 places, 103 transitions, 500 flow [2021-03-25 12:49:25,327 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=500, PETRI_PLACES=70, PETRI_TRANSITIONS=103} [2021-03-25 12:49:25,328 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 7 predicate places. [2021-03-25 12:49:25,328 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:25,328 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 103 transitions, 500 flow [2021-03-25 12:49:25,328 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 103 transitions, 500 flow [2021-03-25 12:49:25,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 103 transitions, 500 flow [2021-03-25 12:49:25,531 INFO L129 PetriNetUnfolder]: 1941/3440 cut-off events. [2021-03-25 12:49:25,531 INFO L130 PetriNetUnfolder]: For 2375/2429 co-relation queries the response was YES. [2021-03-25 12:49:25,546 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6308 conditions, 3440 events. 1941/3440 cut-off events. For 2375/2429 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 22958 event pairs, 95 based on Foata normal form. 6/2355 useless extension candidates. Maximal degree in co-relation 5845. Up to 704 conditions per place. [2021-03-25 12:49:25,578 INFO L142 LiptonReduction]: Number of co-enabled transitions 1916 [2021-03-25 12:49:25,583 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:49:25,583 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:49:25,584 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 256 [2021-03-25 12:49:25,588 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 103 transitions, 500 flow [2021-03-25 12:49:25,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 260.25) internal successors, (1041), 4 states have internal predecessors, (1041), 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) [2021-03-25 12:49:25,588 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:25,588 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:25,588 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 12:49:25,588 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:25,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:25,589 INFO L82 PathProgramCache]: Analyzing trace with hash 84474452, now seen corresponding path program 1 times [2021-03-25 12:49:25,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:25,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91738743] [2021-03-25 12:49:25,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:25,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:25,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:49:25,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:25,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 12:49:25,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:25,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:49:25,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:25,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:25,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:25,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:25,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91738743] [2021-03-25 12:49:25,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:25,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 12:49:25,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713140028] [2021-03-25 12:49:25,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 12:49:25,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:25,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 12:49:25,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 12:49:25,676 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 330 [2021-03-25 12:49:25,677 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 103 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 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) [2021-03-25 12:49:25,677 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:25,677 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 330 [2021-03-25 12:49:25,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:26,637 INFO L129 PetriNetUnfolder]: 8519/11785 cut-off events. [2021-03-25 12:49:26,637 INFO L130 PetriNetUnfolder]: For 17589/18036 co-relation queries the response was YES. [2021-03-25 12:49:26,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32646 conditions, 11785 events. 8519/11785 cut-off events. For 17589/18036 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 60244 event pairs, 2211 based on Foata normal form. 237/9069 useless extension candidates. Maximal degree in co-relation 29618. Up to 5096 conditions per place. [2021-03-25 12:49:26,801 INFO L132 encePairwiseOnDemand]: 322/330 looper letters, 90 selfloop transitions, 17 changer transitions 0/140 dead transitions. [2021-03-25 12:49:26,802 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 140 transitions, 859 flow [2021-03-25 12:49:26,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 12:49:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 12:49:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1533 transitions. [2021-03-25 12:49:26,805 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5806818181818182 [2021-03-25 12:49:26,806 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1533 transitions. [2021-03-25 12:49:26,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1533 transitions. [2021-03-25 12:49:26,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:26,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1533 transitions. [2021-03-25 12:49:26,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 191.625) internal successors, (1533), 8 states have internal predecessors, (1533), 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) [2021-03-25 12:49:26,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 330.0) internal successors, (2970), 9 states have internal predecessors, (2970), 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) [2021-03-25 12:49:26,813 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 330.0) internal successors, (2970), 9 states have internal predecessors, (2970), 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) [2021-03-25 12:49:26,813 INFO L185 Difference]: Start difference. First operand has 70 places, 103 transitions, 500 flow. Second operand 8 states and 1533 transitions. [2021-03-25 12:49:26,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 140 transitions, 859 flow [2021-03-25 12:49:26,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 140 transitions, 859 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 12:49:26,872 INFO L241 Difference]: Finished difference. Result has 79 places, 104 transitions, 554 flow [2021-03-25 12:49:26,872 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=554, PETRI_PLACES=79, PETRI_TRANSITIONS=104} [2021-03-25 12:49:26,872 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 16 predicate places. [2021-03-25 12:49:26,873 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:26,873 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 104 transitions, 554 flow [2021-03-25 12:49:26,873 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 104 transitions, 554 flow [2021-03-25 12:49:26,874 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 104 transitions, 554 flow [2021-03-25 12:49:27,050 INFO L129 PetriNetUnfolder]: 1830/3290 cut-off events. [2021-03-25 12:49:27,050 INFO L130 PetriNetUnfolder]: For 2553/2607 co-relation queries the response was YES. [2021-03-25 12:49:27,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6211 conditions, 3290 events. 1830/3290 cut-off events. For 2553/2607 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 22162 event pairs, 95 based on Foata normal form. 6/2256 useless extension candidates. Maximal degree in co-relation 5174. Up to 704 conditions per place. [2021-03-25 12:49:27,095 INFO L142 LiptonReduction]: Number of co-enabled transitions 1904 [2021-03-25 12:49:27,101 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:49:27,101 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:49:27,101 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 228 [2021-03-25 12:49:27,102 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 104 transitions, 554 flow [2021-03-25 12:49:27,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 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) [2021-03-25 12:49:27,103 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:27,103 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:27,103 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 12:49:27,103 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:27,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1236858740, now seen corresponding path program 2 times [2021-03-25 12:49:27,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:27,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860518884] [2021-03-25 12:49:27,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:27,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:27,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:27,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:27,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 12:49:27,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:27,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:27,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:27,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:49:27,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:27,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:49:27,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:27,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:27,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860518884] [2021-03-25 12:49:27,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:27,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 12:49:27,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813962986] [2021-03-25 12:49:27,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 12:49:27,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:27,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 12:49:27,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 12:49:27,189 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 330 [2021-03-25 12:49:27,190 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 104 transitions, 554 flow. Second operand has 7 states, 7 states have (on average 233.57142857142858) internal successors, (1635), 7 states have internal predecessors, (1635), 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) [2021-03-25 12:49:27,190 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:27,190 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 330 [2021-03-25 12:49:27,190 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:27,918 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_19| (select (select |v_#memory_int_124| v_~v~0.base_42) v_~v~0.offset_42)) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_19|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_124|, ~v~0.base=v_~v~0.base_42} OutVars{~v~0.offset=v_~v~0.offset_42, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_19|, #memory_int=|v_#memory_int_124|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ~v~0.base=v_~v~0.base_42, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start___VERIFIER_assert_#in~expression][50], [224#true, Black: 186#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 260#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 226#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 227#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)), Black: 229#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), 235#true, 44#L1156-1true, 173#(= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1), Black: 197#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 198#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 203#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 248#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 122#L1164-2true, Black: 239#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 210#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 178#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 215#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 219#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 182#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-25 12:49:27,919 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:49:27,919 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:27,919 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:27,919 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:27,961 INFO L129 PetriNetUnfolder]: 5238/7890 cut-off events. [2021-03-25 12:49:27,962 INFO L130 PetriNetUnfolder]: For 18106/18452 co-relation queries the response was YES. [2021-03-25 12:49:28,001 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24351 conditions, 7890 events. 5238/7890 cut-off events. For 18106/18452 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 46301 event pairs, 513 based on Foata normal form. 278/6628 useless extension candidates. Maximal degree in co-relation 20026. Up to 1984 conditions per place. [2021-03-25 12:49:28,040 INFO L132 encePairwiseOnDemand]: 317/330 looper letters, 59 selfloop transitions, 32 changer transitions 8/150 dead transitions. [2021-03-25 12:49:28,041 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 150 transitions, 1026 flow [2021-03-25 12:49:28,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:49:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:49:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2160 transitions. [2021-03-25 12:49:28,058 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2021-03-25 12:49:28,058 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2160 transitions. [2021-03-25 12:49:28,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2160 transitions. [2021-03-25 12:49:28,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:28,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2160 transitions. [2021-03-25 12:49:28,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 240.0) internal successors, (2160), 9 states have internal predecessors, (2160), 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) [2021-03-25 12:49:28,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:49:28,067 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:49:28,067 INFO L185 Difference]: Start difference. First operand has 79 places, 104 transitions, 554 flow. Second operand 9 states and 2160 transitions. [2021-03-25 12:49:28,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 150 transitions, 1026 flow [2021-03-25 12:49:28,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 150 transitions, 991 flow, removed 1 selfloop flow, removed 6 redundant places. [2021-03-25 12:49:28,129 INFO L241 Difference]: Finished difference. Result has 85 places, 115 transitions, 738 flow [2021-03-25 12:49:28,129 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=738, PETRI_PLACES=85, PETRI_TRANSITIONS=115} [2021-03-25 12:49:28,129 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 22 predicate places. [2021-03-25 12:49:28,129 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:28,129 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 115 transitions, 738 flow [2021-03-25 12:49:28,130 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 115 transitions, 738 flow [2021-03-25 12:49:28,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 115 transitions, 738 flow [2021-03-25 12:49:28,376 INFO L129 PetriNetUnfolder]: 2037/3612 cut-off events. [2021-03-25 12:49:28,377 INFO L130 PetriNetUnfolder]: For 6152/6311 co-relation queries the response was YES. [2021-03-25 12:49:28,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8143 conditions, 3612 events. 2037/3612 cut-off events. For 6152/6311 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 24335 event pairs, 79 based on Foata normal form. 36/2509 useless extension candidates. Maximal degree in co-relation 6388. Up to 812 conditions per place. [2021-03-25 12:49:28,404 INFO L142 LiptonReduction]: Number of co-enabled transitions 2092 [2021-03-25 12:49:28,410 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:49:28,410 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:49:28,410 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 281 [2021-03-25 12:49:28,416 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 115 transitions, 738 flow [2021-03-25 12:49:28,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 233.57142857142858) internal successors, (1635), 7 states have internal predecessors, (1635), 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) [2021-03-25 12:49:28,417 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:28,417 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:28,417 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 12:49:28,417 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:28,417 INFO L82 PathProgramCache]: Analyzing trace with hash -625668609, now seen corresponding path program 1 times [2021-03-25 12:49:28,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:28,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225987816] [2021-03-25 12:49:28,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:28,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:28,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:49:28,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:28,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 12:49:28,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:28,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:49:28,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:28,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:28,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:28,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:28,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225987816] [2021-03-25 12:49:28,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:28,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 12:49:28,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411227104] [2021-03-25 12:49:28,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 12:49:28,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:28,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 12:49:28,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 12:49:28,489 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 330 [2021-03-25 12:49:28,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 115 transitions, 738 flow. Second operand has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 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) [2021-03-25 12:49:28,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:28,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 330 [2021-03-25 12:49:28,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:29,279 INFO L129 PetriNetUnfolder]: 7914/11145 cut-off events. [2021-03-25 12:49:29,279 INFO L130 PetriNetUnfolder]: For 36468/37081 co-relation queries the response was YES. [2021-03-25 12:49:29,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36652 conditions, 11145 events. 7914/11145 cut-off events. For 36468/37081 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 58576 event pairs, 1786 based on Foata normal form. 253/8714 useless extension candidates. Maximal degree in co-relation 30942. Up to 5291 conditions per place. [2021-03-25 12:49:29,342 INFO L132 encePairwiseOnDemand]: 322/330 looper letters, 102 selfloop transitions, 17 changer transitions 0/153 dead transitions. [2021-03-25 12:49:29,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 153 transitions, 1183 flow [2021-03-25 12:49:29,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 12:49:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 12:49:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1532 transitions. [2021-03-25 12:49:29,346 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5803030303030303 [2021-03-25 12:49:29,346 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1532 transitions. [2021-03-25 12:49:29,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1532 transitions. [2021-03-25 12:49:29,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:29,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1532 transitions. [2021-03-25 12:49:29,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 191.5) internal successors, (1532), 8 states have internal predecessors, (1532), 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) [2021-03-25 12:49:29,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 330.0) internal successors, (2970), 9 states have internal predecessors, (2970), 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) [2021-03-25 12:49:29,354 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 330.0) internal successors, (2970), 9 states have internal predecessors, (2970), 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) [2021-03-25 12:49:29,354 INFO L185 Difference]: Start difference. First operand has 83 places, 115 transitions, 738 flow. Second operand 8 states and 1532 transitions. [2021-03-25 12:49:29,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 153 transitions, 1183 flow [2021-03-25 12:49:29,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 153 transitions, 1168 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-25 12:49:29,442 INFO L241 Difference]: Finished difference. Result has 90 places, 116 transitions, 779 flow [2021-03-25 12:49:29,442 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=779, PETRI_PLACES=90, PETRI_TRANSITIONS=116} [2021-03-25 12:49:29,442 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 27 predicate places. [2021-03-25 12:49:29,442 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:29,442 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 116 transitions, 779 flow [2021-03-25 12:49:29,443 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 116 transitions, 779 flow [2021-03-25 12:49:29,443 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 116 transitions, 779 flow [2021-03-25 12:49:29,623 INFO L129 PetriNetUnfolder]: 1923/3456 cut-off events. [2021-03-25 12:49:29,623 INFO L130 PetriNetUnfolder]: For 5605/5762 co-relation queries the response was YES. [2021-03-25 12:49:29,634 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7801 conditions, 3456 events. 1923/3456 cut-off events. For 5605/5762 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 23479 event pairs, 79 based on Foata normal form. 43/2410 useless extension candidates. Maximal degree in co-relation 6346. Up to 812 conditions per place. [2021-03-25 12:49:29,659 INFO L142 LiptonReduction]: Number of co-enabled transitions 2082 [2021-03-25 12:49:29,665 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:49:29,665 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:49:29,665 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 223 [2021-03-25 12:49:29,665 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 116 transitions, 779 flow [2021-03-25 12:49:29,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 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) [2021-03-25 12:49:29,666 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:29,666 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:29,666 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 12:49:29,666 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:29,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:29,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1690315253, now seen corresponding path program 2 times [2021-03-25 12:49:29,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:29,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307174605] [2021-03-25 12:49:29,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:29,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:29,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:49:29,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:29,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:49:29,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:29,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:49:29,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:29,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:49:29,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:29,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:49:29,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:29,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:49:29,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:29,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:29,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:29,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:29,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307174605] [2021-03-25 12:49:29,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:29,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 12:49:29,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030426134] [2021-03-25 12:49:29,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 12:49:29,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:29,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 12:49:29,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 12:49:29,753 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 330 [2021-03-25 12:49:29,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 116 transitions, 779 flow. Second operand has 9 states, 9 states have (on average 181.33333333333334) internal successors, (1632), 9 states have internal predecessors, (1632), 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) [2021-03-25 12:49:29,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:29,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 330 [2021-03-25 12:49:29,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:31,024 INFO L129 PetriNetUnfolder]: 11288/15578 cut-off events. [2021-03-25 12:49:31,024 INFO L130 PetriNetUnfolder]: For 54194/54808 co-relation queries the response was YES. [2021-03-25 12:49:31,073 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52381 conditions, 15578 events. 11288/15578 cut-off events. For 54194/54808 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 82041 event pairs, 2458 based on Foata normal form. 93/11767 useless extension candidates. Maximal degree in co-relation 47918. Up to 5665 conditions per place. [2021-03-25 12:49:31,230 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 130 selfloop transitions, 31 changer transitions 13/208 dead transitions. [2021-03-25 12:49:31,230 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 208 transitions, 1711 flow [2021-03-25 12:49:31,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:49:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:49:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1739 transitions. [2021-03-25 12:49:31,235 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5855218855218856 [2021-03-25 12:49:31,235 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1739 transitions. [2021-03-25 12:49:31,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1739 transitions. [2021-03-25 12:49:31,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:31,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1739 transitions. [2021-03-25 12:49:31,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 193.22222222222223) internal successors, (1739), 9 states have internal predecessors, (1739), 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) [2021-03-25 12:49:31,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:49:31,258 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:49:31,258 INFO L185 Difference]: Start difference. First operand has 90 places, 116 transitions, 779 flow. Second operand 9 states and 1739 transitions. [2021-03-25 12:49:31,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 208 transitions, 1711 flow [2021-03-25 12:49:31,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 208 transitions, 1680 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-03-25 12:49:31,342 INFO L241 Difference]: Finished difference. Result has 97 places, 122 transitions, 949 flow [2021-03-25 12:49:31,342 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=949, PETRI_PLACES=97, PETRI_TRANSITIONS=122} [2021-03-25 12:49:31,342 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 34 predicate places. [2021-03-25 12:49:31,342 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:31,342 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 122 transitions, 949 flow [2021-03-25 12:49:31,342 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 122 transitions, 949 flow [2021-03-25 12:49:31,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 97 places, 122 transitions, 949 flow [2021-03-25 12:49:31,646 INFO L129 PetriNetUnfolder]: 2706/4836 cut-off events. [2021-03-25 12:49:31,646 INFO L130 PetriNetUnfolder]: For 11949/12040 co-relation queries the response was YES. [2021-03-25 12:49:31,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12113 conditions, 4836 events. 2706/4836 cut-off events. For 11949/12040 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 34267 event pairs, 46 based on Foata normal form. 12/3394 useless extension candidates. Maximal degree in co-relation 10424. Up to 1054 conditions per place. [2021-03-25 12:49:31,692 INFO L142 LiptonReduction]: Number of co-enabled transitions 2110 [2021-03-25 12:49:31,698 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:49:31,698 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:49:31,698 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 356 [2021-03-25 12:49:31,698 INFO L480 AbstractCegarLoop]: Abstraction has has 97 places, 122 transitions, 949 flow [2021-03-25 12:49:31,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 181.33333333333334) internal successors, (1632), 9 states have internal predecessors, (1632), 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) [2021-03-25 12:49:31,699 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:31,699 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:31,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 12:49:31,699 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:31,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:31,699 INFO L82 PathProgramCache]: Analyzing trace with hash -997086584, now seen corresponding path program 1 times [2021-03-25 12:49:31,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:31,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263589383] [2021-03-25 12:49:31,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:31,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:31,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:49:31,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:31,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:49:31,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:31,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:49:31,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:31,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:49:31,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:31,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:49:31,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:31,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:49:31,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:31,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:31,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:31,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:31,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:31,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263589383] [2021-03-25 12:49:31,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:31,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 12:49:31,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930657636] [2021-03-25 12:49:31,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 12:49:31,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:31,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 12:49:31,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 12:49:31,793 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 330 [2021-03-25 12:49:31,794 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 122 transitions, 949 flow. Second operand has 9 states, 9 states have (on average 181.33333333333334) internal successors, (1632), 9 states have internal predecessors, (1632), 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) [2021-03-25 12:49:31,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:31,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 330 [2021-03-25 12:49:31,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:33,145 INFO L129 PetriNetUnfolder]: 10125/14110 cut-off events. [2021-03-25 12:49:33,145 INFO L130 PetriNetUnfolder]: For 63198/63841 co-relation queries the response was YES. [2021-03-25 12:49:33,189 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51726 conditions, 14110 events. 10125/14110 cut-off events. For 63198/63841 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 75718 event pairs, 2519 based on Foata normal form. 99/10697 useless extension candidates. Maximal degree in co-relation 47910. Up to 9983 conditions per place. [2021-03-25 12:49:33,218 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 105 selfloop transitions, 20 changer transitions 0/159 dead transitions. [2021-03-25 12:49:33,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 159 transitions, 1448 flow [2021-03-25 12:49:33,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:49:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:49:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1341 transitions. [2021-03-25 12:49:33,222 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5805194805194805 [2021-03-25 12:49:33,222 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1341 transitions. [2021-03-25 12:49:33,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1341 transitions. [2021-03-25 12:49:33,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:33,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1341 transitions. [2021-03-25 12:49:33,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 191.57142857142858) internal successors, (1341), 7 states have internal predecessors, (1341), 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) [2021-03-25 12:49:33,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 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) [2021-03-25 12:49:33,228 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 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) [2021-03-25 12:49:33,228 INFO L185 Difference]: Start difference. First operand has 97 places, 122 transitions, 949 flow. Second operand 7 states and 1341 transitions. [2021-03-25 12:49:33,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 159 transitions, 1448 flow [2021-03-25 12:49:33,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 159 transitions, 1305 flow, removed 38 selfloop flow, removed 7 redundant places. [2021-03-25 12:49:33,340 INFO L241 Difference]: Finished difference. Result has 99 places, 127 transitions, 954 flow [2021-03-25 12:49:33,340 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=954, PETRI_PLACES=99, PETRI_TRANSITIONS=127} [2021-03-25 12:49:33,340 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 36 predicate places. [2021-03-25 12:49:33,340 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:33,340 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 127 transitions, 954 flow [2021-03-25 12:49:33,341 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 127 transitions, 954 flow [2021-03-25 12:49:33,341 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 127 transitions, 954 flow [2021-03-25 12:49:33,644 INFO L129 PetriNetUnfolder]: 2644/4740 cut-off events. [2021-03-25 12:49:33,644 INFO L130 PetriNetUnfolder]: For 7995/8067 co-relation queries the response was YES. [2021-03-25 12:49:33,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10551 conditions, 4740 events. 2644/4740 cut-off events. For 7995/8067 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 33668 event pairs, 68 based on Foata normal form. 21/3304 useless extension candidates. Maximal degree in co-relation 10306. Up to 1070 conditions per place. [2021-03-25 12:49:33,708 INFO L142 LiptonReduction]: Number of co-enabled transitions 2108 [2021-03-25 12:49:33,713 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:49:33,713 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:49:33,714 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 374 [2021-03-25 12:49:33,714 INFO L480 AbstractCegarLoop]: Abstraction has has 99 places, 127 transitions, 954 flow [2021-03-25 12:49:33,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 181.33333333333334) internal successors, (1632), 9 states have internal predecessors, (1632), 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) [2021-03-25 12:49:33,715 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:33,715 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:33,715 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 12:49:33,715 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:33,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:33,715 INFO L82 PathProgramCache]: Analyzing trace with hash -952393357, now seen corresponding path program 3 times [2021-03-25 12:49:33,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:33,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364545614] [2021-03-25 12:49:33,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:33,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:33,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:49:33,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:33,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 12:49:33,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:33,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:49:33,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:33,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:49:33,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:33,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:49:33,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:33,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:49:33,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:33,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:49:33,890 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-03-25 12:49:33,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:49:33,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:33,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:33,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:33,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:33,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364545614] [2021-03-25 12:49:33,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:33,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 12:49:33,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227447491] [2021-03-25 12:49:33,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 12:49:33,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:33,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 12:49:33,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-03-25 12:49:33,914 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 330 [2021-03-25 12:49:33,915 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 127 transitions, 954 flow. Second operand has 11 states, 11 states have (on average 179.0909090909091) internal successors, (1970), 11 states have internal predecessors, (1970), 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) [2021-03-25 12:49:33,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:33,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 330 [2021-03-25 12:49:33,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:35,658 INFO L129 PetriNetUnfolder]: 11262/15600 cut-off events. [2021-03-25 12:49:35,658 INFO L130 PetriNetUnfolder]: For 55941/56541 co-relation queries the response was YES. [2021-03-25 12:49:35,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53347 conditions, 15600 events. 11262/15600 cut-off events. For 55941/56541 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 83971 event pairs, 2154 based on Foata normal form. 89/11746 useless extension candidates. Maximal degree in co-relation 51668. Up to 10024 conditions per place. [2021-03-25 12:49:35,734 INFO L132 encePairwiseOnDemand]: 319/330 looper letters, 120 selfloop transitions, 44 changer transitions 0/198 dead transitions. [2021-03-25 12:49:35,734 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 198 transitions, 1822 flow [2021-03-25 12:49:35,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 12:49:35,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 12:49:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2069 transitions. [2021-03-25 12:49:35,739 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5699724517906336 [2021-03-25 12:49:35,739 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2069 transitions. [2021-03-25 12:49:35,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2069 transitions. [2021-03-25 12:49:35,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:35,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2069 transitions. [2021-03-25 12:49:35,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 188.0909090909091) internal successors, (2069), 11 states have internal predecessors, (2069), 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) [2021-03-25 12:49:35,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 330.0) internal successors, (3960), 12 states have internal predecessors, (3960), 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) [2021-03-25 12:49:35,749 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 330.0) internal successors, (3960), 12 states have internal predecessors, (3960), 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) [2021-03-25 12:49:35,749 INFO L185 Difference]: Start difference. First operand has 99 places, 127 transitions, 954 flow. Second operand 11 states and 2069 transitions. [2021-03-25 12:49:35,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 198 transitions, 1822 flow [2021-03-25 12:49:35,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 198 transitions, 1776 flow, removed 15 selfloop flow, removed 2 redundant places. [2021-03-25 12:49:35,791 INFO L241 Difference]: Finished difference. Result has 112 places, 146 transitions, 1262 flow [2021-03-25 12:49:35,791 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1262, PETRI_PLACES=112, PETRI_TRANSITIONS=146} [2021-03-25 12:49:35,791 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 49 predicate places. [2021-03-25 12:49:35,791 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:35,791 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 146 transitions, 1262 flow [2021-03-25 12:49:35,792 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 146 transitions, 1262 flow [2021-03-25 12:49:35,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 146 transitions, 1262 flow [2021-03-25 12:49:36,139 INFO L129 PetriNetUnfolder]: 2809/4982 cut-off events. [2021-03-25 12:49:36,139 INFO L130 PetriNetUnfolder]: For 9464/9605 co-relation queries the response was YES. [2021-03-25 12:49:36,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11640 conditions, 4982 events. 2809/4982 cut-off events. For 9464/9605 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 35487 event pairs, 74 based on Foata normal form. 14/3390 useless extension candidates. Maximal degree in co-relation 10931. Up to 1122 conditions per place. [2021-03-25 12:49:36,196 INFO L142 LiptonReduction]: Number of co-enabled transitions 2238 [2021-03-25 12:49:36,202 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:49:36,202 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:49:36,202 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 411 [2021-03-25 12:49:36,203 INFO L480 AbstractCegarLoop]: Abstraction has has 112 places, 146 transitions, 1262 flow [2021-03-25 12:49:36,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 179.0909090909091) internal successors, (1970), 11 states have internal predecessors, (1970), 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) [2021-03-25 12:49:36,203 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:36,204 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:36,204 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 12:49:36,204 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:36,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:36,204 INFO L82 PathProgramCache]: Analyzing trace with hash -134167346, now seen corresponding path program 1 times [2021-03-25 12:49:36,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:36,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356423638] [2021-03-25 12:49:36,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:36,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:36,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:36,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:36,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 12:49:36,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:36,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:36,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:36,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:49:36,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:36,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:49:36,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:36,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:36,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356423638] [2021-03-25 12:49:36,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:36,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 12:49:36,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023718173] [2021-03-25 12:49:36,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 12:49:36,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:36,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 12:49:36,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 12:49:36,257 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 330 [2021-03-25 12:49:36,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 146 transitions, 1262 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 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) [2021-03-25 12:49:36,258 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:36,258 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 330 [2021-03-25 12:49:36,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:37,261 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_19| (select (select |v_#memory_int_124| v_~v~0.base_42) v_~v~0.offset_42)) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_19|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_124|, ~v~0.base=v_~v~0.base_42} OutVars{~v~0.offset=v_~v~0.offset_42, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_19|, #memory_int=|v_#memory_int_124|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ~v~0.base=v_~v~0.base_42, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start___VERIFIER_assert_#in~expression][59], [Black: 186#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 264#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), Black: 324#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 326#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 328#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 198#(= |ULTIMATE.start_main_#t~mem18| 5), 335#true, Black: 203#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 262#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 210#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 215#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 219#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 278#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 287#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 291#true, Black: 224#true, Black: 226#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 353#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 227#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)), Black: 355#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 339#(and (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|))), Black: 359#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), 44#L1156-1true, 173#(= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1), Black: 345#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 305#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 307#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 309#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 298#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 248#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 122#L1164-2true, 378#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 303#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 239#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 178#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 182#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-25 12:49:37,261 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 12:49:37,261 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:37,262 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:37,262 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 12:49:37,273 INFO L129 PetriNetUnfolder]: 6899/10530 cut-off events. [2021-03-25 12:49:37,273 INFO L130 PetriNetUnfolder]: For 48997/49542 co-relation queries the response was YES. [2021-03-25 12:49:37,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38705 conditions, 10530 events. 6899/10530 cut-off events. For 48997/49542 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 65229 event pairs, 320 based on Foata normal form. 325/8630 useless extension candidates. Maximal degree in co-relation 35791. Up to 2741 conditions per place. [2021-03-25 12:49:37,355 INFO L132 encePairwiseOnDemand]: 317/330 looper letters, 90 selfloop transitions, 46 changer transitions 2/195 dead transitions. [2021-03-25 12:49:37,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 195 transitions, 1935 flow [2021-03-25 12:49:37,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:49:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:49:37,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1684 transitions. [2021-03-25 12:49:37,359 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.729004329004329 [2021-03-25 12:49:37,359 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1684 transitions. [2021-03-25 12:49:37,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1684 transitions. [2021-03-25 12:49:37,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:37,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1684 transitions. [2021-03-25 12:49:37,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 240.57142857142858) internal successors, (1684), 7 states have internal predecessors, (1684), 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) [2021-03-25 12:49:37,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 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) [2021-03-25 12:49:37,366 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 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) [2021-03-25 12:49:37,366 INFO L185 Difference]: Start difference. First operand has 112 places, 146 transitions, 1262 flow. Second operand 7 states and 1684 transitions. [2021-03-25 12:49:37,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 195 transitions, 1935 flow [2021-03-25 12:49:37,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 195 transitions, 1897 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-03-25 12:49:37,451 INFO L241 Difference]: Finished difference. Result has 118 places, 162 transitions, 1601 flow [2021-03-25 12:49:37,451 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1228, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1601, PETRI_PLACES=118, PETRI_TRANSITIONS=162} [2021-03-25 12:49:37,451 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 55 predicate places. [2021-03-25 12:49:37,451 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:37,451 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 162 transitions, 1601 flow [2021-03-25 12:49:37,452 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 162 transitions, 1601 flow [2021-03-25 12:49:37,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 118 places, 162 transitions, 1601 flow [2021-03-25 12:49:37,755 INFO L129 PetriNetUnfolder]: 2900/5188 cut-off events. [2021-03-25 12:49:37,755 INFO L130 PetriNetUnfolder]: For 15788/16017 co-relation queries the response was YES. [2021-03-25 12:49:37,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14128 conditions, 5188 events. 2900/5188 cut-off events. For 15788/16017 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 37223 event pairs, 37 based on Foata normal form. 79/3665 useless extension candidates. Maximal degree in co-relation 13826. Up to 1148 conditions per place. [2021-03-25 12:49:37,824 INFO L142 LiptonReduction]: Number of co-enabled transitions 2484 [2021-03-25 12:49:37,832 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:49:37,832 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:49:37,832 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 381 [2021-03-25 12:49:37,833 INFO L480 AbstractCegarLoop]: Abstraction has has 118 places, 162 transitions, 1601 flow [2021-03-25 12:49:37,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 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) [2021-03-25 12:49:37,833 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:37,833 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:37,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 12:49:37,834 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:37,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:37,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1459150374, now seen corresponding path program 1 times [2021-03-25 12:49:37,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:37,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782559639] [2021-03-25 12:49:37,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:37,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:37,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:49:37,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:37,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:49:37,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:37,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:49:37,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:37,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:49:37,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:37,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:49:37,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:37,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:49:37,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:37,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:37,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:37,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:37,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782559639] [2021-03-25 12:49:37,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:37,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 12:49:37,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468105400] [2021-03-25 12:49:37,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 12:49:37,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:37,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 12:49:37,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-25 12:49:37,956 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 330 [2021-03-25 12:49:37,957 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 162 transitions, 1601 flow. Second operand has 9 states, 9 states have (on average 181.44444444444446) internal successors, (1633), 9 states have internal predecessors, (1633), 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) [2021-03-25 12:49:37,957 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:37,957 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 330 [2021-03-25 12:49:37,957 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:39,681 INFO L129 PetriNetUnfolder]: 12322/17346 cut-off events. [2021-03-25 12:49:39,682 INFO L130 PetriNetUnfolder]: For 109182/109812 co-relation queries the response was YES. [2021-03-25 12:49:39,764 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67627 conditions, 17346 events. 12322/17346 cut-off events. For 109182/109812 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 97541 event pairs, 2705 based on Foata normal form. 203/13181 useless extension candidates. Maximal degree in co-relation 64177. Up to 11269 conditions per place. [2021-03-25 12:49:39,800 INFO L132 encePairwiseOnDemand]: 318/330 looper letters, 127 selfloop transitions, 32 changer transitions 9/206 dead transitions. [2021-03-25 12:49:39,800 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 206 transitions, 2348 flow [2021-03-25 12:49:39,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:49:39,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:49:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1700 transitions. [2021-03-25 12:49:39,803 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5723905723905723 [2021-03-25 12:49:39,803 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1700 transitions. [2021-03-25 12:49:39,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1700 transitions. [2021-03-25 12:49:39,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:39,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1700 transitions. [2021-03-25 12:49:39,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 188.88888888888889) internal successors, (1700), 9 states have internal predecessors, (1700), 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) [2021-03-25 12:49:39,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:49:39,811 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:49:39,811 INFO L185 Difference]: Start difference. First operand has 118 places, 162 transitions, 1601 flow. Second operand 9 states and 1700 transitions. [2021-03-25 12:49:39,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 206 transitions, 2348 flow [2021-03-25 12:49:39,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 206 transitions, 2326 flow, removed 7 selfloop flow, removed 2 redundant places. [2021-03-25 12:49:39,970 INFO L241 Difference]: Finished difference. Result has 126 places, 159 transitions, 1670 flow [2021-03-25 12:49:39,971 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1530, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1670, PETRI_PLACES=126, PETRI_TRANSITIONS=159} [2021-03-25 12:49:39,971 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 63 predicate places. [2021-03-25 12:49:39,971 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:39,971 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 159 transitions, 1670 flow [2021-03-25 12:49:39,971 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 159 transitions, 1670 flow [2021-03-25 12:49:39,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 159 transitions, 1670 flow [2021-03-25 12:49:40,428 INFO L129 PetriNetUnfolder]: 3115/5642 cut-off events. [2021-03-25 12:49:40,429 INFO L130 PetriNetUnfolder]: For 17567/17812 co-relation queries the response was YES. [2021-03-25 12:49:40,457 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15244 conditions, 5642 events. 3115/5642 cut-off events. For 17567/17812 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 41740 event pairs, 30 based on Foata normal form. 96/4034 useless extension candidates. Maximal degree in co-relation 14680. Up to 1256 conditions per place. [2021-03-25 12:49:40,501 INFO L142 LiptonReduction]: Number of co-enabled transitions 2596 [2021-03-25 12:49:40,507 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:49:40,507 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:49:40,507 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 536 [2021-03-25 12:49:40,508 INFO L480 AbstractCegarLoop]: Abstraction has has 126 places, 159 transitions, 1670 flow [2021-03-25 12:49:40,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 181.44444444444446) internal successors, (1633), 9 states have internal predecessors, (1633), 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) [2021-03-25 12:49:40,508 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:40,508 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:40,508 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 12:49:40,508 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:40,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:40,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1550777458, now seen corresponding path program 2 times [2021-03-25 12:49:40,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:40,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017298524] [2021-03-25 12:49:40,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:40,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:40,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:49:40,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:40,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:49:40,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:40,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:49:40,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:40,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:49:40,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:40,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:49:40,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:40,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:40,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:40,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:40,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017298524] [2021-03-25 12:49:40,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:40,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 12:49:40,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529066005] [2021-03-25 12:49:40,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 12:49:40,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:40,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 12:49:40,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 12:49:40,592 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 330 [2021-03-25 12:49:40,593 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 159 transitions, 1670 flow. Second operand has 8 states, 8 states have (on average 182.625) internal successors, (1461), 8 states have internal predecessors, (1461), 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) [2021-03-25 12:49:40,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:40,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 330 [2021-03-25 12:49:40,594 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:42,452 INFO L129 PetriNetUnfolder]: 13430/18888 cut-off events. [2021-03-25 12:49:42,452 INFO L130 PetriNetUnfolder]: For 125170/125839 co-relation queries the response was YES. [2021-03-25 12:49:42,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74666 conditions, 18888 events. 13430/18888 cut-off events. For 125170/125839 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 107263 event pairs, 2686 based on Foata normal form. 115/14129 useless extension candidates. Maximal degree in co-relation 71164. Up to 8725 conditions per place. [2021-03-25 12:49:42,576 INFO L132 encePairwiseOnDemand]: 321/330 looper letters, 184 selfloop transitions, 27 changer transitions 0/249 dead transitions. [2021-03-25 12:49:42,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 249 transitions, 2878 flow [2021-03-25 12:49:42,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:49:42,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:49:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1738 transitions. [2021-03-25 12:49:42,579 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5851851851851851 [2021-03-25 12:49:42,579 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1738 transitions. [2021-03-25 12:49:42,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1738 transitions. [2021-03-25 12:49:42,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:42,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1738 transitions. [2021-03-25 12:49:42,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 193.11111111111111) internal successors, (1738), 9 states have internal predecessors, (1738), 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) [2021-03-25 12:49:42,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:49:42,586 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:49:42,586 INFO L185 Difference]: Start difference. First operand has 126 places, 159 transitions, 1670 flow. Second operand 9 states and 1738 transitions. [2021-03-25 12:49:42,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 249 transitions, 2878 flow [2021-03-25 12:49:42,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 249 transitions, 2796 flow, removed 13 selfloop flow, removed 6 redundant places. [2021-03-25 12:49:42,688 INFO L241 Difference]: Finished difference. Result has 130 places, 165 transitions, 1761 flow [2021-03-25 12:49:42,689 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1602, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1761, PETRI_PLACES=130, PETRI_TRANSITIONS=165} [2021-03-25 12:49:42,689 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 67 predicate places. [2021-03-25 12:49:42,689 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:42,689 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 165 transitions, 1761 flow [2021-03-25 12:49:42,689 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 165 transitions, 1761 flow [2021-03-25 12:49:42,690 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 165 transitions, 1761 flow [2021-03-25 12:49:43,039 INFO L129 PetriNetUnfolder]: 3396/6066 cut-off events. [2021-03-25 12:49:43,039 INFO L130 PetriNetUnfolder]: For 19770/20129 co-relation queries the response was YES. [2021-03-25 12:49:43,199 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16595 conditions, 6066 events. 3396/6066 cut-off events. For 19770/20129 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 44613 event pairs, 63 based on Foata normal form. 88/4233 useless extension candidates. Maximal degree in co-relation 16097. Up to 1378 conditions per place. [2021-03-25 12:49:43,234 INFO L142 LiptonReduction]: Number of co-enabled transitions 2716 [2021-03-25 12:49:43,240 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:49:43,240 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:49:43,240 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 551 [2021-03-25 12:49:43,240 INFO L480 AbstractCegarLoop]: Abstraction has has 130 places, 165 transitions, 1761 flow [2021-03-25 12:49:43,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 182.625) internal successors, (1461), 8 states have internal predecessors, (1461), 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) [2021-03-25 12:49:43,241 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:43,241 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:43,241 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 12:49:43,241 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:43,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:43,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1503408134, now seen corresponding path program 1 times [2021-03-25 12:49:43,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:43,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831988533] [2021-03-25 12:49:43,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:43,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:43,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:49:43,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:43,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:49:43,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:43,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:49:43,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:43,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:49:43,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:43,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:49:43,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:43,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:43,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:43,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:43,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831988533] [2021-03-25 12:49:43,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:43,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 12:49:43,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602000135] [2021-03-25 12:49:43,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 12:49:43,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:43,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 12:49:43,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 12:49:43,301 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 330 [2021-03-25 12:49:43,302 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 165 transitions, 1761 flow. Second operand has 8 states, 8 states have (on average 182.625) internal successors, (1461), 8 states have internal predecessors, (1461), 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) [2021-03-25 12:49:43,302 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:43,302 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 330 [2021-03-25 12:49:43,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:44,985 INFO L129 PetriNetUnfolder]: 12866/18286 cut-off events. [2021-03-25 12:49:44,985 INFO L130 PetriNetUnfolder]: For 122688/123431 co-relation queries the response was YES. [2021-03-25 12:49:45,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 72430 conditions, 18286 events. 12866/18286 cut-off events. For 122688/123431 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 105979 event pairs, 2679 based on Foata normal form. 142/13780 useless extension candidates. Maximal degree in co-relation 70913. Up to 13029 conditions per place. [2021-03-25 12:49:45,108 INFO L132 encePairwiseOnDemand]: 321/330 looper letters, 154 selfloop transitions, 15 changer transitions 0/207 dead transitions. [2021-03-25 12:49:45,108 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 207 transitions, 2464 flow [2021-03-25 12:49:45,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:49:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:49:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1342 transitions. [2021-03-25 12:49:45,110 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2021-03-25 12:49:45,110 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1342 transitions. [2021-03-25 12:49:45,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1342 transitions. [2021-03-25 12:49:45,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:45,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1342 transitions. [2021-03-25 12:49:45,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 191.71428571428572) internal successors, (1342), 7 states have internal predecessors, (1342), 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) [2021-03-25 12:49:45,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 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) [2021-03-25 12:49:45,115 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 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) [2021-03-25 12:49:45,115 INFO L185 Difference]: Start difference. First operand has 130 places, 165 transitions, 1761 flow. Second operand 7 states and 1342 transitions. [2021-03-25 12:49:45,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 207 transitions, 2464 flow [2021-03-25 12:49:45,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 207 transitions, 2356 flow, removed 16 selfloop flow, removed 5 redundant places. [2021-03-25 12:49:45,250 INFO L241 Difference]: Finished difference. Result has 133 places, 165 transitions, 1713 flow [2021-03-25 12:49:45,250 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1652, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1713, PETRI_PLACES=133, PETRI_TRANSITIONS=165} [2021-03-25 12:49:45,250 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 70 predicate places. [2021-03-25 12:49:45,250 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:45,250 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 165 transitions, 1713 flow [2021-03-25 12:49:45,251 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 165 transitions, 1713 flow [2021-03-25 12:49:45,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 133 places, 165 transitions, 1713 flow [2021-03-25 12:49:45,840 INFO L129 PetriNetUnfolder]: 3388/6112 cut-off events. [2021-03-25 12:49:45,840 INFO L130 PetriNetUnfolder]: For 16650/16943 co-relation queries the response was YES. [2021-03-25 12:49:45,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16187 conditions, 6112 events. 3388/6112 cut-off events. For 16650/16943 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 45867 event pairs, 56 based on Foata normal form. 36/4249 useless extension candidates. Maximal degree in co-relation 15992. Up to 1370 conditions per place. [2021-03-25 12:49:45,907 INFO L142 LiptonReduction]: Number of co-enabled transitions 2702 [2021-03-25 12:49:45,912 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:49:45,912 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:49:45,912 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 662 [2021-03-25 12:49:45,915 INFO L480 AbstractCegarLoop]: Abstraction has has 133 places, 165 transitions, 1713 flow [2021-03-25 12:49:45,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 182.625) internal successors, (1461), 8 states have internal predecessors, (1461), 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) [2021-03-25 12:49:45,916 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:45,916 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:45,916 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 12:49:45,916 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:45,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:45,917 INFO L82 PathProgramCache]: Analyzing trace with hash -998949896, now seen corresponding path program 3 times [2021-03-25 12:49:45,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:45,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146711242] [2021-03-25 12:49:45,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:45,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:45,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:49:45,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:45,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 12:49:45,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:45,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:49:46,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:46,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:49:46,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:46,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:49:46,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:46,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:49:46,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:46,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:49:46,098 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-03-25 12:49:46,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:49:46,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:46,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:46,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:46,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:46,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146711242] [2021-03-25 12:49:46,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:46,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 12:49:46,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708794887] [2021-03-25 12:49:46,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 12:49:46,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:46,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 12:49:46,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-25 12:49:46,117 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 330 [2021-03-25 12:49:46,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 165 transitions, 1713 flow. Second operand has 11 states, 11 states have (on average 179.1818181818182) internal successors, (1971), 11 states have internal predecessors, (1971), 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) [2021-03-25 12:49:46,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:46,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 330 [2021-03-25 12:49:46,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:48,213 INFO L129 PetriNetUnfolder]: 13671/19241 cut-off events. [2021-03-25 12:49:48,213 INFO L130 PetriNetUnfolder]: For 115349/115924 co-relation queries the response was YES. [2021-03-25 12:49:48,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75104 conditions, 19241 events. 13671/19241 cut-off events. For 115349/115924 co-relation queries the response was YES. Maximal size of possible extension queue 919. Compared 110351 event pairs, 2780 based on Foata normal form. 171/14548 useless extension candidates. Maximal degree in co-relation 74436. Up to 9926 conditions per place. [2021-03-25 12:49:48,330 INFO L132 encePairwiseOnDemand]: 318/330 looper letters, 125 selfloop transitions, 56 changer transitions 0/219 dead transitions. [2021-03-25 12:49:48,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 219 transitions, 2591 flow [2021-03-25 12:49:48,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 12:49:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 12:49:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1875 transitions. [2021-03-25 12:49:48,332 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2021-03-25 12:49:48,332 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1875 transitions. [2021-03-25 12:49:48,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1875 transitions. [2021-03-25 12:49:48,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:48,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1875 transitions. [2021-03-25 12:49:48,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 187.5) internal successors, (1875), 10 states have internal predecessors, (1875), 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) [2021-03-25 12:49:48,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 330.0) internal successors, (3630), 11 states have internal predecessors, (3630), 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) [2021-03-25 12:49:48,337 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 330.0) internal successors, (3630), 11 states have internal predecessors, (3630), 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) [2021-03-25 12:49:48,337 INFO L185 Difference]: Start difference. First operand has 133 places, 165 transitions, 1713 flow. Second operand 10 states and 1875 transitions. [2021-03-25 12:49:48,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 219 transitions, 2591 flow [2021-03-25 12:49:48,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 219 transitions, 2482 flow, removed 13 selfloop flow, removed 6 redundant places. [2021-03-25 12:49:48,511 INFO L241 Difference]: Finished difference. Result has 139 places, 175 transitions, 1938 flow [2021-03-25 12:49:48,511 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1938, PETRI_PLACES=139, PETRI_TRANSITIONS=175} [2021-03-25 12:49:48,511 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 76 predicate places. [2021-03-25 12:49:48,511 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:48,511 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 175 transitions, 1938 flow [2021-03-25 12:49:48,511 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 175 transitions, 1938 flow [2021-03-25 12:49:48,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 139 places, 175 transitions, 1938 flow [2021-03-25 12:49:49,079 INFO L129 PetriNetUnfolder]: 3607/6582 cut-off events. [2021-03-25 12:49:49,079 INFO L130 PetriNetUnfolder]: For 17079/17273 co-relation queries the response was YES. [2021-03-25 12:49:49,119 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16812 conditions, 6582 events. 3607/6582 cut-off events. For 17079/17273 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 50406 event pairs, 35 based on Foata normal form. 46/4644 useless extension candidates. Maximal degree in co-relation 16614. Up to 1474 conditions per place. [2021-03-25 12:49:49,178 INFO L142 LiptonReduction]: Number of co-enabled transitions 2776 [2021-03-25 12:49:49,184 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:49:49,184 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:49:49,184 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 673 [2021-03-25 12:49:49,185 INFO L480 AbstractCegarLoop]: Abstraction has has 139 places, 175 transitions, 1938 flow [2021-03-25 12:49:49,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 179.1818181818182) internal successors, (1971), 11 states have internal predecessors, (1971), 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) [2021-03-25 12:49:49,185 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:49,185 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:49,185 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 12:49:49,186 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:49,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:49,186 INFO L82 PathProgramCache]: Analyzing trace with hash 57606416, now seen corresponding path program 1 times [2021-03-25 12:49:49,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:49,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684070518] [2021-03-25 12:49:49,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:49,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:49,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 12:49:49,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:49,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:49:49,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:49,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 12:49:49,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:49,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:49:49,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:49,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:49:49,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:49,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:49:49,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:49,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:49:49,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:49,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:49:49,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:49,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:49,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:49,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:49,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684070518] [2021-03-25 12:49:49,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:49,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 12:49:49,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354473957] [2021-03-25 12:49:49,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 12:49:49,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:49,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 12:49:49,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-25 12:49:49,307 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 330 [2021-03-25 12:49:49,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 175 transitions, 1938 flow. Second operand has 10 states, 10 states have (on average 178.3) internal successors, (1783), 10 states have internal predecessors, (1783), 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) [2021-03-25 12:49:49,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:49,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 330 [2021-03-25 12:49:49,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:51,353 INFO L129 PetriNetUnfolder]: 14664/20437 cut-off events. [2021-03-25 12:49:51,353 INFO L130 PetriNetUnfolder]: For 117417/117972 co-relation queries the response was YES. [2021-03-25 12:49:51,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79974 conditions, 20437 events. 14664/20437 cut-off events. For 117417/117972 co-relation queries the response was YES. Maximal size of possible extension queue 961. Compared 115579 event pairs, 3018 based on Foata normal form. 68/15332 useless extension candidates. Maximal degree in co-relation 79183. Up to 7717 conditions per place. [2021-03-25 12:49:51,492 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 167 selfloop transitions, 65 changer transitions 0/267 dead transitions. [2021-03-25 12:49:51,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 267 transitions, 3175 flow [2021-03-25 12:49:51,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 12:49:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 12:49:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2065 transitions. [2021-03-25 12:49:51,494 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.568870523415978 [2021-03-25 12:49:51,494 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2065 transitions. [2021-03-25 12:49:51,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2065 transitions. [2021-03-25 12:49:51,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:51,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2065 transitions. [2021-03-25 12:49:51,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 187.72727272727272) internal successors, (2065), 11 states have internal predecessors, (2065), 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) [2021-03-25 12:49:51,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 330.0) internal successors, (3960), 12 states have internal predecessors, (3960), 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) [2021-03-25 12:49:51,499 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 330.0) internal successors, (3960), 12 states have internal predecessors, (3960), 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) [2021-03-25 12:49:51,499 INFO L185 Difference]: Start difference. First operand has 139 places, 175 transitions, 1938 flow. Second operand 11 states and 2065 transitions. [2021-03-25 12:49:51,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 267 transitions, 3175 flow [2021-03-25 12:49:51,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 267 transitions, 3155 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-25 12:49:51,582 INFO L241 Difference]: Finished difference. Result has 149 places, 187 transitions, 2292 flow [2021-03-25 12:49:51,582 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2292, PETRI_PLACES=149, PETRI_TRANSITIONS=187} [2021-03-25 12:49:51,582 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 86 predicate places. [2021-03-25 12:49:51,582 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:51,582 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 187 transitions, 2292 flow [2021-03-25 12:49:51,582 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 187 transitions, 2292 flow [2021-03-25 12:49:51,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 149 places, 187 transitions, 2292 flow [2021-03-25 12:49:52,153 INFO L129 PetriNetUnfolder]: 3711/6647 cut-off events. [2021-03-25 12:49:52,153 INFO L130 PetriNetUnfolder]: For 20225/20525 co-relation queries the response was YES. [2021-03-25 12:49:52,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17979 conditions, 6647 events. 3711/6647 cut-off events. For 20225/20525 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 50034 event pairs, 89 based on Foata normal form. 48/4572 useless extension candidates. Maximal degree in co-relation 17749. Up to 1514 conditions per place. [2021-03-25 12:49:52,244 INFO L142 LiptonReduction]: Number of co-enabled transitions 2896 [2021-03-25 12:49:52,250 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:49:52,250 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:49:52,250 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 668 [2021-03-25 12:49:52,251 INFO L480 AbstractCegarLoop]: Abstraction has has 149 places, 187 transitions, 2292 flow [2021-03-25 12:49:52,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 178.3) internal successors, (1783), 10 states have internal predecessors, (1783), 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) [2021-03-25 12:49:52,251 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:52,251 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:52,251 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 12:49:52,251 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:52,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:52,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1630737890, now seen corresponding path program 2 times [2021-03-25 12:49:52,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:52,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322239574] [2021-03-25 12:49:52,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:52,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:52,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:49:52,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:52,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 12:49:52,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:52,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 12:49:52,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:52,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:49:52,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:52,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:49:52,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:52,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:49:52,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:52,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 12:49:52,368 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-03-25 12:49:52,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:49:52,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:52,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:52,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:52,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:52,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322239574] [2021-03-25 12:49:52,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:52,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 12:49:52,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236010583] [2021-03-25 12:49:52,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 12:49:52,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:52,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 12:49:52,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-03-25 12:49:52,392 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 330 [2021-03-25 12:49:52,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 187 transitions, 2292 flow. Second operand has 11 states, 11 states have (on average 179.1818181818182) internal successors, (1971), 11 states have internal predecessors, (1971), 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) [2021-03-25 12:49:52,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:52,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 330 [2021-03-25 12:49:52,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:54,874 INFO L129 PetriNetUnfolder]: 14863/20854 cut-off events. [2021-03-25 12:49:54,875 INFO L130 PetriNetUnfolder]: For 130194/130802 co-relation queries the response was YES. [2021-03-25 12:49:54,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84073 conditions, 20854 events. 14863/20854 cut-off events. For 130194/130802 co-relation queries the response was YES. Maximal size of possible extension queue 1002. Compared 120445 event pairs, 3189 based on Foata normal form. 77/15639 useless extension candidates. Maximal degree in co-relation 83196. Up to 14929 conditions per place. [2021-03-25 12:49:55,026 INFO L132 encePairwiseOnDemand]: 318/330 looper letters, 136 selfloop transitions, 66 changer transitions 0/237 dead transitions. [2021-03-25 12:49:55,026 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 237 transitions, 3203 flow [2021-03-25 12:49:55,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-25 12:49:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-25 12:49:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2415 transitions. [2021-03-25 12:49:55,028 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5629370629370629 [2021-03-25 12:49:55,028 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2415 transitions. [2021-03-25 12:49:55,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2415 transitions. [2021-03-25 12:49:55,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:55,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2415 transitions. [2021-03-25 12:49:55,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 185.76923076923077) internal successors, (2415), 13 states have internal predecessors, (2415), 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) [2021-03-25 12:49:55,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 330.0) internal successors, (4620), 14 states have internal predecessors, (4620), 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) [2021-03-25 12:49:55,033 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 330.0) internal successors, (4620), 14 states have internal predecessors, (4620), 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) [2021-03-25 12:49:55,033 INFO L185 Difference]: Start difference. First operand has 149 places, 187 transitions, 2292 flow. Second operand 13 states and 2415 transitions. [2021-03-25 12:49:55,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 237 transitions, 3203 flow [2021-03-25 12:49:55,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 237 transitions, 3162 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-25 12:49:55,374 INFO L241 Difference]: Finished difference. Result has 164 places, 202 transitions, 2729 flow [2021-03-25 12:49:55,374 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=2253, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2729, PETRI_PLACES=164, PETRI_TRANSITIONS=202} [2021-03-25 12:49:55,374 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 101 predicate places. [2021-03-25 12:49:55,374 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:55,375 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 202 transitions, 2729 flow [2021-03-25 12:49:55,375 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 202 transitions, 2729 flow [2021-03-25 12:49:55,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 164 places, 202 transitions, 2729 flow [2021-03-25 12:49:55,809 INFO L129 PetriNetUnfolder]: 3863/6978 cut-off events. [2021-03-25 12:49:55,809 INFO L130 PetriNetUnfolder]: For 24034/24405 co-relation queries the response was YES. [2021-03-25 12:49:55,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18905 conditions, 6978 events. 3863/6978 cut-off events. For 24034/24405 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 53415 event pairs, 156 based on Foata normal form. 83/4843 useless extension candidates. Maximal degree in co-relation 18683. Up to 1614 conditions per place. [2021-03-25 12:49:55,907 INFO L142 LiptonReduction]: Number of co-enabled transitions 3012 [2021-03-25 12:49:55,914 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:49:55,915 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:49:55,915 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 541 [2021-03-25 12:49:55,915 INFO L480 AbstractCegarLoop]: Abstraction has has 164 places, 202 transitions, 2729 flow [2021-03-25 12:49:55,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 179.1818181818182) internal successors, (1971), 11 states have internal predecessors, (1971), 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) [2021-03-25 12:49:55,916 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:49:55,916 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:49:55,916 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 12:49:55,916 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:49:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:49:55,916 INFO L82 PathProgramCache]: Analyzing trace with hash 551550375, now seen corresponding path program 1 times [2021-03-25 12:49:55,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:49:55,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714369609] [2021-03-25 12:49:55,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:49:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:49:55,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:55,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:49:55,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:55,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 12:49:55,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:55,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 12:49:55,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:55,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:49:56,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:56,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:49:56,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:56,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:49:56,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:56,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:49:56,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:56,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:49:56,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:56,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:49:56,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:56,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:49:56,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:49:56,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:49:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:49:56,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714369609] [2021-03-25 12:49:56,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:49:56,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 12:49:56,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487215201] [2021-03-25 12:49:56,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 12:49:56,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:49:56,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 12:49:56,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-03-25 12:49:56,115 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 330 [2021-03-25 12:49:56,116 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 202 transitions, 2729 flow. Second operand has 11 states, 11 states have (on average 177.1818181818182) internal successors, (1949), 11 states have internal predecessors, (1949), 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) [2021-03-25 12:49:56,116 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:49:56,116 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 330 [2021-03-25 12:49:56,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:49:56,621 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2021-03-25 12:49:59,191 INFO L129 PetriNetUnfolder]: 16461/23110 cut-off events. [2021-03-25 12:49:59,191 INFO L130 PetriNetUnfolder]: For 166298/166791 co-relation queries the response was YES. [2021-03-25 12:49:59,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93784 conditions, 23110 events. 16461/23110 cut-off events. For 166298/166791 co-relation queries the response was YES. Maximal size of possible extension queue 1077. Compared 134273 event pairs, 2821 based on Foata normal form. 108/17301 useless extension candidates. Maximal degree in co-relation 92960. Up to 16201 conditions per place. [2021-03-25 12:49:59,346 INFO L132 encePairwiseOnDemand]: 317/330 looper letters, 194 selfloop transitions, 68 changer transitions 0/297 dead transitions. [2021-03-25 12:49:59,346 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 297 transitions, 4437 flow [2021-03-25 12:49:59,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 12:49:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 12:49:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1865 transitions. [2021-03-25 12:49:59,348 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5651515151515152 [2021-03-25 12:49:59,348 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1865 transitions. [2021-03-25 12:49:59,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1865 transitions. [2021-03-25 12:49:59,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:49:59,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1865 transitions. [2021-03-25 12:49:59,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 186.5) internal successors, (1865), 10 states have internal predecessors, (1865), 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) [2021-03-25 12:49:59,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 330.0) internal successors, (3630), 11 states have internal predecessors, (3630), 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) [2021-03-25 12:49:59,353 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 330.0) internal successors, (3630), 11 states have internal predecessors, (3630), 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) [2021-03-25 12:49:59,353 INFO L185 Difference]: Start difference. First operand has 164 places, 202 transitions, 2729 flow. Second operand 10 states and 1865 transitions. [2021-03-25 12:49:59,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 297 transitions, 4437 flow [2021-03-25 12:49:59,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 297 transitions, 4314 flow, removed 29 selfloop flow, removed 5 redundant places. [2021-03-25 12:49:59,583 INFO L241 Difference]: Finished difference. Result has 171 places, 218 transitions, 3018 flow [2021-03-25 12:49:59,583 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=2610, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3018, PETRI_PLACES=171, PETRI_TRANSITIONS=218} [2021-03-25 12:49:59,583 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 108 predicate places. [2021-03-25 12:49:59,583 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:49:59,584 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 218 transitions, 3018 flow [2021-03-25 12:49:59,584 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 218 transitions, 3018 flow [2021-03-25 12:49:59,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 171 places, 218 transitions, 3018 flow [2021-03-25 12:50:00,243 INFO L129 PetriNetUnfolder]: 4060/7293 cut-off events. [2021-03-25 12:50:00,243 INFO L130 PetriNetUnfolder]: For 27810/28105 co-relation queries the response was YES. [2021-03-25 12:50:00,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20094 conditions, 7293 events. 4060/7293 cut-off events. For 27810/28105 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 55789 event pairs, 95 based on Foata normal form. 60/5031 useless extension candidates. Maximal degree in co-relation 19869. Up to 1708 conditions per place. [2021-03-25 12:50:00,332 INFO L142 LiptonReduction]: Number of co-enabled transitions 3098 [2021-03-25 12:50:00,340 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:50:00,340 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:50:00,340 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 757 [2021-03-25 12:50:00,341 INFO L480 AbstractCegarLoop]: Abstraction has has 171 places, 218 transitions, 3018 flow [2021-03-25 12:50:00,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 177.1818181818182) internal successors, (1949), 11 states have internal predecessors, (1949), 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) [2021-03-25 12:50:00,341 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:50:00,341 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:50:00,341 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 12:50:00,341 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:50:00,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:50:00,342 INFO L82 PathProgramCache]: Analyzing trace with hash 758589394, now seen corresponding path program 2 times [2021-03-25 12:50:00,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:50:00,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373006754] [2021-03-25 12:50:00,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:50:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:50:00,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:00,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:50:00,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:00,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 12:50:00,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:00,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 12:50:00,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:00,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:50:00,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:00,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:50:00,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:00,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:50:00,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:00,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:50:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:50:00,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373006754] [2021-03-25 12:50:00,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:50:00,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 12:50:00,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944558526] [2021-03-25 12:50:00,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 12:50:00,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:50:00,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 12:50:00,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 12:50:00,416 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 330 [2021-03-25 12:50:00,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 218 transitions, 3018 flow. Second operand has 8 states, 8 states have (on average 229.5) internal successors, (1836), 8 states have internal predecessors, (1836), 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) [2021-03-25 12:50:00,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:50:00,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 330 [2021-03-25 12:50:00,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:50:01,988 INFO L129 PetriNetUnfolder]: 9678/14827 cut-off events. [2021-03-25 12:50:01,988 INFO L130 PetriNetUnfolder]: For 133029/134019 co-relation queries the response was YES. [2021-03-25 12:50:02,077 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65912 conditions, 14827 events. 9678/14827 cut-off events. For 133029/134019 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 97866 event pairs, 512 based on Foata normal form. 360/11735 useless extension candidates. Maximal degree in co-relation 65164. Up to 3932 conditions per place. [2021-03-25 12:50:02,124 INFO L132 encePairwiseOnDemand]: 318/330 looper letters, 135 selfloop transitions, 77 changer transitions 2/276 dead transitions. [2021-03-25 12:50:02,125 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 276 transitions, 4123 flow [2021-03-25 12:50:02,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:50:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:50:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1662 transitions. [2021-03-25 12:50:02,126 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7194805194805195 [2021-03-25 12:50:02,126 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1662 transitions. [2021-03-25 12:50:02,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1662 transitions. [2021-03-25 12:50:02,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:50:02,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1662 transitions. [2021-03-25 12:50:02,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 237.42857142857142) internal successors, (1662), 7 states have internal predecessors, (1662), 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) [2021-03-25 12:50:02,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 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) [2021-03-25 12:50:02,129 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 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) [2021-03-25 12:50:02,129 INFO L185 Difference]: Start difference. First operand has 171 places, 218 transitions, 3018 flow. Second operand 7 states and 1662 transitions. [2021-03-25 12:50:02,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 276 transitions, 4123 flow [2021-03-25 12:50:02,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 276 transitions, 3992 flow, removed 31 selfloop flow, removed 5 redundant places. [2021-03-25 12:50:02,569 INFO L241 Difference]: Finished difference. Result has 176 places, 235 transitions, 3477 flow [2021-03-25 12:50:02,569 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=2913, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3477, PETRI_PLACES=176, PETRI_TRANSITIONS=235} [2021-03-25 12:50:02,570 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 113 predicate places. [2021-03-25 12:50:02,570 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:50:02,570 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 235 transitions, 3477 flow [2021-03-25 12:50:02,570 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 235 transitions, 3477 flow [2021-03-25 12:50:02,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 176 places, 235 transitions, 3477 flow [2021-03-25 12:50:03,192 INFO L129 PetriNetUnfolder]: 4226/7629 cut-off events. [2021-03-25 12:50:03,192 INFO L130 PetriNetUnfolder]: For 38116/38463 co-relation queries the response was YES. [2021-03-25 12:50:03,250 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23000 conditions, 7629 events. 4226/7629 cut-off events. For 38116/38463 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 58877 event pairs, 73 based on Foata normal form. 102/5336 useless extension candidates. Maximal degree in co-relation 22768. Up to 1794 conditions per place. [2021-03-25 12:50:03,333 INFO L142 LiptonReduction]: Number of co-enabled transitions 3288 [2021-03-25 12:50:03,342 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:50:03,342 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:50:03,342 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 772 [2021-03-25 12:50:03,343 INFO L480 AbstractCegarLoop]: Abstraction has has 176 places, 235 transitions, 3477 flow [2021-03-25 12:50:03,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 229.5) internal successors, (1836), 8 states have internal predecessors, (1836), 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) [2021-03-25 12:50:03,343 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:50:03,343 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:50:03,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-25 12:50:03,343 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:50:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:50:03,344 INFO L82 PathProgramCache]: Analyzing trace with hash 750841812, now seen corresponding path program 3 times [2021-03-25 12:50:03,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:50:03,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492171277] [2021-03-25 12:50:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:50:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:50:03,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:03,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 12:50:03,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:03,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:50:03,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:03,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 12:50:03,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:03,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:50:03,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:03,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:50:03,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:03,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:50:03,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:03,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:50:03,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:03,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:50:03,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:03,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:50:03,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:03,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:50:03,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:50:03,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492171277] [2021-03-25 12:50:03,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:50:03,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 12:50:03,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250568555] [2021-03-25 12:50:03,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 12:50:03,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:50:03,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 12:50:03,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-25 12:50:03,465 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 330 [2021-03-25 12:50:03,466 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 235 transitions, 3477 flow. Second operand has 10 states, 10 states have (on average 178.3) internal successors, (1783), 10 states have internal predecessors, (1783), 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) [2021-03-25 12:50:03,466 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:50:03,466 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 330 [2021-03-25 12:50:03,466 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:50:06,470 INFO L129 PetriNetUnfolder]: 16158/22578 cut-off events. [2021-03-25 12:50:06,470 INFO L130 PetriNetUnfolder]: For 238200/239088 co-relation queries the response was YES. [2021-03-25 12:50:06,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103751 conditions, 22578 events. 16158/22578 cut-off events. For 238200/239088 co-relation queries the response was YES. Maximal size of possible extension queue 1087. Compared 130899 event pairs, 3430 based on Foata normal form. 98/16913 useless extension candidates. Maximal degree in co-relation 102917. Up to 14863 conditions per place. [2021-03-25 12:50:06,726 INFO L132 encePairwiseOnDemand]: 321/330 looper letters, 183 selfloop transitions, 53 changer transitions 0/271 dead transitions. [2021-03-25 12:50:06,726 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 271 transitions, 4267 flow [2021-03-25 12:50:06,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 12:50:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 12:50:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1495 transitions. [2021-03-25 12:50:06,728 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5662878787878788 [2021-03-25 12:50:06,728 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1495 transitions. [2021-03-25 12:50:06,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1495 transitions. [2021-03-25 12:50:06,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:50:06,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1495 transitions. [2021-03-25 12:50:06,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 186.875) internal successors, (1495), 8 states have internal predecessors, (1495), 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) [2021-03-25 12:50:06,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 330.0) internal successors, (2970), 9 states have internal predecessors, (2970), 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) [2021-03-25 12:50:06,732 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 330.0) internal successors, (2970), 9 states have internal predecessors, (2970), 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) [2021-03-25 12:50:06,732 INFO L185 Difference]: Start difference. First operand has 176 places, 235 transitions, 3477 flow. Second operand 8 states and 1495 transitions. [2021-03-25 12:50:06,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 271 transitions, 4267 flow [2021-03-25 12:50:07,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 271 transitions, 4165 flow, removed 16 selfloop flow, removed 4 redundant places. [2021-03-25 12:50:07,076 INFO L241 Difference]: Finished difference. Result has 182 places, 233 transitions, 3512 flow [2021-03-25 12:50:07,077 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=3320, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3512, PETRI_PLACES=182, PETRI_TRANSITIONS=233} [2021-03-25 12:50:07,077 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 119 predicate places. [2021-03-25 12:50:07,077 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:50:07,077 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 233 transitions, 3512 flow [2021-03-25 12:50:07,077 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 233 transitions, 3512 flow [2021-03-25 12:50:07,079 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 182 places, 233 transitions, 3512 flow [2021-03-25 12:50:07,807 INFO L129 PetriNetUnfolder]: 4157/7504 cut-off events. [2021-03-25 12:50:07,807 INFO L130 PetriNetUnfolder]: For 37375/37643 co-relation queries the response was YES. [2021-03-25 12:50:07,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22467 conditions, 7504 events. 4157/7504 cut-off events. For 37375/37643 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 57937 event pairs, 92 based on Foata normal form. 91/5208 useless extension candidates. Maximal degree in co-relation 22234. Up to 1786 conditions per place. [2021-03-25 12:50:07,917 INFO L142 LiptonReduction]: Number of co-enabled transitions 3270 [2021-03-25 12:50:07,926 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:50:07,926 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:50:07,926 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 849 [2021-03-25 12:50:07,926 INFO L480 AbstractCegarLoop]: Abstraction has has 182 places, 233 transitions, 3512 flow [2021-03-25 12:50:07,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 178.3) internal successors, (1783), 10 states have internal predecessors, (1783), 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) [2021-03-25 12:50:07,927 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:50:07,927 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:50:07,927 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-25 12:50:07,927 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:50:07,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:50:07,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1230078054, now seen corresponding path program 1 times [2021-03-25 12:50:07,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:50:07,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675515055] [2021-03-25 12:50:07,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:50:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:50:07,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:07,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:50:07,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:07,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 12:50:07,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:07,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 12:50:08,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:08,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:50:08,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:08,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:50:08,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:08,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 12:50:08,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:08,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:50:08,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:08,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:50:08,129 INFO L142 QuantifierPusher]: treesize reduction 14, result has 36.4 percent of original size [2021-03-25 12:50:08,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:50:08,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:08,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:50:08,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:08,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:50:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:50:08,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675515055] [2021-03-25 12:50:08,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:50:08,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 12:50:08,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322063467] [2021-03-25 12:50:08,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 12:50:08,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:50:08,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 12:50:08,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-03-25 12:50:08,155 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 330 [2021-03-25 12:50:08,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 233 transitions, 3512 flow. Second operand has 11 states, 11 states have (on average 177.27272727272728) internal successors, (1950), 11 states have internal predecessors, (1950), 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) [2021-03-25 12:50:08,157 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:50:08,157 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 330 [2021-03-25 12:50:08,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:50:11,025 INFO L129 PetriNetUnfolder]: 15407/21952 cut-off events. [2021-03-25 12:50:11,025 INFO L130 PetriNetUnfolder]: For 225833/226395 co-relation queries the response was YES. [2021-03-25 12:50:11,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97024 conditions, 21952 events. 15407/21952 cut-off events. For 225833/226395 co-relation queries the response was YES. Maximal size of possible extension queue 1055. Compared 130778 event pairs, 2453 based on Foata normal form. 142/16405 useless extension candidates. Maximal degree in co-relation 96280. Up to 15191 conditions per place. [2021-03-25 12:50:11,256 INFO L132 encePairwiseOnDemand]: 318/330 looper letters, 180 selfloop transitions, 53 changer transitions 0/276 dead transitions. [2021-03-25 12:50:11,257 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 276 transitions, 4540 flow [2021-03-25 12:50:11,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 12:50:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 12:50:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1851 transitions. [2021-03-25 12:50:11,258 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5609090909090909 [2021-03-25 12:50:11,258 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1851 transitions. [2021-03-25 12:50:11,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1851 transitions. [2021-03-25 12:50:11,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:50:11,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1851 transitions. [2021-03-25 12:50:11,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 185.1) internal successors, (1851), 10 states have internal predecessors, (1851), 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) [2021-03-25 12:50:11,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 330.0) internal successors, (3630), 11 states have internal predecessors, (3630), 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) [2021-03-25 12:50:11,262 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 330.0) internal successors, (3630), 11 states have internal predecessors, (3630), 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) [2021-03-25 12:50:11,262 INFO L185 Difference]: Start difference. First operand has 182 places, 233 transitions, 3512 flow. Second operand 10 states and 1851 transitions. [2021-03-25 12:50:11,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 276 transitions, 4540 flow [2021-03-25 12:50:11,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 276 transitions, 4261 flow, removed 26 selfloop flow, removed 12 redundant places. [2021-03-25 12:50:11,601 INFO L241 Difference]: Finished difference. Result has 181 places, 207 transitions, 3044 flow [2021-03-25 12:50:11,601 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=2917, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3044, PETRI_PLACES=181, PETRI_TRANSITIONS=207} [2021-03-25 12:50:11,601 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 118 predicate places. [2021-03-25 12:50:11,601 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:50:11,602 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 207 transitions, 3044 flow [2021-03-25 12:50:11,602 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 207 transitions, 3044 flow [2021-03-25 12:50:11,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 181 places, 207 transitions, 3044 flow [2021-03-25 12:50:12,273 INFO L129 PetriNetUnfolder]: 3964/7051 cut-off events. [2021-03-25 12:50:12,273 INFO L130 PetriNetUnfolder]: For 30775/31018 co-relation queries the response was YES. [2021-03-25 12:50:12,316 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20283 conditions, 7051 events. 3964/7051 cut-off events. For 30775/31018 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 52869 event pairs, 59 based on Foata normal form. 110/4880 useless extension candidates. Maximal degree in co-relation 20051. Up to 1690 conditions per place. [2021-03-25 12:50:12,372 INFO L142 LiptonReduction]: Number of co-enabled transitions 2868 [2021-03-25 12:50:12,379 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:50:12,379 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:50:12,379 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 778 [2021-03-25 12:50:12,380 INFO L480 AbstractCegarLoop]: Abstraction has has 181 places, 207 transitions, 3044 flow [2021-03-25 12:50:12,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 177.27272727272728) internal successors, (1950), 11 states have internal predecessors, (1950), 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) [2021-03-25 12:50:12,380 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:50:12,380 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:50:12,380 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-25 12:50:12,380 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:50:12,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:50:12,380 INFO L82 PathProgramCache]: Analyzing trace with hash 110549166, now seen corresponding path program 1 times [2021-03-25 12:50:12,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:50:12,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890872928] [2021-03-25 12:50:12,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:50:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:50:12,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:12,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:50:12,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:12,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:50:12,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:12,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:50:12,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:12,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:50:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:50:12,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890872928] [2021-03-25 12:50:12,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:50:12,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 12:50:12,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554144483] [2021-03-25 12:50:12,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 12:50:12,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:50:12,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 12:50:12,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 12:50:12,406 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 330 [2021-03-25 12:50:12,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 207 transitions, 3044 flow. Second operand has 5 states, 5 states have (on average 226.4) internal successors, (1132), 5 states have internal predecessors, (1132), 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) [2021-03-25 12:50:12,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:50:12,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 330 [2021-03-25 12:50:12,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:50:14,692 INFO L129 PetriNetUnfolder]: 14425/20401 cut-off events. [2021-03-25 12:50:14,692 INFO L130 PetriNetUnfolder]: For 188998/189693 co-relation queries the response was YES. [2021-03-25 12:50:14,799 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90225 conditions, 20401 events. 14425/20401 cut-off events. For 188998/189693 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 119971 event pairs, 3059 based on Foata normal form. 111/15247 useless extension candidates. Maximal degree in co-relation 89509. Up to 15320 conditions per place. [2021-03-25 12:50:14,864 INFO L132 encePairwiseOnDemand]: 323/330 looper letters, 204 selfloop transitions, 7 changer transitions 0/261 dead transitions. [2021-03-25 12:50:14,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 261 transitions, 4180 flow [2021-03-25 12:50:14,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 12:50:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 12:50:14,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1412 transitions. [2021-03-25 12:50:14,865 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7131313131313132 [2021-03-25 12:50:14,865 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1412 transitions. [2021-03-25 12:50:14,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1412 transitions. [2021-03-25 12:50:14,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:50:14,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1412 transitions. [2021-03-25 12:50:14,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 235.33333333333334) internal successors, (1412), 6 states have internal predecessors, (1412), 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) [2021-03-25 12:50:14,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 330.0) internal successors, (2310), 7 states have internal predecessors, (2310), 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) [2021-03-25 12:50:14,868 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 330.0) internal successors, (2310), 7 states have internal predecessors, (2310), 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) [2021-03-25 12:50:14,868 INFO L185 Difference]: Start difference. First operand has 181 places, 207 transitions, 3044 flow. Second operand 6 states and 1412 transitions. [2021-03-25 12:50:14,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 261 transitions, 4180 flow [2021-03-25 12:50:15,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 261 transitions, 4054 flow, removed 0 selfloop flow, removed 9 redundant places. [2021-03-25 12:50:15,096 INFO L241 Difference]: Finished difference. Result has 179 places, 208 transitions, 2966 flow [2021-03-25 12:50:15,096 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=2938, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2966, PETRI_PLACES=179, PETRI_TRANSITIONS=208} [2021-03-25 12:50:15,096 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 116 predicate places. [2021-03-25 12:50:15,096 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:50:15,096 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 208 transitions, 2966 flow [2021-03-25 12:50:15,096 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 208 transitions, 2966 flow [2021-03-25 12:50:15,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 179 places, 208 transitions, 2966 flow [2021-03-25 12:50:15,806 INFO L129 PetriNetUnfolder]: 3883/7008 cut-off events. [2021-03-25 12:50:15,807 INFO L130 PetriNetUnfolder]: For 28572/28756 co-relation queries the response was YES. [2021-03-25 12:50:15,848 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19655 conditions, 7008 events. 3883/7008 cut-off events. For 28572/28756 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 53336 event pairs, 58 based on Foata normal form. 96/4867 useless extension candidates. Maximal degree in co-relation 19421. Up to 1696 conditions per place. [2021-03-25 12:50:15,904 INFO L142 LiptonReduction]: Number of co-enabled transitions 2848 [2021-03-25 12:50:15,911 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:50:15,911 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:50:15,911 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 815 [2021-03-25 12:50:15,911 INFO L480 AbstractCegarLoop]: Abstraction has has 179 places, 208 transitions, 2966 flow [2021-03-25 12:50:15,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 226.4) internal successors, (1132), 5 states have internal predecessors, (1132), 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) [2021-03-25 12:50:15,912 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:50:15,912 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:50:15,912 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-25 12:50:15,912 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:50:15,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:50:15,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1575795269, now seen corresponding path program 1 times [2021-03-25 12:50:15,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:50:15,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960593244] [2021-03-25 12:50:15,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:50:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:50:15,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:15,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:50:15,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:15,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 12:50:15,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:15,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:50:15,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:15,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:50:15,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:15,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:50:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:50:15,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960593244] [2021-03-25 12:50:15,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:50:15,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 12:50:15,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865473571] [2021-03-25 12:50:15,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 12:50:15,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:50:15,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 12:50:15,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 12:50:15,951 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 330 [2021-03-25 12:50:15,951 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 208 transitions, 2966 flow. Second operand has 6 states, 6 states have (on average 184.33333333333334) internal successors, (1106), 6 states have internal predecessors, (1106), 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) [2021-03-25 12:50:15,951 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:50:15,951 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 330 [2021-03-25 12:50:15,951 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:50:18,289 INFO L129 PetriNetUnfolder]: 13950/19823 cut-off events. [2021-03-25 12:50:18,290 INFO L130 PetriNetUnfolder]: For 184419/185103 co-relation queries the response was YES. [2021-03-25 12:50:18,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88579 conditions, 19823 events. 13950/19823 cut-off events. For 184419/185103 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 117168 event pairs, 2998 based on Foata normal form. 175/14914 useless extension candidates. Maximal degree in co-relation 87860. Up to 13074 conditions per place. [2021-03-25 12:50:18,479 INFO L132 encePairwiseOnDemand]: 322/330 looper letters, 198 selfloop transitions, 19 changer transitions 0/262 dead transitions. [2021-03-25 12:50:18,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 262 transitions, 4092 flow [2021-03-25 12:50:18,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 12:50:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 12:50:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1531 transitions. [2021-03-25 12:50:18,481 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5799242424242425 [2021-03-25 12:50:18,481 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1531 transitions. [2021-03-25 12:50:18,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1531 transitions. [2021-03-25 12:50:18,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:50:18,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1531 transitions. [2021-03-25 12:50:18,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 191.375) internal successors, (1531), 8 states have internal predecessors, (1531), 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) [2021-03-25 12:50:18,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 330.0) internal successors, (2970), 9 states have internal predecessors, (2970), 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) [2021-03-25 12:50:18,485 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 330.0) internal successors, (2970), 9 states have internal predecessors, (2970), 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) [2021-03-25 12:50:18,485 INFO L185 Difference]: Start difference. First operand has 179 places, 208 transitions, 2966 flow. Second operand 8 states and 1531 transitions. [2021-03-25 12:50:18,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 262 transitions, 4092 flow [2021-03-25 12:50:18,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 262 transitions, 4080 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 12:50:18,792 INFO L241 Difference]: Finished difference. Result has 184 places, 209 transitions, 3016 flow [2021-03-25 12:50:18,792 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=2954, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3016, PETRI_PLACES=184, PETRI_TRANSITIONS=209} [2021-03-25 12:50:18,792 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 121 predicate places. [2021-03-25 12:50:18,792 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:50:18,792 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 209 transitions, 3016 flow [2021-03-25 12:50:18,792 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 209 transitions, 3016 flow [2021-03-25 12:50:18,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 184 places, 209 transitions, 3016 flow [2021-03-25 12:50:19,530 INFO L129 PetriNetUnfolder]: 3836/6942 cut-off events. [2021-03-25 12:50:19,530 INFO L130 PetriNetUnfolder]: For 27505/27634 co-relation queries the response was YES. [2021-03-25 12:50:19,567 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19420 conditions, 6942 events. 3836/6942 cut-off events. For 27505/27634 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 52971 event pairs, 55 based on Foata normal form. 93/4820 useless extension candidates. Maximal degree in co-relation 18854. Up to 1700 conditions per place. [2021-03-25 12:50:19,618 INFO L142 LiptonReduction]: Number of co-enabled transitions 2798 [2021-03-25 12:50:19,625 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:50:19,625 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:50:19,625 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 833 [2021-03-25 12:50:19,626 INFO L480 AbstractCegarLoop]: Abstraction has has 184 places, 209 transitions, 3016 flow [2021-03-25 12:50:19,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 184.33333333333334) internal successors, (1106), 6 states have internal predecessors, (1106), 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) [2021-03-25 12:50:19,626 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:50:19,626 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:50:19,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-25 12:50:19,626 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:50:19,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:50:19,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1438434779, now seen corresponding path program 2 times [2021-03-25 12:50:19,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:50:19,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305642428] [2021-03-25 12:50:19,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:50:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:50:19,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:19,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:50:19,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:19,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:50:19,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:19,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:50:19,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:19,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 12:50:19,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:19,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:50:19,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:19,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:50:19,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:19,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:50:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:50:19,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305642428] [2021-03-25 12:50:19,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:50:19,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 12:50:19,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761983641] [2021-03-25 12:50:19,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 12:50:19,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:50:19,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 12:50:19,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-25 12:50:19,703 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 330 [2021-03-25 12:50:19,704 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 209 transitions, 3016 flow. Second operand has 8 states, 8 states have (on average 182.75) internal successors, (1462), 8 states have internal predecessors, (1462), 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) [2021-03-25 12:50:19,704 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:50:19,704 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 330 [2021-03-25 12:50:19,704 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:50:22,135 INFO L129 PetriNetUnfolder]: 13499/19281 cut-off events. [2021-03-25 12:50:22,135 INFO L130 PetriNetUnfolder]: For 182632/183310 co-relation queries the response was YES. [2021-03-25 12:50:22,228 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87072 conditions, 19281 events. 13499/19281 cut-off events. For 182632/183310 co-relation queries the response was YES. Maximal size of possible extension queue 977. Compared 114588 event pairs, 2837 based on Foata normal form. 185/14555 useless extension candidates. Maximal degree in co-relation 86604. Up to 10836 conditions per place. [2021-03-25 12:50:22,283 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 180 selfloop transitions, 32 changer transitions 0/257 dead transitions. [2021-03-25 12:50:22,283 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 257 transitions, 4009 flow [2021-03-25 12:50:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 12:50:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 12:50:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1890 transitions. [2021-03-25 12:50:22,285 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5727272727272728 [2021-03-25 12:50:22,285 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1890 transitions. [2021-03-25 12:50:22,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1890 transitions. [2021-03-25 12:50:22,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:50:22,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1890 transitions. [2021-03-25 12:50:22,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 189.0) internal successors, (1890), 10 states have internal predecessors, (1890), 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) [2021-03-25 12:50:22,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 330.0) internal successors, (3630), 11 states have internal predecessors, (3630), 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) [2021-03-25 12:50:22,289 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 330.0) internal successors, (3630), 11 states have internal predecessors, (3630), 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) [2021-03-25 12:50:22,289 INFO L185 Difference]: Start difference. First operand has 184 places, 209 transitions, 3016 flow. Second operand 10 states and 1890 transitions. [2021-03-25 12:50:22,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 257 transitions, 4009 flow [2021-03-25 12:50:22,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 257 transitions, 3967 flow, removed 2 selfloop flow, removed 7 redundant places. [2021-03-25 12:50:22,521 INFO L241 Difference]: Finished difference. Result has 188 places, 210 transitions, 3072 flow [2021-03-25 12:50:22,521 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=2974, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3072, PETRI_PLACES=188, PETRI_TRANSITIONS=210} [2021-03-25 12:50:22,522 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 125 predicate places. [2021-03-25 12:50:22,522 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:50:22,522 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 210 transitions, 3072 flow [2021-03-25 12:50:22,522 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 210 transitions, 3072 flow [2021-03-25 12:50:22,523 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 188 places, 210 transitions, 3072 flow [2021-03-25 12:50:22,967 INFO L129 PetriNetUnfolder]: 3774/6864 cut-off events. [2021-03-25 12:50:22,968 INFO L130 PetriNetUnfolder]: For 26694/26822 co-relation queries the response was YES. [2021-03-25 12:50:23,012 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19028 conditions, 6864 events. 3774/6864 cut-off events. For 26694/26822 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 52601 event pairs, 57 based on Foata normal form. 48/4714 useless extension candidates. Maximal degree in co-relation 18874. Up to 1696 conditions per place. [2021-03-25 12:50:23,071 INFO L142 LiptonReduction]: Number of co-enabled transitions 2748 [2021-03-25 12:50:23,078 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:50:23,078 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:50:23,078 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 556 [2021-03-25 12:50:23,078 INFO L480 AbstractCegarLoop]: Abstraction has has 188 places, 210 transitions, 3072 flow [2021-03-25 12:50:23,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 182.75) internal successors, (1462), 8 states have internal predecessors, (1462), 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) [2021-03-25 12:50:23,079 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:50:23,079 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:50:23,079 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-25 12:50:23,079 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:50:23,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:50:23,079 INFO L82 PathProgramCache]: Analyzing trace with hash -710361757, now seen corresponding path program 3 times [2021-03-25 12:50:23,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:50:23,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911898148] [2021-03-25 12:50:23,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:50:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:50:23,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:23,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:50:23,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:23,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:50:23,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:23,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:50:23,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:23,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:50:23,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:23,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 12:50:23,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:23,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:50:23,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:23,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:50:23,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:23,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:50:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:50:23,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911898148] [2021-03-25 12:50:23,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:50:23,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 12:50:23,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755978142] [2021-03-25 12:50:23,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 12:50:23,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:50:23,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 12:50:23,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-25 12:50:23,175 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 330 [2021-03-25 12:50:23,175 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 210 transitions, 3072 flow. Second operand has 9 states, 9 states have (on average 181.55555555555554) internal successors, (1634), 9 states have internal predecessors, (1634), 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) [2021-03-25 12:50:23,176 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:50:23,176 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 330 [2021-03-25 12:50:23,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:50:23,456 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2021-03-25 12:50:25,492 INFO L129 PetriNetUnfolder]: 12995/18656 cut-off events. [2021-03-25 12:50:25,493 INFO L130 PetriNetUnfolder]: For 177993/178658 co-relation queries the response was YES. [2021-03-25 12:50:25,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84256 conditions, 18656 events. 12995/18656 cut-off events. For 177993/178658 co-relation queries the response was YES. Maximal size of possible extension queue 950. Compared 111597 event pairs, 2760 based on Foata normal form. 186/14151 useless extension candidates. Maximal degree in co-relation 83728. Up to 10312 conditions per place. [2021-03-25 12:50:25,660 INFO L132 encePairwiseOnDemand]: 318/330 looper letters, 165 selfloop transitions, 57 changer transitions 0/267 dead transitions. [2021-03-25 12:50:25,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 267 transitions, 4285 flow [2021-03-25 12:50:25,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-25 12:50:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-25 12:50:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2247 transitions. [2021-03-25 12:50:25,662 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5674242424242424 [2021-03-25 12:50:25,662 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2247 transitions. [2021-03-25 12:50:25,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2247 transitions. [2021-03-25 12:50:25,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:50:25,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2247 transitions. [2021-03-25 12:50:25,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 187.25) internal successors, (2247), 12 states have internal predecessors, (2247), 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) [2021-03-25 12:50:25,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 330.0) internal successors, (4290), 13 states have internal predecessors, (4290), 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) [2021-03-25 12:50:25,667 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 330.0) internal successors, (4290), 13 states have internal predecessors, (4290), 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) [2021-03-25 12:50:25,667 INFO L185 Difference]: Start difference. First operand has 188 places, 210 transitions, 3072 flow. Second operand 12 states and 2247 transitions. [2021-03-25 12:50:25,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 267 transitions, 4285 flow [2021-03-25 12:50:25,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 267 transitions, 4220 flow, removed 4 selfloop flow, removed 8 redundant places. [2021-03-25 12:50:25,943 INFO L241 Difference]: Finished difference. Result has 193 places, 217 transitions, 3300 flow [2021-03-25 12:50:25,944 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=3009, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3300, PETRI_PLACES=193, PETRI_TRANSITIONS=217} [2021-03-25 12:50:25,944 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 130 predicate places. [2021-03-25 12:50:25,944 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:50:25,944 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 217 transitions, 3300 flow [2021-03-25 12:50:25,944 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 217 transitions, 3300 flow [2021-03-25 12:50:25,946 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 193 places, 217 transitions, 3300 flow [2021-03-25 12:50:26,672 INFO L129 PetriNetUnfolder]: 3728/6790 cut-off events. [2021-03-25 12:50:26,672 INFO L130 PetriNetUnfolder]: For 26773/26921 co-relation queries the response was YES. [2021-03-25 12:50:26,727 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18680 conditions, 6790 events. 3728/6790 cut-off events. For 26773/26921 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 52272 event pairs, 93 based on Foata normal form. 76/4688 useless extension candidates. Maximal degree in co-relation 18530. Up to 1696 conditions per place. [2021-03-25 12:50:26,787 INFO L142 LiptonReduction]: Number of co-enabled transitions 2696 [2021-03-25 12:50:26,794 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:50:26,794 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:50:26,794 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 850 [2021-03-25 12:50:26,795 INFO L480 AbstractCegarLoop]: Abstraction has has 193 places, 217 transitions, 3300 flow [2021-03-25 12:50:26,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 181.55555555555554) internal successors, (1634), 9 states have internal predecessors, (1634), 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) [2021-03-25 12:50:26,795 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:50:26,795 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:50:26,795 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-25 12:50:26,795 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:50:26,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:50:26,796 INFO L82 PathProgramCache]: Analyzing trace with hash 730801183, now seen corresponding path program 1 times [2021-03-25 12:50:26,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:50:26,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075701561] [2021-03-25 12:50:26,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:50:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:50:26,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:26,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:50:26,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:26,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 12:50:26,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:26,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 12:50:26,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:26,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:50:26,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:26,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:50:26,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:26,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:50:26,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:26,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:50:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:50:26,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075701561] [2021-03-25 12:50:26,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:50:26,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 12:50:26,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289615267] [2021-03-25 12:50:26,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 12:50:26,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:50:26,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 12:50:26,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 12:50:26,860 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 330 [2021-03-25 12:50:26,861 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 217 transitions, 3300 flow. Second operand has 8 states, 8 states have (on average 211.625) internal successors, (1693), 8 states have internal predecessors, (1693), 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) [2021-03-25 12:50:26,861 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:50:26,861 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 330 [2021-03-25 12:50:26,861 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:50:28,562 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_19| (select (select |v_#memory_int_124| v_~v~0.base_42) v_~v~0.offset_42)) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_19|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_124|, ~v~0.base=v_~v~0.base_42} OutVars{~v~0.offset=v_~v~0.offset_42, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_19|, #memory_int=|v_#memory_int_124|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ~v~0.base=v_~v~0.base_42, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start___VERIFIER_assert_#in~expression][158], [Black: 380#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), Black: 634#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 262#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 515#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (and (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 88))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|))), Black: 519#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (and (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 88))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|))), Black: 647#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 504#(and (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|))), Black: 525#(and (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|))), Black: 509#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 394#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 527#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (and (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 88))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|))), 535#true, 157#L1155-1true, Black: 278#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 287#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 291#true, Black: 419#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 679#(and (or (= |ULTIMATE.start_main_#t~mem18| 5) (= |ULTIMATE.start_main_#t~mem18| 1)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0))), Black: 666#(or (= |ULTIMATE.start_main_#t~mem18| 5) (= |ULTIMATE.start_main_#t~mem18| 1)), Black: 423#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 683#true, 173#(= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1), Black: 545#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 555#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 557#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 305#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 307#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 309#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 298#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 434#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 438#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), Black: 303#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 444#true, Black: 178#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), 575#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), Black: 182#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 186#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 577#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), Black: 705#(and (or (= |ULTIMATE.start_main_#t~mem18| 2) (= |ULTIMATE.start_main_#t~mem18| 5)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0))), Black: 690#(or (= |ULTIMATE.start_main_#t~mem18| 2) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 571#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 573#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 324#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 198#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 328#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 203#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 722#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 466#(and (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)) (or (and (= thread2Thread1of1ForFork5_thidvar0 1) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)))), 85#thread2ENTRYtrue, Black: 454#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 462#(and (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0)) (or (and (= thread2Thread1of1ForFork5_thidvar0 1) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)))), Black: 592#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 598#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 600#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 210#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 215#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 219#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 224#true, Black: 226#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 353#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 227#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)), Black: 355#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 345#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 490#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 492#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 494#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 627#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread2Thread1of1ForFork5_thidvar0 1)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 615#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), 122#L1164-2true, Black: 248#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 239#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 374#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 376#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset)))]) [2021-03-25 12:50:28,562 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-25 12:50:28,562 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 12:50:28,562 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 12:50:28,562 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 12:50:28,563 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_19| (select (select |v_#memory_int_124| v_~v~0.base_42) v_~v~0.offset_42)) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_19|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_124|, ~v~0.base=v_~v~0.base_42} OutVars{~v~0.offset=v_~v~0.offset_42, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_19|, #memory_int=|v_#memory_int_124|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ~v~0.base=v_~v~0.base_42, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start___VERIFIER_assert_#in~expression][158], [Black: 380#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), Black: 634#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 262#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 515#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (and (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 88))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|))), Black: 519#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (and (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 88))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|))), Black: 647#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 504#(and (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|))), Black: 525#(and (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|))), Black: 509#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 394#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 527#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (and (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 88))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|))), 535#true, 157#L1155-1true, Black: 278#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 287#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 291#true, Black: 419#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 679#(and (or (= |ULTIMATE.start_main_#t~mem18| 5) (= |ULTIMATE.start_main_#t~mem18| 1)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0))), Black: 666#(or (= |ULTIMATE.start_main_#t~mem18| 5) (= |ULTIMATE.start_main_#t~mem18| 1)), Black: 423#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 683#true, 173#(= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1), Black: 545#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 555#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 557#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 305#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 307#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 309#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 298#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 434#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 438#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), Black: 303#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 444#true, Black: 178#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 182#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 575#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), Black: 186#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 577#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), Black: 705#(and (or (= |ULTIMATE.start_main_#t~mem18| 2) (= |ULTIMATE.start_main_#t~mem18| 5)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0))), Black: 690#(or (= |ULTIMATE.start_main_#t~mem18| 2) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 571#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 573#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 73#thread2ENTRYtrue, Black: 324#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 198#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 328#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 203#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 722#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 466#(and (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)) (or (and (= thread2Thread1of1ForFork5_thidvar0 1) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)))), Black: 454#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 462#(and (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0)) (or (and (= thread2Thread1of1ForFork5_thidvar0 1) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)))), Black: 592#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 598#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 600#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 210#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 215#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 219#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 224#true, Black: 226#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 353#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 227#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)), Black: 355#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 345#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 490#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 492#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 494#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 627#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread2Thread1of1ForFork5_thidvar0 1)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 615#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), 122#L1164-2true, Black: 248#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 239#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 374#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 376#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset)))]) [2021-03-25 12:50:28,563 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-25 12:50:28,563 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 12:50:28,563 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 12:50:28,563 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 12:50:28,978 INFO L129 PetriNetUnfolder]: 9621/14987 cut-off events. [2021-03-25 12:50:28,978 INFO L130 PetriNetUnfolder]: For 146898/147830 co-relation queries the response was YES. [2021-03-25 12:50:29,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67824 conditions, 14987 events. 9621/14987 cut-off events. For 146898/147830 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 101939 event pairs, 543 based on Foata normal form. 596/12180 useless extension candidates. Maximal degree in co-relation 67414. Up to 4685 conditions per place. [2021-03-25 12:50:29,104 INFO L132 encePairwiseOnDemand]: 318/330 looper letters, 140 selfloop transitions, 73 changer transitions 16/295 dead transitions. [2021-03-25 12:50:29,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 295 transitions, 4643 flow [2021-03-25 12:50:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:50:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:50:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1971 transitions. [2021-03-25 12:50:29,106 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2021-03-25 12:50:29,106 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1971 transitions. [2021-03-25 12:50:29,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1971 transitions. [2021-03-25 12:50:29,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:50:29,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1971 transitions. [2021-03-25 12:50:29,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 219.0) internal successors, (1971), 9 states have internal predecessors, (1971), 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) [2021-03-25 12:50:29,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:50:29,111 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:50:29,111 INFO L185 Difference]: Start difference. First operand has 193 places, 217 transitions, 3300 flow. Second operand 9 states and 1971 transitions. [2021-03-25 12:50:29,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 295 transitions, 4643 flow [2021-03-25 12:50:29,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 295 transitions, 4596 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-03-25 12:50:29,368 INFO L241 Difference]: Finished difference. Result has 201 places, 233 transitions, 3773 flow [2021-03-25 12:50:29,368 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=3257, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3773, PETRI_PLACES=201, PETRI_TRANSITIONS=233} [2021-03-25 12:50:29,368 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 138 predicate places. [2021-03-25 12:50:29,368 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:50:29,369 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 233 transitions, 3773 flow [2021-03-25 12:50:29,369 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 233 transitions, 3773 flow [2021-03-25 12:50:29,370 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 200 places, 233 transitions, 3773 flow [2021-03-25 12:50:29,907 INFO L129 PetriNetUnfolder]: 4156/7619 cut-off events. [2021-03-25 12:50:29,907 INFO L130 PetriNetUnfolder]: For 37985/38259 co-relation queries the response was YES. [2021-03-25 12:50:29,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22322 conditions, 7619 events. 4156/7619 cut-off events. For 37985/38259 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 60234 event pairs, 49 based on Foata normal form. 112/5298 useless extension candidates. Maximal degree in co-relation 21949. Up to 1936 conditions per place. [2021-03-25 12:50:30,029 INFO L142 LiptonReduction]: Number of co-enabled transitions 3414 [2021-03-25 12:50:30,041 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:50:30,041 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:50:30,041 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 673 [2021-03-25 12:50:30,041 INFO L480 AbstractCegarLoop]: Abstraction has has 200 places, 233 transitions, 3773 flow [2021-03-25 12:50:30,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 211.625) internal successors, (1693), 8 states have internal predecessors, (1693), 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) [2021-03-25 12:50:30,042 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:50:30,042 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:50:30,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-03-25 12:50:30,042 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:50:30,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:50:30,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1677324299, now seen corresponding path program 1 times [2021-03-25 12:50:30,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:50:30,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262513598] [2021-03-25 12:50:30,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:50:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:50:30,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:30,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:50:30,228 INFO L142 QuantifierPusher]: treesize reduction 4, result has 92.6 percent of original size [2021-03-25 12:50:30,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 12:50:30,245 INFO L142 QuantifierPusher]: treesize reduction 4, result has 92.0 percent of original size [2021-03-25 12:50:30,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 12:50:30,262 INFO L142 QuantifierPusher]: treesize reduction 4, result has 91.8 percent of original size [2021-03-25 12:50:30,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 12:50:30,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:30,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:50:30,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:30,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:50:30,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:30,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 12:50:30,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:30,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 12:50:30,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:30,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:50:30,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:30,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:50:30,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:30,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:50:30,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:30,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:50:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:50:30,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262513598] [2021-03-25 12:50:30,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:50:30,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 12:50:30,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194218331] [2021-03-25 12:50:30,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 12:50:30,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:50:30,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 12:50:30,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-03-25 12:50:30,404 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 330 [2021-03-25 12:50:30,405 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 233 transitions, 3773 flow. Second operand has 12 states, 12 states have (on average 175.16666666666666) internal successors, (2102), 12 states have internal predecessors, (2102), 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) [2021-03-25 12:50:30,405 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:50:30,405 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 330 [2021-03-25 12:50:30,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:50:33,678 INFO L129 PetriNetUnfolder]: 14920/21464 cut-off events. [2021-03-25 12:50:33,679 INFO L130 PetriNetUnfolder]: For 283652/284820 co-relation queries the response was YES. [2021-03-25 12:50:33,807 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106693 conditions, 21464 events. 14920/21464 cut-off events. For 283652/284820 co-relation queries the response was YES. Maximal size of possible extension queue 1089. Compared 132206 event pairs, 2385 based on Foata normal form. 233/16481 useless extension candidates. Maximal degree in co-relation 106192. Up to 11264 conditions per place. [2021-03-25 12:50:33,850 INFO L132 encePairwiseOnDemand]: 315/330 looper letters, 193 selfloop transitions, 84 changer transitions 17/333 dead transitions. [2021-03-25 12:50:33,850 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 333 transitions, 5709 flow [2021-03-25 12:50:33,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-25 12:50:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-25 12:50:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2368 transitions. [2021-03-25 12:50:33,853 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.551981351981352 [2021-03-25 12:50:33,853 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2368 transitions. [2021-03-25 12:50:33,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2368 transitions. [2021-03-25 12:50:33,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:50:33,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2368 transitions. [2021-03-25 12:50:33,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 182.15384615384616) internal successors, (2368), 13 states have internal predecessors, (2368), 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) [2021-03-25 12:50:33,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 330.0) internal successors, (4620), 14 states have internal predecessors, (4620), 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) [2021-03-25 12:50:33,857 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 330.0) internal successors, (4620), 14 states have internal predecessors, (4620), 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) [2021-03-25 12:50:33,857 INFO L185 Difference]: Start difference. First operand has 200 places, 233 transitions, 3773 flow. Second operand 13 states and 2368 transitions. [2021-03-25 12:50:33,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 333 transitions, 5709 flow [2021-03-25 12:50:34,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 333 transitions, 5394 flow, removed 31 selfloop flow, removed 13 redundant places. [2021-03-25 12:50:34,383 INFO L241 Difference]: Finished difference. Result has 203 places, 248 transitions, 4025 flow [2021-03-25 12:50:34,383 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=3486, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4025, PETRI_PLACES=203, PETRI_TRANSITIONS=248} [2021-03-25 12:50:34,383 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 140 predicate places. [2021-03-25 12:50:34,383 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:50:34,384 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 248 transitions, 4025 flow [2021-03-25 12:50:34,384 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 248 transitions, 4025 flow [2021-03-25 12:50:34,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 203 places, 248 transitions, 4025 flow [2021-03-25 12:50:35,174 INFO L129 PetriNetUnfolder]: 4380/8055 cut-off events. [2021-03-25 12:50:35,174 INFO L130 PetriNetUnfolder]: For 38275/38760 co-relation queries the response was YES. [2021-03-25 12:50:35,224 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22887 conditions, 8055 events. 4380/8055 cut-off events. For 38275/38760 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 64369 event pairs, 19 based on Foata normal form. 122/5648 useless extension candidates. Maximal degree in co-relation 22749. Up to 2048 conditions per place. [2021-03-25 12:50:35,290 INFO L142 LiptonReduction]: Number of co-enabled transitions 3442 [2021-03-25 12:50:35,299 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:50:35,299 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:50:35,299 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 916 [2021-03-25 12:50:35,300 INFO L480 AbstractCegarLoop]: Abstraction has has 203 places, 248 transitions, 4025 flow [2021-03-25 12:50:35,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 175.16666666666666) internal successors, (2102), 12 states have internal predecessors, (2102), 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) [2021-03-25 12:50:35,300 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:50:35,300 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:50:35,300 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-03-25 12:50:35,300 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:50:35,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:50:35,300 INFO L82 PathProgramCache]: Analyzing trace with hash -427201177, now seen corresponding path program 2 times [2021-03-25 12:50:35,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:50:35,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670253058] [2021-03-25 12:50:35,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:50:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:50:35,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:35,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:50:35,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:35,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:50:35,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:35,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:50:35,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:35,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:50:35,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:35,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:50:35,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:35,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:50:35,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:35,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:50:35,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:35,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:50:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:50:35,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670253058] [2021-03-25 12:50:35,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:50:35,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 12:50:35,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400157083] [2021-03-25 12:50:35,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 12:50:35,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:50:35,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 12:50:35,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 12:50:35,375 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 330 [2021-03-25 12:50:35,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 248 transitions, 4025 flow. Second operand has 9 states, 9 states have (on average 210.44444444444446) internal successors, (1894), 9 states have internal predecessors, (1894), 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) [2021-03-25 12:50:35,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:50:35,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 330 [2021-03-25 12:50:35,377 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:50:37,197 INFO L129 PetriNetUnfolder]: 9807/15284 cut-off events. [2021-03-25 12:50:37,197 INFO L130 PetriNetUnfolder]: For 199504/200658 co-relation queries the response was YES. [2021-03-25 12:50:37,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74074 conditions, 15284 events. 9807/15284 cut-off events. For 199504/200658 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 103633 event pairs, 572 based on Foata normal form. 436/12096 useless extension candidates. Maximal degree in co-relation 73712. Up to 4661 conditions per place. [2021-03-25 12:50:37,565 INFO L132 encePairwiseOnDemand]: 319/330 looper letters, 153 selfloop transitions, 88 changer transitions 5/310 dead transitions. [2021-03-25 12:50:37,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 310 transitions, 5218 flow [2021-03-25 12:50:37,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:50:37,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:50:37,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1961 transitions. [2021-03-25 12:50:37,567 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6602693602693602 [2021-03-25 12:50:37,567 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1961 transitions. [2021-03-25 12:50:37,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1961 transitions. [2021-03-25 12:50:37,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:50:37,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1961 transitions. [2021-03-25 12:50:37,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 217.88888888888889) internal successors, (1961), 9 states have internal predecessors, (1961), 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) [2021-03-25 12:50:37,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:50:37,571 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:50:37,571 INFO L185 Difference]: Start difference. First operand has 203 places, 248 transitions, 4025 flow. Second operand 9 states and 1961 transitions. [2021-03-25 12:50:37,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 310 transitions, 5218 flow [2021-03-25 12:50:37,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 310 transitions, 5086 flow, removed 27 selfloop flow, removed 8 redundant places. [2021-03-25 12:50:37,905 INFO L241 Difference]: Finished difference. Result has 208 places, 261 transitions, 4490 flow [2021-03-25 12:50:37,905 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=3902, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4490, PETRI_PLACES=208, PETRI_TRANSITIONS=261} [2021-03-25 12:50:37,905 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 145 predicate places. [2021-03-25 12:50:37,906 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:50:37,906 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 261 transitions, 4490 flow [2021-03-25 12:50:37,906 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 261 transitions, 4490 flow [2021-03-25 12:50:37,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 208 places, 261 transitions, 4490 flow [2021-03-25 12:50:38,508 INFO L129 PetriNetUnfolder]: 4310/7933 cut-off events. [2021-03-25 12:50:38,508 INFO L130 PetriNetUnfolder]: For 48654/49607 co-relation queries the response was YES. [2021-03-25 12:50:38,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24028 conditions, 7933 events. 4310/7933 cut-off events. For 48654/49607 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 63028 event pairs, 31 based on Foata normal form. 197/5569 useless extension candidates. Maximal degree in co-relation 23884. Up to 2034 conditions per place. [2021-03-25 12:50:38,649 INFO L142 LiptonReduction]: Number of co-enabled transitions 3658 [2021-03-25 12:50:38,660 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:50:38,660 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:50:38,660 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 754 [2021-03-25 12:50:38,661 INFO L480 AbstractCegarLoop]: Abstraction has has 208 places, 261 transitions, 4490 flow [2021-03-25 12:50:38,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 210.44444444444446) internal successors, (1894), 9 states have internal predecessors, (1894), 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) [2021-03-25 12:50:38,661 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:50:38,661 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:50:38,661 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-03-25 12:50:38,661 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:50:38,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:50:38,661 INFO L82 PathProgramCache]: Analyzing trace with hash -369916801, now seen corresponding path program 4 times [2021-03-25 12:50:38,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:50:38,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261553102] [2021-03-25 12:50:38,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:50:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:50:38,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:38,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 12:50:38,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:38,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 12:50:38,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:38,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 12:50:38,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:38,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 12:50:38,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:38,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:50:38,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:38,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:50:38,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:38,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:50:38,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:38,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:50:38,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:38,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:50:38,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:38,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:50:38,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:38,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:50:38,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:38,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:50:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:50:38,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261553102] [2021-03-25 12:50:38,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:50:38,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 12:50:38,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251890687] [2021-03-25 12:50:38,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 12:50:38,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:50:38,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 12:50:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-03-25 12:50:38,894 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 330 [2021-03-25 12:50:38,895 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 261 transitions, 4490 flow. Second operand has 12 states, 12 states have (on average 177.16666666666666) internal successors, (2126), 12 states have internal predecessors, (2126), 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) [2021-03-25 12:50:38,895 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:50:38,895 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 330 [2021-03-25 12:50:38,895 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:50:42,166 INFO L129 PetriNetUnfolder]: 15814/22929 cut-off events. [2021-03-25 12:50:42,166 INFO L130 PetriNetUnfolder]: For 355014/355502 co-relation queries the response was YES. [2021-03-25 12:50:42,304 INFO L84 FinitePrefix]: Finished finitePrefix Result has 118908 conditions, 22929 events. 15814/22929 cut-off events. For 355014/355502 co-relation queries the response was YES. Maximal size of possible extension queue 1170. Compared 143947 event pairs, 2792 based on Foata normal form. 243/17458 useless extension candidates. Maximal degree in co-relation 118467. Up to 15787 conditions per place. [2021-03-25 12:50:42,346 INFO L132 encePairwiseOnDemand]: 321/330 looper letters, 240 selfloop transitions, 41 changer transitions 12/338 dead transitions. [2021-03-25 12:50:42,346 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 338 transitions, 6327 flow [2021-03-25 12:50:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:50:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:50:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1312 transitions. [2021-03-25 12:50:42,348 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.567965367965368 [2021-03-25 12:50:42,348 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1312 transitions. [2021-03-25 12:50:42,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1312 transitions. [2021-03-25 12:50:42,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:50:42,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1312 transitions. [2021-03-25 12:50:42,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 187.42857142857142) internal successors, (1312), 7 states have internal predecessors, (1312), 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) [2021-03-25 12:50:42,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 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) [2021-03-25 12:50:42,351 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 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) [2021-03-25 12:50:42,351 INFO L185 Difference]: Start difference. First operand has 208 places, 261 transitions, 4490 flow. Second operand 7 states and 1312 transitions. [2021-03-25 12:50:42,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 338 transitions, 6327 flow [2021-03-25 12:50:43,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 338 transitions, 6252 flow, removed 12 selfloop flow, removed 3 redundant places. [2021-03-25 12:50:43,158 INFO L241 Difference]: Finished difference. Result has 214 places, 270 transitions, 4723 flow [2021-03-25 12:50:43,158 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=4431, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4723, PETRI_PLACES=214, PETRI_TRANSITIONS=270} [2021-03-25 12:50:43,158 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 151 predicate places. [2021-03-25 12:50:43,158 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:50:43,158 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 270 transitions, 4723 flow [2021-03-25 12:50:43,159 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 270 transitions, 4723 flow [2021-03-25 12:50:43,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 214 places, 270 transitions, 4723 flow [2021-03-25 12:50:43,882 INFO L129 PetriNetUnfolder]: 4257/7681 cut-off events. [2021-03-25 12:50:43,882 INFO L130 PetriNetUnfolder]: For 46144/46890 co-relation queries the response was YES. [2021-03-25 12:50:43,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23307 conditions, 7681 events. 4257/7681 cut-off events. For 46144/46890 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 59638 event pairs, 37 based on Foata normal form. 207/5332 useless extension candidates. Maximal degree in co-relation 23056. Up to 1994 conditions per place. [2021-03-25 12:50:44,002 INFO L142 LiptonReduction]: Number of co-enabled transitions 3782 [2021-03-25 12:50:44,014 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:50:44,014 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:50:44,014 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 856 [2021-03-25 12:50:44,014 INFO L480 AbstractCegarLoop]: Abstraction has has 214 places, 270 transitions, 4723 flow [2021-03-25 12:50:44,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 177.16666666666666) internal successors, (2126), 12 states have internal predecessors, (2126), 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) [2021-03-25 12:50:44,015 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:50:44,015 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:50:44,015 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-03-25 12:50:44,015 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:50:44,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:50:44,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1225693259, now seen corresponding path program 5 times [2021-03-25 12:50:44,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:50:44,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933658926] [2021-03-25 12:50:44,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:50:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:50:44,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:44,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:50:44,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:44,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 12:50:44,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:44,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:50:44,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:44,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:50:44,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:44,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:50:44,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:44,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:50:44,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:44,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:50:44,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:44,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:50:44,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:44,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:50:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:50:44,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933658926] [2021-03-25 12:50:44,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:50:44,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 12:50:44,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298859461] [2021-03-25 12:50:44,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 12:50:44,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:50:44,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 12:50:44,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-03-25 12:50:44,103 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 330 [2021-03-25 12:50:44,104 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 270 transitions, 4723 flow. Second operand has 10 states, 10 states have (on average 180.4) internal successors, (1804), 10 states have internal predecessors, (1804), 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) [2021-03-25 12:50:44,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:50:44,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 330 [2021-03-25 12:50:44,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:50:46,986 INFO L129 PetriNetUnfolder]: 14638/21396 cut-off events. [2021-03-25 12:50:46,987 INFO L130 PetriNetUnfolder]: For 335940/336288 co-relation queries the response was YES. [2021-03-25 12:50:47,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113342 conditions, 21396 events. 14638/21396 cut-off events. For 335940/336288 co-relation queries the response was YES. Maximal size of possible extension queue 1197. Compared 136710 event pairs, 3171 based on Foata normal form. 134/15998 useless extension candidates. Maximal degree in co-relation 112924. Up to 9780 conditions per place. [2021-03-25 12:50:47,183 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 249 selfloop transitions, 70 changer transitions 12/376 dead transitions. [2021-03-25 12:50:47,184 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 376 transitions, 6942 flow [2021-03-25 12:50:47,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:50:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:50:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1719 transitions. [2021-03-25 12:50:47,186 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5787878787878787 [2021-03-25 12:50:47,186 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1719 transitions. [2021-03-25 12:50:47,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1719 transitions. [2021-03-25 12:50:47,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:50:47,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1719 transitions. [2021-03-25 12:50:47,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 191.0) internal successors, (1719), 9 states have internal predecessors, (1719), 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) [2021-03-25 12:50:47,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:50:47,190 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:50:47,190 INFO L185 Difference]: Start difference. First operand has 214 places, 270 transitions, 4723 flow. Second operand 9 states and 1719 transitions. [2021-03-25 12:50:47,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 376 transitions, 6942 flow [2021-03-25 12:50:48,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 376 transitions, 6852 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-03-25 12:50:48,031 INFO L241 Difference]: Finished difference. Result has 223 places, 292 transitions, 5368 flow [2021-03-25 12:50:48,032 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=4647, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5368, PETRI_PLACES=223, PETRI_TRANSITIONS=292} [2021-03-25 12:50:48,032 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 160 predicate places. [2021-03-25 12:50:48,032 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:50:48,032 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 292 transitions, 5368 flow [2021-03-25 12:50:48,032 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 292 transitions, 5368 flow [2021-03-25 12:50:48,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 223 places, 292 transitions, 5368 flow [2021-03-25 12:50:48,661 INFO L129 PetriNetUnfolder]: 4610/8312 cut-off events. [2021-03-25 12:50:48,662 INFO L130 PetriNetUnfolder]: For 52073/52931 co-relation queries the response was YES. [2021-03-25 12:50:48,725 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25154 conditions, 8312 events. 4610/8312 cut-off events. For 52073/52931 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 65319 event pairs, 10 based on Foata normal form. 187/5683 useless extension candidates. Maximal degree in co-relation 24993. Up to 2196 conditions per place. [2021-03-25 12:50:48,804 INFO L142 LiptonReduction]: Number of co-enabled transitions 3926 [2021-03-25 12:50:48,816 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:50:48,816 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:50:48,817 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 785 [2021-03-25 12:50:48,817 INFO L480 AbstractCegarLoop]: Abstraction has has 223 places, 292 transitions, 5368 flow [2021-03-25 12:50:48,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 180.4) internal successors, (1804), 10 states have internal predecessors, (1804), 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) [2021-03-25 12:50:48,817 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:50:48,817 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:50:48,817 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-03-25 12:50:48,817 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:50:48,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:50:48,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1710503265, now seen corresponding path program 1 times [2021-03-25 12:50:48,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:50:48,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298696764] [2021-03-25 12:50:48,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:50:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:50:48,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:48,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:50:48,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:48,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 12:50:48,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:48,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 12:50:48,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:48,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 12:50:48,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:48,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:50:48,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:48,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 12:50:48,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:48,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 12:50:48,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:48,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:50:49,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:49,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:50:49,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:49,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:50:49,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:49,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:50:49,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:49,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:50:49,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:49,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:50:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:50:49,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298696764] [2021-03-25 12:50:49,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:50:49,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 12:50:49,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954474900] [2021-03-25 12:50:49,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 12:50:49,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:50:49,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 12:50:49,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-03-25 12:50:49,067 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 330 [2021-03-25 12:50:49,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 292 transitions, 5368 flow. Second operand has 12 states, 12 states have (on average 175.25) internal successors, (2103), 12 states have internal predecessors, (2103), 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) [2021-03-25 12:50:49,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:50:49,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 330 [2021-03-25 12:50:49,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:50:49,537 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2021-03-25 12:50:52,452 INFO L129 PetriNetUnfolder]: 14375/21128 cut-off events. [2021-03-25 12:50:52,452 INFO L130 PetriNetUnfolder]: For 344563/345251 co-relation queries the response was YES. [2021-03-25 12:50:52,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110555 conditions, 21128 events. 14375/21128 cut-off events. For 344563/345251 co-relation queries the response was YES. Maximal size of possible extension queue 1129. Compared 134721 event pairs, 2223 based on Foata normal form. 222/15818 useless extension candidates. Maximal degree in co-relation 110105. Up to 13966 conditions per place. [2021-03-25 12:50:52,637 INFO L132 encePairwiseOnDemand]: 317/330 looper letters, 236 selfloop transitions, 57 changer transitions 3/349 dead transitions. [2021-03-25 12:50:52,637 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 349 transitions, 6619 flow [2021-03-25 12:50:52,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 12:50:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 12:50:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2006 transitions. [2021-03-25 12:50:52,639 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5526170798898071 [2021-03-25 12:50:52,639 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2006 transitions. [2021-03-25 12:50:52,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2006 transitions. [2021-03-25 12:50:52,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:50:52,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2006 transitions. [2021-03-25 12:50:52,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 182.36363636363637) internal successors, (2006), 11 states have internal predecessors, (2006), 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) [2021-03-25 12:50:52,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 330.0) internal successors, (3960), 12 states have internal predecessors, (3960), 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) [2021-03-25 12:50:52,644 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 330.0) internal successors, (3960), 12 states have internal predecessors, (3960), 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) [2021-03-25 12:50:52,644 INFO L185 Difference]: Start difference. First operand has 223 places, 292 transitions, 5368 flow. Second operand 11 states and 2006 transitions. [2021-03-25 12:50:52,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 349 transitions, 6619 flow [2021-03-25 12:50:53,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 349 transitions, 6365 flow, removed 28 selfloop flow, removed 14 redundant places. [2021-03-25 12:50:53,222 INFO L241 Difference]: Finished difference. Result has 219 places, 278 transitions, 4969 flow [2021-03-25 12:50:53,222 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=4840, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4969, PETRI_PLACES=219, PETRI_TRANSITIONS=278} [2021-03-25 12:50:53,222 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 156 predicate places. [2021-03-25 12:50:53,223 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:50:53,223 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 278 transitions, 4969 flow [2021-03-25 12:50:53,223 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 278 transitions, 4969 flow [2021-03-25 12:50:53,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 219 places, 278 transitions, 4969 flow [2021-03-25 12:50:54,006 INFO L129 PetriNetUnfolder]: 4441/8015 cut-off events. [2021-03-25 12:50:54,007 INFO L130 PetriNetUnfolder]: For 48274/48904 co-relation queries the response was YES. [2021-03-25 12:50:54,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23349 conditions, 8015 events. 4441/8015 cut-off events. For 48274/48904 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 62657 event pairs, 18 based on Foata normal form. 148/5423 useless extension candidates. Maximal degree in co-relation 23081. Up to 2136 conditions per place. [2021-03-25 12:50:54,118 INFO L142 LiptonReduction]: Number of co-enabled transitions 3482 [2021-03-25 12:50:54,129 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:50:54,129 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:50:54,130 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 907 [2021-03-25 12:50:54,130 INFO L480 AbstractCegarLoop]: Abstraction has has 219 places, 278 transitions, 4969 flow [2021-03-25 12:50:54,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 175.25) internal successors, (2103), 12 states have internal predecessors, (2103), 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) [2021-03-25 12:50:54,130 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:50:54,130 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:50:54,130 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-03-25 12:50:54,131 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:50:54,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:50:54,131 INFO L82 PathProgramCache]: Analyzing trace with hash 726249076, now seen corresponding path program 1 times [2021-03-25 12:50:54,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:50:54,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969642339] [2021-03-25 12:50:54,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:50:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:50:54,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:54,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 12:50:54,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:54,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 12:50:54,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:54,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 12:50:54,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:54,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 12:50:54,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:54,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:50:54,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:54,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:50:54,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:54,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:50:54,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:54,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:50:54,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:54,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:50:54,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:54,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:50:54,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:54,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:50:54,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:50:54,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969642339] [2021-03-25 12:50:54,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:50:54,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 12:50:54,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411735074] [2021-03-25 12:50:54,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 12:50:54,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:50:54,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 12:50:54,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-03-25 12:50:54,295 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 330 [2021-03-25 12:50:54,296 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 278 transitions, 4969 flow. Second operand has 12 states, 12 states have (on average 177.25) internal successors, (2127), 12 states have internal predecessors, (2127), 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) [2021-03-25 12:50:54,297 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:50:54,297 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 330 [2021-03-25 12:50:54,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:50:56,989 INFO L129 PetriNetUnfolder]: 13174/19418 cut-off events. [2021-03-25 12:50:56,989 INFO L130 PetriNetUnfolder]: For 333043/333276 co-relation queries the response was YES. [2021-03-25 12:50:57,093 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99393 conditions, 19418 events. 13174/19418 cut-off events. For 333043/333276 co-relation queries the response was YES. Maximal size of possible extension queue 1045. Compared 122770 event pairs, 2720 based on Foata normal form. 320/14659 useless extension candidates. Maximal degree in co-relation 98950. Up to 8725 conditions per place. [2021-03-25 12:50:57,132 INFO L132 encePairwiseOnDemand]: 322/330 looper letters, 189 selfloop transitions, 101 changer transitions 20/355 dead transitions. [2021-03-25 12:50:57,132 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 355 transitions, 6622 flow [2021-03-25 12:50:57,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:50:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:50:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1686 transitions. [2021-03-25 12:50:57,133 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5676767676767677 [2021-03-25 12:50:57,133 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1686 transitions. [2021-03-25 12:50:57,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1686 transitions. [2021-03-25 12:50:57,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:50:57,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1686 transitions. [2021-03-25 12:50:57,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 187.33333333333334) internal successors, (1686), 9 states have internal predecessors, (1686), 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) [2021-03-25 12:50:57,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:50:57,137 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:50:57,137 INFO L185 Difference]: Start difference. First operand has 219 places, 278 transitions, 4969 flow. Second operand 9 states and 1686 transitions. [2021-03-25 12:50:57,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 355 transitions, 6622 flow [2021-03-25 12:50:57,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 355 transitions, 6310 flow, removed 28 selfloop flow, removed 13 redundant places. [2021-03-25 12:50:57,702 INFO L241 Difference]: Finished difference. Result has 217 places, 259 transitions, 4630 flow [2021-03-25 12:50:57,702 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=4304, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4630, PETRI_PLACES=217, PETRI_TRANSITIONS=259} [2021-03-25 12:50:57,702 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 154 predicate places. [2021-03-25 12:50:57,702 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:50:57,702 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 259 transitions, 4630 flow [2021-03-25 12:50:57,703 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 259 transitions, 4630 flow [2021-03-25 12:50:57,704 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 217 places, 259 transitions, 4630 flow [2021-03-25 12:50:58,450 INFO L129 PetriNetUnfolder]: 4303/7795 cut-off events. [2021-03-25 12:50:58,451 INFO L130 PetriNetUnfolder]: For 43923/44448 co-relation queries the response was YES. [2021-03-25 12:50:58,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21531 conditions, 7795 events. 4303/7795 cut-off events. For 43923/44448 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 61068 event pairs, 9 based on Foata normal form. 78/5183 useless extension candidates. Maximal degree in co-relation 21289. Up to 2110 conditions per place. [2021-03-25 12:50:58,554 INFO L142 LiptonReduction]: Number of co-enabled transitions 3072 [2021-03-25 12:50:58,564 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:50:58,564 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:50:58,564 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 862 [2021-03-25 12:50:58,565 INFO L480 AbstractCegarLoop]: Abstraction has has 217 places, 259 transitions, 4630 flow [2021-03-25 12:50:58,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 177.25) internal successors, (2127), 12 states have internal predecessors, (2127), 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) [2021-03-25 12:50:58,565 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:50:58,565 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:50:58,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-03-25 12:50:58,565 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:50:58,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:50:58,566 INFO L82 PathProgramCache]: Analyzing trace with hash 363151152, now seen corresponding path program 1 times [2021-03-25 12:50:58,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:50:58,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234436508] [2021-03-25 12:50:58,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:50:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:50:58,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:58,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:50:58,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:58,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 12:50:58,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:58,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 12:50:58,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:58,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 12:50:58,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:58,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:50:58,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:58,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:50:58,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:58,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:50:58,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:58,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:50:58,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:58,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:50:58,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:58,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:50:58,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:58,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:50:58,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:58,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:50:58,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:50:58,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:50:58,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:50:58,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234436508] [2021-03-25 12:50:58,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:50:58,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 12:50:58,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757662398] [2021-03-25 12:50:58,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 12:50:58,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:50:58,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 12:50:58,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-03-25 12:50:58,780 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 330 [2021-03-25 12:50:58,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 259 transitions, 4630 flow. Second operand has 12 states, 12 states have (on average 175.25) internal successors, (2103), 12 states have internal predecessors, (2103), 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) [2021-03-25 12:50:58,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:50:58,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 330 [2021-03-25 12:50:58,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:51:01,594 INFO L129 PetriNetUnfolder]: 12079/17972 cut-off events. [2021-03-25 12:51:01,594 INFO L130 PetriNetUnfolder]: For 303398/303594 co-relation queries the response was YES. [2021-03-25 12:51:01,685 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90350 conditions, 17972 events. 12079/17972 cut-off events. For 303398/303594 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 114893 event pairs, 2127 based on Foata normal form. 121/13403 useless extension candidates. Maximal degree in co-relation 89869. Up to 11940 conditions per place. [2021-03-25 12:51:01,721 INFO L132 encePairwiseOnDemand]: 317/330 looper letters, 198 selfloop transitions, 60 changer transitions 3/306 dead transitions. [2021-03-25 12:51:01,721 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 306 transitions, 5717 flow [2021-03-25 12:51:01,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 12:51:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 12:51:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1997 transitions. [2021-03-25 12:51:01,723 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.550137741046832 [2021-03-25 12:51:01,723 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1997 transitions. [2021-03-25 12:51:01,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1997 transitions. [2021-03-25 12:51:01,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:51:01,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1997 transitions. [2021-03-25 12:51:01,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 181.54545454545453) internal successors, (1997), 11 states have internal predecessors, (1997), 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) [2021-03-25 12:51:01,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 330.0) internal successors, (3960), 12 states have internal predecessors, (3960), 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) [2021-03-25 12:51:01,727 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 330.0) internal successors, (3960), 12 states have internal predecessors, (3960), 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) [2021-03-25 12:51:01,727 INFO L185 Difference]: Start difference. First operand has 217 places, 259 transitions, 4630 flow. Second operand 11 states and 1997 transitions. [2021-03-25 12:51:01,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 306 transitions, 5717 flow [2021-03-25 12:51:02,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 306 transitions, 5424 flow, removed 25 selfloop flow, removed 14 redundant places. [2021-03-25 12:51:02,194 INFO L241 Difference]: Finished difference. Result has 212 places, 245 transitions, 4262 flow [2021-03-25 12:51:02,194 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=4142, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4262, PETRI_PLACES=212, PETRI_TRANSITIONS=245} [2021-03-25 12:51:02,195 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 149 predicate places. [2021-03-25 12:51:02,195 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:51:02,195 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 245 transitions, 4262 flow [2021-03-25 12:51:02,195 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 212 places, 245 transitions, 4262 flow [2021-03-25 12:51:02,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 212 places, 245 transitions, 4262 flow [2021-03-25 12:51:02,892 INFO L129 PetriNetUnfolder]: 4147/7508 cut-off events. [2021-03-25 12:51:02,892 INFO L130 PetriNetUnfolder]: For 40958/41751 co-relation queries the response was YES. [2021-03-25 12:51:02,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20040 conditions, 7508 events. 4147/7508 cut-off events. For 40958/41751 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 58056 event pairs, 14 based on Foata normal form. 107/5079 useless extension candidates. Maximal degree in co-relation 19911. Up to 2036 conditions per place. [2021-03-25 12:51:02,977 INFO L142 LiptonReduction]: Number of co-enabled transitions 2566 [2021-03-25 12:51:03,180 INFO L154 LiptonReduction]: Checked pairs total: 377 [2021-03-25 12:51:03,180 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:51:03,181 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 986 [2021-03-25 12:51:03,181 INFO L480 AbstractCegarLoop]: Abstraction has has 212 places, 245 transitions, 4262 flow [2021-03-25 12:51:03,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 175.25) internal successors, (2103), 12 states have internal predecessors, (2103), 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) [2021-03-25 12:51:03,181 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:51:03,181 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:51:03,182 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-03-25 12:51:03,182 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:51:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:51:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash 487627517, now seen corresponding path program 1 times [2021-03-25 12:51:03,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:51:03,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200224580] [2021-03-25 12:51:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:51:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:51:03,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:03,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:51:03,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:03,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 12:51:03,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:03,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:51:03,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:03,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:51:03,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:03,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:51:03,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:51:03,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200224580] [2021-03-25 12:51:03,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:51:03,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 12:51:03,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847031436] [2021-03-25 12:51:03,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 12:51:03,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:51:03,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 12:51:03,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 12:51:03,219 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 330 [2021-03-25 12:51:03,219 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 245 transitions, 4262 flow. Second operand has 6 states, 6 states have (on average 184.5) internal successors, (1107), 6 states have internal predecessors, (1107), 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) [2021-03-25 12:51:03,219 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:51:03,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 330 [2021-03-25 12:51:03,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:51:05,157 INFO L129 PetriNetUnfolder]: 10649/16291 cut-off events. [2021-03-25 12:51:05,157 INFO L130 PetriNetUnfolder]: For 273883/274269 co-relation queries the response was YES. [2021-03-25 12:51:05,255 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80621 conditions, 16291 events. 10649/16291 cut-off events. For 273883/274269 co-relation queries the response was YES. Maximal size of possible extension queue 923. Compared 107870 event pairs, 2438 based on Foata normal form. 234/12369 useless extension candidates. Maximal degree in co-relation 80267. Up to 10169 conditions per place. [2021-03-25 12:51:05,289 INFO L132 encePairwiseOnDemand]: 322/330 looper letters, 221 selfloop transitions, 14 changer transitions 7/298 dead transitions. [2021-03-25 12:51:05,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 298 transitions, 5527 flow [2021-03-25 12:51:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 12:51:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 12:51:05,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1524 transitions. [2021-03-25 12:51:05,291 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5772727272727273 [2021-03-25 12:51:05,291 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1524 transitions. [2021-03-25 12:51:05,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1524 transitions. [2021-03-25 12:51:05,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:51:05,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1524 transitions. [2021-03-25 12:51:05,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 190.5) internal successors, (1524), 8 states have internal predecessors, (1524), 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) [2021-03-25 12:51:05,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 330.0) internal successors, (2970), 9 states have internal predecessors, (2970), 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) [2021-03-25 12:51:05,294 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 330.0) internal successors, (2970), 9 states have internal predecessors, (2970), 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) [2021-03-25 12:51:05,294 INFO L185 Difference]: Start difference. First operand has 212 places, 245 transitions, 4262 flow. Second operand 8 states and 1524 transitions. [2021-03-25 12:51:05,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 298 transitions, 5527 flow [2021-03-25 12:51:05,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 298 transitions, 5353 flow, removed 18 selfloop flow, removed 13 redundant places. [2021-03-25 12:51:05,855 INFO L241 Difference]: Finished difference. Result has 208 places, 240 transitions, 4019 flow [2021-03-25 12:51:05,855 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=4014, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4019, PETRI_PLACES=208, PETRI_TRANSITIONS=240} [2021-03-25 12:51:05,855 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 145 predicate places. [2021-03-25 12:51:05,855 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:51:05,855 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 240 transitions, 4019 flow [2021-03-25 12:51:05,855 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 240 transitions, 4019 flow [2021-03-25 12:51:05,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 208 places, 240 transitions, 4019 flow [2021-03-25 12:51:06,318 INFO L129 PetriNetUnfolder]: 4052/7382 cut-off events. [2021-03-25 12:51:06,318 INFO L130 PetriNetUnfolder]: For 34737/35451 co-relation queries the response was YES. [2021-03-25 12:51:06,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19076 conditions, 7382 events. 4052/7382 cut-off events. For 34737/35451 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 57454 event pairs, 17 based on Foata normal form. 72/4876 useless extension candidates. Maximal degree in co-relation 18874. Up to 2036 conditions per place. [2021-03-25 12:51:06,432 INFO L142 LiptonReduction]: Number of co-enabled transitions 2310 [2021-03-25 12:51:06,539 INFO L154 LiptonReduction]: Checked pairs total: 305 [2021-03-25 12:51:06,539 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:51:06,539 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 684 [2021-03-25 12:51:06,539 INFO L480 AbstractCegarLoop]: Abstraction has has 208 places, 240 transitions, 4019 flow [2021-03-25 12:51:06,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 184.5) internal successors, (1107), 6 states have internal predecessors, (1107), 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) [2021-03-25 12:51:06,540 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:51:06,540 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:51:06,540 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-03-25 12:51:06,540 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:51:06,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:51:06,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1269875945, now seen corresponding path program 2 times [2021-03-25 12:51:06,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:51:06,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952781527] [2021-03-25 12:51:06,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:51:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:51:06,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:06,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:51:06,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:06,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:51:06,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:06,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:51:06,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:06,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 12:51:06,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:06,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:51:06,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:06,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:51:06,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:06,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:51:06,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:51:06,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952781527] [2021-03-25 12:51:06,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:51:06,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 12:51:06,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329740195] [2021-03-25 12:51:06,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 12:51:06,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:51:06,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 12:51:06,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-25 12:51:06,613 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 330 [2021-03-25 12:51:06,613 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 240 transitions, 4019 flow. Second operand has 8 states, 8 states have (on average 182.875) internal successors, (1463), 8 states have internal predecessors, (1463), 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) [2021-03-25 12:51:06,613 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:51:06,613 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 330 [2021-03-25 12:51:06,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:51:08,720 INFO L129 PetriNetUnfolder]: 10230/15763 cut-off events. [2021-03-25 12:51:08,720 INFO L130 PetriNetUnfolder]: For 251217/251619 co-relation queries the response was YES. [2021-03-25 12:51:08,791 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77574 conditions, 15763 events. 10230/15763 cut-off events. For 251217/251619 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 104987 event pairs, 2280 based on Foata normal form. 187/11934 useless extension candidates. Maximal degree in co-relation 77486. Up to 8604 conditions per place. [2021-03-25 12:51:08,828 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 207 selfloop transitions, 27 changer transitions 4/294 dead transitions. [2021-03-25 12:51:08,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 294 transitions, 5281 flow [2021-03-25 12:51:08,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 12:51:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 12:51:08,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1883 transitions. [2021-03-25 12:51:08,830 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5706060606060606 [2021-03-25 12:51:08,830 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1883 transitions. [2021-03-25 12:51:08,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1883 transitions. [2021-03-25 12:51:08,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:51:08,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1883 transitions. [2021-03-25 12:51:08,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 188.3) internal successors, (1883), 10 states have internal predecessors, (1883), 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) [2021-03-25 12:51:08,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 330.0) internal successors, (3630), 11 states have internal predecessors, (3630), 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) [2021-03-25 12:51:08,834 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 330.0) internal successors, (3630), 11 states have internal predecessors, (3630), 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) [2021-03-25 12:51:08,834 INFO L185 Difference]: Start difference. First operand has 208 places, 240 transitions, 4019 flow. Second operand 10 states and 1883 transitions. [2021-03-25 12:51:08,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 294 transitions, 5281 flow [2021-03-25 12:51:09,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 294 transitions, 5247 flow, removed 3 selfloop flow, removed 6 redundant places. [2021-03-25 12:51:09,119 INFO L241 Difference]: Finished difference. Result has 213 places, 239 transitions, 4014 flow [2021-03-25 12:51:09,119 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=3934, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4014, PETRI_PLACES=213, PETRI_TRANSITIONS=239} [2021-03-25 12:51:09,119 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 150 predicate places. [2021-03-25 12:51:09,120 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:51:09,120 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 239 transitions, 4014 flow [2021-03-25 12:51:09,120 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 239 transitions, 4014 flow [2021-03-25 12:51:09,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 213 places, 239 transitions, 4014 flow [2021-03-25 12:51:09,345 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1164-2-->ULTIMATE.startEXIT: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (store |v_#valid_174| |v_ULTIMATE.start_main_~#t~0.base_30| 0) |v_#valid_173|) (not (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) (= |v_ULTIMATE.start_main_#res_20| 0) (= |v_ULTIMATE.start_main_#res_20| |v_ULTIMATE.start_#t~ret20_8|)) InVars {#valid=|v_#valid_174|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_173|, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_27|, ULTIMATE.start_#t~ret20=|v_ULTIMATE.start_#t~ret20_8|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_29|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_23|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem19, ULTIMATE.start_#t~ret20, ULTIMATE.start_main_~#t~0.base, ULTIMATE.start_main_~#t~0.offset][186], [Black: 762#(and (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= |thread0Thread1of1ForFork4_~#t5~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |thread0Thread1of1ForFork4_~#t5~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |thread0Thread1of1ForFork4_~#t5~0.offset| |ULTIMATE.start_main_~#t~0.offset|)) (or (not (= |thread0Thread1of1ForFork4_~#t5~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (= |thread0Thread1of1ForFork4_~#t5~0.base| |ULTIMATE.start_main_~#t~0.base|) (and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 764#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 634#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 893#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 262#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 515#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (and (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 88))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|))), Black: 519#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (and (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 88))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|))), Black: 647#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 509#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 527#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (and (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 88))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|))), Black: 780#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 782#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 278#(= |ULTIMATE.start_main_#t~mem18| 5), 35#thread2EXITtrue, 291#true, Black: 419#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 666#(or (= |ULTIMATE.start_main_#t~mem18| 5) (= |ULTIMATE.start_main_#t~mem18| 1)), 45#thread2EXITtrue, Black: 933#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 942#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork2_thidvar0))), 946#true, Black: 814#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= thread2Thread1of1ForFork1_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 821#true, Black: 305#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 307#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 298#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 438#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), Black: 303#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 178#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), 575#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), Black: 182#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 571#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 690#(or (= |ULTIMATE.start_main_#t~mem18| 2) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 573#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 965#(and (or (= |ULTIMATE.start_main_#t~mem18| 5) (= |ULTIMATE.start_main_#t~mem18| 1)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork2_thidvar0))), Black: 952#(or (= |ULTIMATE.start_main_#t~mem18| 5) (= |ULTIMATE.start_main_#t~mem18| 1)), Black: 834#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 836#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 838#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 77#ULTIMATE.startEXITtrue, Black: 840#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 198#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 328#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 829#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 203#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 724#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 720#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 598#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 215#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 718#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 219#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 224#true, Black: 226#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 353#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 227#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)), Black: 355#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 345#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 490#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 120#L1152-2true, 121#thread3ENTRYtrue, Black: 239#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 756#(and (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= |thread0Thread1of1ForFork4_~#t5~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |thread0Thread1of1ForFork4_~#t5~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |thread0Thread1of1ForFork4_~#t5~0.offset| |ULTIMATE.start_main_~#t~0.offset|)) (or (not (= |thread0Thread1of1ForFork4_~#t5~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (= |thread0Thread1of1ForFork4_~#t5~0.base| |ULTIMATE.start_main_~#t~0.base|) (and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)))) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |thread0Thread1of1ForFork4_~#t5~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 374#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 760#(and (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= |thread0Thread1of1ForFork4_~#t5~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |thread0Thread1of1ForFork4_~#t5~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |thread0Thread1of1ForFork4_~#t5~0.offset| |ULTIMATE.start_main_~#t~0.offset|)) (or (not (= |thread0Thread1of1ForFork4_~#t5~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (= |thread0Thread1of1ForFork4_~#t5~0.base| |ULTIMATE.start_main_~#t~0.base|) (and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)))) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|))), Black: 376#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset)))]) [2021-03-25 12:51:09,345 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-25 12:51:09,345 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 12:51:09,346 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 12:51:09,346 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 12:51:09,589 INFO L129 PetriNetUnfolder]: 4043/7374 cut-off events. [2021-03-25 12:51:09,589 INFO L130 PetriNetUnfolder]: For 33035/33721 co-relation queries the response was YES. [2021-03-25 12:51:09,634 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19045 conditions, 7374 events. 4043/7374 cut-off events. For 33035/33721 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 57631 event pairs, 19 based on Foata normal form. 71/4876 useless extension candidates. Maximal degree in co-relation 18957. Up to 2048 conditions per place. [2021-03-25 12:51:09,700 INFO L142 LiptonReduction]: Number of co-enabled transitions 2146 [2021-03-25 12:51:09,830 INFO L154 LiptonReduction]: Checked pairs total: 281 [2021-03-25 12:51:09,830 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:51:09,830 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 710 [2021-03-25 12:51:09,831 INFO L480 AbstractCegarLoop]: Abstraction has has 213 places, 239 transitions, 4014 flow [2021-03-25 12:51:09,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 182.875) internal successors, (1463), 8 states have internal predecessors, (1463), 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) [2021-03-25 12:51:09,831 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:51:09,831 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:51:09,831 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-03-25 12:51:09,831 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:51:09,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:51:09,832 INFO L82 PathProgramCache]: Analyzing trace with hash -240802259, now seen corresponding path program 3 times [2021-03-25 12:51:09,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:51:09,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522674814] [2021-03-25 12:51:09,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:51:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:51:09,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:09,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:51:09,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:09,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:51:09,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:09,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:51:09,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:09,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:51:09,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:09,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 12:51:09,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:09,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:51:09,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:09,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:51:10,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:10,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:51:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:51:10,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522674814] [2021-03-25 12:51:10,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:51:10,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 12:51:10,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645329537] [2021-03-25 12:51:10,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 12:51:10,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:51:10,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 12:51:10,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-25 12:51:10,098 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 330 [2021-03-25 12:51:10,099 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 239 transitions, 4014 flow. Second operand has 9 states, 9 states have (on average 181.66666666666666) internal successors, (1635), 9 states have internal predecessors, (1635), 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) [2021-03-25 12:51:10,099 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:51:10,099 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 330 [2021-03-25 12:51:10,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:51:12,157 INFO L129 PetriNetUnfolder]: 9845/15275 cut-off events. [2021-03-25 12:51:12,157 INFO L130 PetriNetUnfolder]: For 231732/232136 co-relation queries the response was YES. [2021-03-25 12:51:12,236 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75080 conditions, 15275 events. 9845/15275 cut-off events. For 231732/232136 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 102287 event pairs, 2136 based on Foata normal form. 189/11590 useless extension candidates. Maximal degree in co-relation 74987. Up to 8140 conditions per place. [2021-03-25 12:51:12,272 INFO L132 encePairwiseOnDemand]: 319/330 looper letters, 191 selfloop transitions, 44 changer transitions 4/295 dead transitions. [2021-03-25 12:51:12,272 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 295 transitions, 5288 flow [2021-03-25 12:51:12,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-25 12:51:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-25 12:51:12,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2238 transitions. [2021-03-25 12:51:12,274 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5651515151515152 [2021-03-25 12:51:12,274 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2238 transitions. [2021-03-25 12:51:12,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2238 transitions. [2021-03-25 12:51:12,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:51:12,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2238 transitions. [2021-03-25 12:51:12,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 186.5) internal successors, (2238), 12 states have internal predecessors, (2238), 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) [2021-03-25 12:51:12,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 330.0) internal successors, (4290), 13 states have internal predecessors, (4290), 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) [2021-03-25 12:51:12,279 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 330.0) internal successors, (4290), 13 states have internal predecessors, (4290), 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) [2021-03-25 12:51:12,279 INFO L185 Difference]: Start difference. First operand has 213 places, 239 transitions, 4014 flow. Second operand 12 states and 2238 transitions. [2021-03-25 12:51:12,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 295 transitions, 5288 flow [2021-03-25 12:51:12,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 295 transitions, 5230 flow, removed 2 selfloop flow, removed 9 redundant places. [2021-03-25 12:51:12,575 INFO L241 Difference]: Finished difference. Result has 217 places, 237 transitions, 3985 flow [2021-03-25 12:51:12,575 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=3866, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3985, PETRI_PLACES=217, PETRI_TRANSITIONS=237} [2021-03-25 12:51:12,575 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 154 predicate places. [2021-03-25 12:51:12,575 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:51:12,575 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 237 transitions, 3985 flow [2021-03-25 12:51:12,575 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 237 transitions, 3985 flow [2021-03-25 12:51:12,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 217 places, 237 transitions, 3985 flow [2021-03-25 12:51:13,293 INFO L129 PetriNetUnfolder]: 4015/7339 cut-off events. [2021-03-25 12:51:13,293 INFO L130 PetriNetUnfolder]: For 32742/33536 co-relation queries the response was YES. [2021-03-25 12:51:13,330 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18920 conditions, 7339 events. 4015/7339 cut-off events. For 32742/33536 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 57531 event pairs, 17 based on Foata normal form. 96/4863 useless extension candidates. Maximal degree in co-relation 18832. Up to 2048 conditions per place. [2021-03-25 12:51:13,383 INFO L142 LiptonReduction]: Number of co-enabled transitions 1978 [2021-03-25 12:51:13,479 INFO L154 LiptonReduction]: Checked pairs total: 233 [2021-03-25 12:51:13,479 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:51:13,479 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 904 [2021-03-25 12:51:13,480 INFO L480 AbstractCegarLoop]: Abstraction has has 217 places, 237 transitions, 3985 flow [2021-03-25 12:51:13,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 181.66666666666666) internal successors, (1635), 9 states have internal predecessors, (1635), 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) [2021-03-25 12:51:13,480 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:51:13,480 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:51:13,480 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-03-25 12:51:13,480 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:51:13,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:51:13,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1311261863, now seen corresponding path program 4 times [2021-03-25 12:51:13,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:51:13,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94055904] [2021-03-25 12:51:13,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:51:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:51:13,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:13,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:51:13,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:13,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:51:13,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:13,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:51:13,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:13,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:51:13,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:13,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:51:13,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:13,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 12:51:13,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:13,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:51:13,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:13,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:51:13,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:13,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:51:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:51:13,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94055904] [2021-03-25 12:51:13,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:51:13,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 12:51:13,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227263785] [2021-03-25 12:51:13,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 12:51:13,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:51:13,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 12:51:13,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-25 12:51:13,600 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 330 [2021-03-25 12:51:13,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 237 transitions, 3985 flow. Second operand has 10 states, 10 states have (on average 180.5) internal successors, (1805), 10 states have internal predecessors, (1805), 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) [2021-03-25 12:51:13,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:51:13,601 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 330 [2021-03-25 12:51:13,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:51:15,669 INFO L129 PetriNetUnfolder]: 9449/14773 cut-off events. [2021-03-25 12:51:15,669 INFO L130 PetriNetUnfolder]: For 221191/221567 co-relation queries the response was YES. [2021-03-25 12:51:15,768 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71899 conditions, 14773 events. 9449/14773 cut-off events. For 221191/221567 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 99521 event pairs, 1977 based on Foata normal form. 192/11234 useless extension candidates. Maximal degree in co-relation 71806. Up to 7647 conditions per place. [2021-03-25 12:51:15,803 INFO L132 encePairwiseOnDemand]: 318/330 looper letters, 178 selfloop transitions, 54 changer transitions 4/292 dead transitions. [2021-03-25 12:51:15,803 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 292 transitions, 5266 flow [2021-03-25 12:51:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-25 12:51:15,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-25 12:51:15,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2230 transitions. [2021-03-25 12:51:15,805 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5631313131313131 [2021-03-25 12:51:15,805 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2230 transitions. [2021-03-25 12:51:15,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2230 transitions. [2021-03-25 12:51:15,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:51:15,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2230 transitions. [2021-03-25 12:51:15,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 185.83333333333334) internal successors, (2230), 12 states have internal predecessors, (2230), 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) [2021-03-25 12:51:15,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 330.0) internal successors, (4290), 13 states have internal predecessors, (4290), 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) [2021-03-25 12:51:15,809 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 330.0) internal successors, (4290), 13 states have internal predecessors, (4290), 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) [2021-03-25 12:51:15,809 INFO L185 Difference]: Start difference. First operand has 217 places, 237 transitions, 3985 flow. Second operand 12 states and 2230 transitions. [2021-03-25 12:51:15,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 292 transitions, 5266 flow [2021-03-25 12:51:16,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 292 transitions, 5185 flow, removed 0 selfloop flow, removed 10 redundant places. [2021-03-25 12:51:16,339 INFO L241 Difference]: Finished difference. Result has 220 places, 238 transitions, 4049 flow [2021-03-25 12:51:16,339 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=3814, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4049, PETRI_PLACES=220, PETRI_TRANSITIONS=238} [2021-03-25 12:51:16,339 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 157 predicate places. [2021-03-25 12:51:16,340 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:51:16,340 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 238 transitions, 4049 flow [2021-03-25 12:51:16,340 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 238 transitions, 4049 flow [2021-03-25 12:51:16,341 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 220 places, 238 transitions, 4049 flow [2021-03-25 12:51:16,810 INFO L129 PetriNetUnfolder]: 3994/7314 cut-off events. [2021-03-25 12:51:16,810 INFO L130 PetriNetUnfolder]: For 32815/33575 co-relation queries the response was YES. [2021-03-25 12:51:16,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19000 conditions, 7314 events. 3994/7314 cut-off events. For 32815/33575 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 57328 event pairs, 19 based on Foata normal form. 92/4836 useless extension candidates. Maximal degree in co-relation 18909. Up to 2048 conditions per place. [2021-03-25 12:51:16,923 INFO L142 LiptonReduction]: Number of co-enabled transitions 1810 [2021-03-25 12:51:16,989 INFO L154 LiptonReduction]: Checked pairs total: 185 [2021-03-25 12:51:16,990 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:51:16,990 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 650 [2021-03-25 12:51:16,990 INFO L480 AbstractCegarLoop]: Abstraction has has 220 places, 238 transitions, 4049 flow [2021-03-25 12:51:16,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 180.5) internal successors, (1805), 10 states have internal predecessors, (1805), 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) [2021-03-25 12:51:16,991 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:51:16,991 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:51:16,991 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-03-25 12:51:16,991 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:51:16,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:51:16,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1399198597, now seen corresponding path program 5 times [2021-03-25 12:51:16,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:51:16,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301544741] [2021-03-25 12:51:16,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:51:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:51:17,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:17,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:51:17,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:17,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 12:51:17,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:17,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 12:51:17,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:17,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:51:17,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:17,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:51:17,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:17,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:51:17,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:17,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:51:17,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:17,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:51:17,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:17,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:51:17,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:17,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:51:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:51:17,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301544741] [2021-03-25 12:51:17,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:51:17,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 12:51:17,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013160032] [2021-03-25 12:51:17,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 12:51:17,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:51:17,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 12:51:17,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-03-25 12:51:17,095 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 330 [2021-03-25 12:51:17,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 238 transitions, 4049 flow. Second operand has 11 states, 11 states have (on average 178.36363636363637) internal successors, (1962), 11 states have internal predecessors, (1962), 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) [2021-03-25 12:51:17,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:51:17,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 330 [2021-03-25 12:51:17,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:51:19,359 INFO L129 PetriNetUnfolder]: 10334/16133 cut-off events. [2021-03-25 12:51:19,359 INFO L130 PetriNetUnfolder]: For 250182/250523 co-relation queries the response was YES. [2021-03-25 12:51:19,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79922 conditions, 16133 events. 10334/16133 cut-off events. For 250182/250523 co-relation queries the response was YES. Maximal size of possible extension queue 911. Compared 109902 event pairs, 1878 based on Foata normal form. 118/12178 useless extension candidates. Maximal degree in co-relation 79826. Up to 5666 conditions per place. [2021-03-25 12:51:19,466 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 202 selfloop transitions, 70 changer transitions 6/334 dead transitions. [2021-03-25 12:51:19,466 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 334 transitions, 5901 flow [2021-03-25 12:51:19,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:51:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:51:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1699 transitions. [2021-03-25 12:51:19,468 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.572053872053872 [2021-03-25 12:51:19,468 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1699 transitions. [2021-03-25 12:51:19,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1699 transitions. [2021-03-25 12:51:19,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:51:19,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1699 transitions. [2021-03-25 12:51:19,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 188.77777777777777) internal successors, (1699), 9 states have internal predecessors, (1699), 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) [2021-03-25 12:51:19,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:51:19,471 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:51:19,471 INFO L185 Difference]: Start difference. First operand has 220 places, 238 transitions, 4049 flow. Second operand 9 states and 1699 transitions. [2021-03-25 12:51:19,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 334 transitions, 5901 flow [2021-03-25 12:51:19,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 334 transitions, 5821 flow, removed 8 selfloop flow, removed 6 redundant places. [2021-03-25 12:51:19,821 INFO L241 Difference]: Finished difference. Result has 227 places, 257 transitions, 4621 flow [2021-03-25 12:51:19,821 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=3969, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4621, PETRI_PLACES=227, PETRI_TRANSITIONS=257} [2021-03-25 12:51:19,821 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 164 predicate places. [2021-03-25 12:51:19,821 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:51:19,821 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 257 transitions, 4621 flow [2021-03-25 12:51:19,822 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 227 places, 257 transitions, 4621 flow [2021-03-25 12:51:19,823 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 227 places, 257 transitions, 4621 flow [2021-03-25 12:51:20,610 INFO L129 PetriNetUnfolder]: 4428/8139 cut-off events. [2021-03-25 12:51:20,610 INFO L130 PetriNetUnfolder]: For 45516/46255 co-relation queries the response was YES. [2021-03-25 12:51:20,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21677 conditions, 8139 events. 4428/8139 cut-off events. For 45516/46255 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 65286 event pairs, 30 based on Foata normal form. 125/5456 useless extension candidates. Maximal degree in co-relation 21579. Up to 2292 conditions per place. [2021-03-25 12:51:20,705 INFO L142 LiptonReduction]: Number of co-enabled transitions 1974 [2021-03-25 12:51:20,784 INFO L154 LiptonReduction]: Checked pairs total: 209 [2021-03-25 12:51:20,785 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:51:20,785 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 964 [2021-03-25 12:51:20,785 INFO L480 AbstractCegarLoop]: Abstraction has has 227 places, 257 transitions, 4621 flow [2021-03-25 12:51:20,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 178.36363636363637) internal successors, (1962), 11 states have internal predecessors, (1962), 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) [2021-03-25 12:51:20,785 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:51:20,785 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:51:20,785 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-03-25 12:51:20,785 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:51:20,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:51:20,786 INFO L82 PathProgramCache]: Analyzing trace with hash -924061497, now seen corresponding path program 6 times [2021-03-25 12:51:20,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:51:20,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100218847] [2021-03-25 12:51:20,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:51:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:51:20,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:20,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:51:20,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:20,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 12:51:20,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:20,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 12:51:20,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:20,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 12:51:20,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:20,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:51:20,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:20,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:51:20,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:20,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:51:20,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:20,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:51:20,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:20,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:51:20,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:20,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:51:21,000 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-03-25 12:51:21,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:51:21,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:21,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:51:21,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:21,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:51:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:51:21,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100218847] [2021-03-25 12:51:21,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:51:21,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-25 12:51:21,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230755956] [2021-03-25 12:51:21,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-25 12:51:21,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:51:21,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-25 12:51:21,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-03-25 12:51:21,028 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 330 [2021-03-25 12:51:21,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 257 transitions, 4621 flow. Second operand has 13 states, 13 states have (on average 176.15384615384616) internal successors, (2290), 13 states have internal predecessors, (2290), 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) [2021-03-25 12:51:21,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:51:21,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 330 [2021-03-25 12:51:21,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:51:24,030 INFO L129 PetriNetUnfolder]: 11581/18423 cut-off events. [2021-03-25 12:51:24,030 INFO L130 PetriNetUnfolder]: For 312996/313438 co-relation queries the response was YES. [2021-03-25 12:51:24,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93440 conditions, 18423 events. 11581/18423 cut-off events. For 312996/313438 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 133580 event pairs, 656 based on Foata normal form. 204/14218 useless extension candidates. Maximal degree in co-relation 93337. Up to 9602 conditions per place. [2021-03-25 12:51:24,158 INFO L132 encePairwiseOnDemand]: 316/330 looper letters, 177 selfloop transitions, 76 changer transitions 10/319 dead transitions. [2021-03-25 12:51:24,158 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 319 transitions, 5964 flow [2021-03-25 12:51:24,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-25 12:51:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-25 12:51:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2193 transitions. [2021-03-25 12:51:24,160 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5537878787878788 [2021-03-25 12:51:24,160 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2193 transitions. [2021-03-25 12:51:24,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2193 transitions. [2021-03-25 12:51:24,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:51:24,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2193 transitions. [2021-03-25 12:51:24,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 182.75) internal successors, (2193), 12 states have internal predecessors, (2193), 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) [2021-03-25 12:51:24,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 330.0) internal successors, (4290), 13 states have internal predecessors, (4290), 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) [2021-03-25 12:51:24,163 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 330.0) internal successors, (4290), 13 states have internal predecessors, (4290), 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) [2021-03-25 12:51:24,163 INFO L185 Difference]: Start difference. First operand has 227 places, 257 transitions, 4621 flow. Second operand 12 states and 2193 transitions. [2021-03-25 12:51:24,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 319 transitions, 5964 flow [2021-03-25 12:51:24,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 319 transitions, 5907 flow, removed 18 selfloop flow, removed 3 redundant places. [2021-03-25 12:51:24,720 INFO L241 Difference]: Finished difference. Result has 240 places, 270 transitions, 5041 flow [2021-03-25 12:51:24,720 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=4528, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5041, PETRI_PLACES=240, PETRI_TRANSITIONS=270} [2021-03-25 12:51:24,720 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 177 predicate places. [2021-03-25 12:51:24,720 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:51:24,721 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 240 places, 270 transitions, 5041 flow [2021-03-25 12:51:24,721 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 240 places, 270 transitions, 5041 flow [2021-03-25 12:51:24,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 240 places, 270 transitions, 5041 flow [2021-03-25 12:51:25,661 INFO L129 PetriNetUnfolder]: 5260/9822 cut-off events. [2021-03-25 12:51:25,661 INFO L130 PetriNetUnfolder]: For 56080/56163 co-relation queries the response was YES. [2021-03-25 12:51:25,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26638 conditions, 9822 events. 5260/9822 cut-off events. For 56080/56163 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 82729 event pairs, 9 based on Foata normal form. 36/6468 useless extension candidates. Maximal degree in co-relation 26535. Up to 2792 conditions per place. [2021-03-25 12:51:25,807 INFO L142 LiptonReduction]: Number of co-enabled transitions 1890 [2021-03-25 12:51:25,887 INFO L154 LiptonReduction]: Checked pairs total: 209 [2021-03-25 12:51:25,887 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:51:25,887 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1167 [2021-03-25 12:51:25,887 INFO L480 AbstractCegarLoop]: Abstraction has has 240 places, 270 transitions, 5041 flow [2021-03-25 12:51:25,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 176.15384615384616) internal successors, (2290), 13 states have internal predecessors, (2290), 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) [2021-03-25 12:51:25,888 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:51:25,888 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:51:25,888 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-03-25 12:51:25,888 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:51:25,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:51:25,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1076838129, now seen corresponding path program 1 times [2021-03-25 12:51:25,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:51:25,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344098331] [2021-03-25 12:51:25,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:51:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:51:25,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:25,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 12:51:25,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:25,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:51:25,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:25,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 12:51:25,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:25,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:51:25,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:25,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:51:25,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:25,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 12:51:25,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:25,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:51:25,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:25,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:51:25,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:25,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:51:25,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:25,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:51:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:51:25,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344098331] [2021-03-25 12:51:25,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:51:25,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 12:51:25,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417723319] [2021-03-25 12:51:25,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 12:51:25,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:51:25,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 12:51:25,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-03-25 12:51:25,996 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 330 [2021-03-25 12:51:25,997 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 270 transitions, 5041 flow. Second operand has 11 states, 11 states have (on average 178.45454545454547) internal successors, (1963), 11 states have internal predecessors, (1963), 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) [2021-03-25 12:51:25,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:51:25,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 330 [2021-03-25 12:51:25,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:51:28,430 INFO L129 PetriNetUnfolder]: 10492/16900 cut-off events. [2021-03-25 12:51:28,431 INFO L130 PetriNetUnfolder]: For 305474/305641 co-relation queries the response was YES. [2021-03-25 12:51:28,522 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87587 conditions, 16900 events. 10492/16900 cut-off events. For 305474/305641 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 122811 event pairs, 2137 based on Foata normal form. 191/12710 useless extension candidates. Maximal degree in co-relation 87479. Up to 6101 conditions per place. [2021-03-25 12:51:28,556 INFO L132 encePairwiseOnDemand]: 322/330 looper letters, 211 selfloop transitions, 52 changer transitions 0/319 dead transitions. [2021-03-25 12:51:28,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 319 transitions, 6409 flow [2021-03-25 12:51:28,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 12:51:28,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 12:51:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1486 transitions. [2021-03-25 12:51:28,558 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5628787878787879 [2021-03-25 12:51:28,558 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1486 transitions. [2021-03-25 12:51:28,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1486 transitions. [2021-03-25 12:51:28,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:51:28,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1486 transitions. [2021-03-25 12:51:28,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 185.75) internal successors, (1486), 8 states have internal predecessors, (1486), 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) [2021-03-25 12:51:28,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 330.0) internal successors, (2970), 9 states have internal predecessors, (2970), 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) [2021-03-25 12:51:28,561 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 330.0) internal successors, (2970), 9 states have internal predecessors, (2970), 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) [2021-03-25 12:51:28,561 INFO L185 Difference]: Start difference. First operand has 240 places, 270 transitions, 5041 flow. Second operand 8 states and 1486 transitions. [2021-03-25 12:51:28,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 319 transitions, 6409 flow [2021-03-25 12:51:29,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 319 transitions, 6287 flow, removed 53 selfloop flow, removed 3 redundant places. [2021-03-25 12:51:29,220 INFO L241 Difference]: Finished difference. Result has 246 places, 266 transitions, 5000 flow [2021-03-25 12:51:29,221 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=4832, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5000, PETRI_PLACES=246, PETRI_TRANSITIONS=266} [2021-03-25 12:51:29,221 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 183 predicate places. [2021-03-25 12:51:29,221 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:51:29,221 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 246 places, 266 transitions, 5000 flow [2021-03-25 12:51:29,221 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 246 places, 266 transitions, 5000 flow [2021-03-25 12:51:29,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 246 places, 266 transitions, 5000 flow [2021-03-25 12:51:30,101 INFO L129 PetriNetUnfolder]: 5225/9773 cut-off events. [2021-03-25 12:51:30,102 INFO L130 PetriNetUnfolder]: For 52899/52984 co-relation queries the response was YES. [2021-03-25 12:51:30,164 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26106 conditions, 9773 events. 5225/9773 cut-off events. For 52899/52984 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 82611 event pairs, 16 based on Foata normal form. 38/6461 useless extension candidates. Maximal degree in co-relation 25995. Up to 2788 conditions per place. [2021-03-25 12:51:30,246 INFO L142 LiptonReduction]: Number of co-enabled transitions 1530 [2021-03-25 12:51:30,288 INFO L154 LiptonReduction]: Checked pairs total: 70 [2021-03-25 12:51:30,288 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:51:30,288 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1067 [2021-03-25 12:51:30,288 INFO L480 AbstractCegarLoop]: Abstraction has has 246 places, 266 transitions, 5000 flow [2021-03-25 12:51:30,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 178.45454545454547) internal successors, (1963), 11 states have internal predecessors, (1963), 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) [2021-03-25 12:51:30,289 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:51:30,289 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:51:30,289 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-03-25 12:51:30,289 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:51:30,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:51:30,289 INFO L82 PathProgramCache]: Analyzing trace with hash -55935116, now seen corresponding path program 1 times [2021-03-25 12:51:30,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:51:30,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690418444] [2021-03-25 12:51:30,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:51:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:51:30,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:30,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 12:51:30,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:30,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:51:30,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:30,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 12:51:30,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:30,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 12:51:30,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:30,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 12:51:30,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:30,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:51:30,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:30,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:51:30,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:30,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:51:30,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:30,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:51:30,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:30,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:51:30,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:30,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:51:30,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:30,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:51:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:51:30,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690418444] [2021-03-25 12:51:30,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:51:30,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 12:51:30,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658977382] [2021-03-25 12:51:30,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 12:51:30,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:51:30,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 12:51:30,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-03-25 12:51:30,456 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 330 [2021-03-25 12:51:30,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 266 transitions, 5000 flow. Second operand has 12 states, 12 states have (on average 175.33333333333334) internal successors, (2104), 12 states have internal predecessors, (2104), 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) [2021-03-25 12:51:30,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:51:30,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 330 [2021-03-25 12:51:30,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:51:32,947 INFO L129 PetriNetUnfolder]: 10691/17300 cut-off events. [2021-03-25 12:51:32,947 INFO L130 PetriNetUnfolder]: For 287642/287826 co-relation queries the response was YES. [2021-03-25 12:51:33,048 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89134 conditions, 17300 events. 10691/17300 cut-off events. For 287642/287826 co-relation queries the response was YES. Maximal size of possible extension queue 1046. Compared 127444 event pairs, 1602 based on Foata normal form. 99/13006 useless extension candidates. Maximal degree in co-relation 89021. Up to 9466 conditions per place. [2021-03-25 12:51:33,085 INFO L132 encePairwiseOnDemand]: 319/330 looper letters, 223 selfloop transitions, 34 changer transitions 1/314 dead transitions. [2021-03-25 12:51:33,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 314 transitions, 6129 flow [2021-03-25 12:51:33,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 12:51:33,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 12:51:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1636 transitions. [2021-03-25 12:51:33,087 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5508417508417508 [2021-03-25 12:51:33,087 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1636 transitions. [2021-03-25 12:51:33,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1636 transitions. [2021-03-25 12:51:33,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:51:33,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1636 transitions. [2021-03-25 12:51:33,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 181.77777777777777) internal successors, (1636), 9 states have internal predecessors, (1636), 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) [2021-03-25 12:51:33,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:51:33,090 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 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) [2021-03-25 12:51:33,090 INFO L185 Difference]: Start difference. First operand has 246 places, 266 transitions, 5000 flow. Second operand 9 states and 1636 transitions. [2021-03-25 12:51:33,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 314 transitions, 6129 flow [2021-03-25 12:51:33,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 314 transitions, 6039 flow, removed 4 selfloop flow, removed 7 redundant places. [2021-03-25 12:51:33,673 INFO L241 Difference]: Finished difference. Result has 250 places, 269 transitions, 5063 flow [2021-03-25 12:51:33,673 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=4910, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5063, PETRI_PLACES=250, PETRI_TRANSITIONS=269} [2021-03-25 12:51:33,673 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 187 predicate places. [2021-03-25 12:51:33,673 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:51:33,673 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 269 transitions, 5063 flow [2021-03-25 12:51:33,673 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 250 places, 269 transitions, 5063 flow [2021-03-25 12:51:33,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 250 places, 269 transitions, 5063 flow [2021-03-25 12:51:34,615 INFO L129 PetriNetUnfolder]: 5460/10210 cut-off events. [2021-03-25 12:51:34,615 INFO L130 PetriNetUnfolder]: For 57282/57361 co-relation queries the response was YES. [2021-03-25 12:51:34,687 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27309 conditions, 10210 events. 5460/10210 cut-off events. For 57282/57361 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 86951 event pairs, 18 based on Foata normal form. 40/6774 useless extension candidates. Maximal degree in co-relation 27200. Up to 2916 conditions per place. [2021-03-25 12:51:34,778 INFO L142 LiptonReduction]: Number of co-enabled transitions 1528 [2021-03-25 12:51:34,811 INFO L154 LiptonReduction]: Checked pairs total: 70 [2021-03-25 12:51:34,811 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:51:34,811 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1138 [2021-03-25 12:51:34,811 INFO L480 AbstractCegarLoop]: Abstraction has has 250 places, 269 transitions, 5063 flow [2021-03-25 12:51:34,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 175.33333333333334) internal successors, (2104), 12 states have internal predecessors, (2104), 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) [2021-03-25 12:51:34,812 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:51:34,812 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:51:34,812 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-03-25 12:51:34,812 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:51:34,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:51:34,812 INFO L82 PathProgramCache]: Analyzing trace with hash -328721308, now seen corresponding path program 2 times [2021-03-25 12:51:34,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:51:34,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608406457] [2021-03-25 12:51:34,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:51:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:51:34,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:34,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 12:51:34,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:34,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 12:51:34,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:34,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:51:34,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:34,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 12:51:34,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:34,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 12:51:34,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:34,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 12:51:34,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:34,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:51:34,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:34,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 12:51:34,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:34,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 12:51:34,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:34,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 12:51:34,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:34,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:51:34,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:34,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:51:34,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:51:34,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608406457] [2021-03-25 12:51:34,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:51:34,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 12:51:34,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816632934] [2021-03-25 12:51:34,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 12:51:34,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:51:34,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 12:51:34,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-03-25 12:51:34,965 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 330 [2021-03-25 12:51:34,966 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 269 transitions, 5063 flow. Second operand has 12 states, 12 states have (on average 175.33333333333334) internal successors, (2104), 12 states have internal predecessors, (2104), 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) [2021-03-25 12:51:34,966 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:51:34,966 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 330 [2021-03-25 12:51:34,966 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:51:37,400 INFO L129 PetriNetUnfolder]: 9890/16173 cut-off events. [2021-03-25 12:51:37,400 INFO L130 PetriNetUnfolder]: For 272839/272965 co-relation queries the response was YES. [2021-03-25 12:51:37,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81121 conditions, 16173 events. 9890/16173 cut-off events. For 272839/272965 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 119347 event pairs, 1355 based on Foata normal form. 243/12310 useless extension candidates. Maximal degree in co-relation 81043. Up to 7933 conditions per place. [2021-03-25 12:51:37,525 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 200 selfloop transitions, 70 changer transitions 0/326 dead transitions. [2021-03-25 12:51:37,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 326 transitions, 6264 flow [2021-03-25 12:51:37,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 12:51:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 12:51:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1821 transitions. [2021-03-25 12:51:37,526 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5518181818181818 [2021-03-25 12:51:37,526 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1821 transitions. [2021-03-25 12:51:37,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1821 transitions. [2021-03-25 12:51:37,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:51:37,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1821 transitions. [2021-03-25 12:51:37,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 182.1) internal successors, (1821), 10 states have internal predecessors, (1821), 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) [2021-03-25 12:51:37,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 330.0) internal successors, (3630), 11 states have internal predecessors, (3630), 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) [2021-03-25 12:51:37,530 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 330.0) internal successors, (3630), 11 states have internal predecessors, (3630), 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) [2021-03-25 12:51:37,530 INFO L185 Difference]: Start difference. First operand has 250 places, 269 transitions, 5063 flow. Second operand 10 states and 1821 transitions. [2021-03-25 12:51:37,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 326 transitions, 6264 flow [2021-03-25 12:51:38,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 326 transitions, 5837 flow, removed 45 selfloop flow, removed 17 redundant places. [2021-03-25 12:51:38,138 INFO L241 Difference]: Finished difference. Result has 238 places, 256 transitions, 4654 flow [2021-03-25 12:51:38,138 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=4436, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4654, PETRI_PLACES=238, PETRI_TRANSITIONS=256} [2021-03-25 12:51:38,138 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 175 predicate places. [2021-03-25 12:51:38,138 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:51:38,138 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 256 transitions, 4654 flow [2021-03-25 12:51:38,138 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 256 transitions, 4654 flow [2021-03-25 12:51:38,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 238 places, 256 transitions, 4654 flow [2021-03-25 12:51:39,014 INFO L129 PetriNetUnfolder]: 5390/10089 cut-off events. [2021-03-25 12:51:39,014 INFO L130 PetriNetUnfolder]: For 47744/47811 co-relation queries the response was YES. [2021-03-25 12:51:39,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25519 conditions, 10089 events. 5390/10089 cut-off events. For 47744/47811 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 85481 event pairs, 14 based on Foata normal form. 33/6713 useless extension candidates. Maximal degree in co-relation 25427. Up to 2908 conditions per place. [2021-03-25 12:51:39,166 INFO L142 LiptonReduction]: Number of co-enabled transitions 742 [2021-03-25 12:51:39,663 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:51:39,663 INFO L156 LiptonReduction]: Total number of compositions: 22 [2021-03-25 12:51:39,664 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1526 [2021-03-25 12:51:39,664 INFO L480 AbstractCegarLoop]: Abstraction has has 237 places, 255 transitions, 4652 flow [2021-03-25 12:51:39,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 175.33333333333334) internal successors, (2104), 12 states have internal predecessors, (2104), 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) [2021-03-25 12:51:39,664 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:51:39,665 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:51:39,665 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-03-25 12:51:39,665 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:51:39,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:51:39,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2048436766, now seen corresponding path program 1 times [2021-03-25 12:51:39,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:51:39,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096198573] [2021-03-25 12:51:39,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:51:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:51:39,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:39,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:51:39,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:39,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:51:39,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:39,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:51:39,699 INFO L142 QuantifierPusher]: treesize reduction 4, result has 80.0 percent of original size [2021-03-25 12:51:39,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 12:51:39,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:39,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:51:39,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:39,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 12:51:39,733 INFO L142 QuantifierPusher]: treesize reduction 16, result has 44.8 percent of original size [2021-03-25 12:51:39,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 12:51:39,741 INFO L142 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-03-25 12:51:39,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 12:51:39,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:39,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:51:39,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:51:39,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096198573] [2021-03-25 12:51:39,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:51:39,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 12:51:39,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245540974] [2021-03-25 12:51:39,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 12:51:39,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:51:39,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 12:51:39,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-25 12:51:39,752 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 352 [2021-03-25 12:51:39,753 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 255 transitions, 4652 flow. Second operand has 8 states, 8 states have (on average 217.75) internal successors, (1742), 8 states have internal predecessors, (1742), 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) [2021-03-25 12:51:39,753 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:51:39,753 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 352 [2021-03-25 12:51:39,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:51:41,989 INFO L129 PetriNetUnfolder]: 9717/16023 cut-off events. [2021-03-25 12:51:41,989 INFO L130 PetriNetUnfolder]: For 235314/235428 co-relation queries the response was YES. [2021-03-25 12:51:42,075 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79586 conditions, 16023 events. 9717/16023 cut-off events. For 235314/235428 co-relation queries the response was YES. Maximal size of possible extension queue 1001. Compared 119500 event pairs, 1386 based on Foata normal form. 344/12466 useless extension candidates. Maximal degree in co-relation 79491. Up to 8428 conditions per place. [2021-03-25 12:51:42,104 INFO L132 encePairwiseOnDemand]: 342/352 looper letters, 166 selfloop transitions, 43 changer transitions 6/268 dead transitions. [2021-03-25 12:51:42,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 268 transitions, 5344 flow [2021-03-25 12:51:42,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:51:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:51:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1574 transitions. [2021-03-25 12:51:42,106 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6387987012987013 [2021-03-25 12:51:42,106 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1574 transitions. [2021-03-25 12:51:42,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1574 transitions. [2021-03-25 12:51:42,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:51:42,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1574 transitions. [2021-03-25 12:51:42,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 224.85714285714286) internal successors, (1574), 7 states have internal predecessors, (1574), 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) [2021-03-25 12:51:42,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 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) [2021-03-25 12:51:42,108 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 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) [2021-03-25 12:51:42,108 INFO L185 Difference]: Start difference. First operand has 237 places, 255 transitions, 4652 flow. Second operand 7 states and 1574 transitions. [2021-03-25 12:51:42,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 268 transitions, 5344 flow [2021-03-25 12:51:42,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 268 transitions, 5291 flow, removed 15 selfloop flow, removed 5 redundant places. [2021-03-25 12:51:42,403 INFO L241 Difference]: Finished difference. Result has 238 places, 253 transitions, 4685 flow [2021-03-25 12:51:42,403 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=4599, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4685, PETRI_PLACES=238, PETRI_TRANSITIONS=253} [2021-03-25 12:51:42,403 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 175 predicate places. [2021-03-25 12:51:42,403 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:51:42,403 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 253 transitions, 4685 flow [2021-03-25 12:51:42,403 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 253 transitions, 4685 flow [2021-03-25 12:51:42,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 238 places, 253 transitions, 4685 flow [2021-03-25 12:51:43,275 INFO L129 PetriNetUnfolder]: 4803/9475 cut-off events. [2021-03-25 12:51:43,275 INFO L130 PetriNetUnfolder]: For 46505/46574 co-relation queries the response was YES. [2021-03-25 12:51:43,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25797 conditions, 9475 events. 4803/9475 cut-off events. For 46505/46574 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 83857 event pairs, 22 based on Foata normal form. 34/6390 useless extension candidates. Maximal degree in co-relation 25706. Up to 2884 conditions per place. [2021-03-25 12:51:43,418 INFO L142 LiptonReduction]: Number of co-enabled transitions 698 [2021-03-25 12:51:43,429 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:51:43,429 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:51:43,429 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1026 [2021-03-25 12:51:43,429 INFO L480 AbstractCegarLoop]: Abstraction has has 238 places, 253 transitions, 4685 flow [2021-03-25 12:51:43,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 217.75) internal successors, (1742), 8 states have internal predecessors, (1742), 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) [2021-03-25 12:51:43,429 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:51:43,429 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:51:43,430 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-03-25 12:51:43,430 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:51:43,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:51:43,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1588706145, now seen corresponding path program 1 times [2021-03-25 12:51:43,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:51:43,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708361283] [2021-03-25 12:51:43,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:51:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:51:43,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:43,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:51:43,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:43,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:51:43,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:43,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 12:51:43,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:43,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:51:43,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:43,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 12:51:43,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:43,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:51:43,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:43,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 12:51:43,504 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-03-25 12:51:43,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:51:43,509 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 12:51:43,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:51:43,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:43,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:51:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:51:43,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708361283] [2021-03-25 12:51:43,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:51:43,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 12:51:43,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875709938] [2021-03-25 12:51:43,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 12:51:43,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:51:43,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 12:51:43,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-25 12:51:43,519 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 352 [2021-03-25 12:51:43,520 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 253 transitions, 4685 flow. Second operand has 8 states, 8 states have (on average 217.75) internal successors, (1742), 8 states have internal predecessors, (1742), 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) [2021-03-25 12:51:43,520 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:51:43,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 352 [2021-03-25 12:51:43,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:51:45,811 INFO L129 PetriNetUnfolder]: 9304/15864 cut-off events. [2021-03-25 12:51:45,811 INFO L130 PetriNetUnfolder]: For 226662/226776 co-relation queries the response was YES. [2021-03-25 12:51:45,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78676 conditions, 15864 events. 9304/15864 cut-off events. For 226662/226776 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 123517 event pairs, 643 based on Foata normal form. 273/12394 useless extension candidates. Maximal degree in co-relation 78581. Up to 7262 conditions per place. [2021-03-25 12:51:45,918 INFO L132 encePairwiseOnDemand]: 338/352 looper letters, 151 selfloop transitions, 66 changer transitions 14/281 dead transitions. [2021-03-25 12:51:45,919 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 281 transitions, 5469 flow [2021-03-25 12:51:45,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 12:51:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 12:51:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1809 transitions. [2021-03-25 12:51:45,920 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6424005681818182 [2021-03-25 12:51:45,920 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1809 transitions. [2021-03-25 12:51:45,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1809 transitions. [2021-03-25 12:51:45,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:51:45,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1809 transitions. [2021-03-25 12:51:45,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 226.125) internal successors, (1809), 8 states have internal predecessors, (1809), 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) [2021-03-25 12:51:45,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 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) [2021-03-25 12:51:45,922 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 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) [2021-03-25 12:51:45,922 INFO L185 Difference]: Start difference. First operand has 238 places, 253 transitions, 4685 flow. Second operand 8 states and 1809 transitions. [2021-03-25 12:51:45,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 281 transitions, 5469 flow [2021-03-25 12:51:46,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 281 transitions, 5295 flow, removed 0 selfloop flow, removed 7 redundant places. [2021-03-25 12:51:46,315 INFO L241 Difference]: Finished difference. Result has 240 places, 255 transitions, 4700 flow [2021-03-25 12:51:46,315 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=4525, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4700, PETRI_PLACES=240, PETRI_TRANSITIONS=255} [2021-03-25 12:51:46,315 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 177 predicate places. [2021-03-25 12:51:46,315 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:51:46,315 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 240 places, 255 transitions, 4700 flow [2021-03-25 12:51:46,315 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 240 places, 255 transitions, 4700 flow [2021-03-25 12:51:46,317 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 240 places, 255 transitions, 4700 flow [2021-03-25 12:51:47,237 INFO L129 PetriNetUnfolder]: 4657/9575 cut-off events. [2021-03-25 12:51:47,237 INFO L130 PetriNetUnfolder]: For 57018/57113 co-relation queries the response was YES. [2021-03-25 12:51:47,289 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28729 conditions, 9575 events. 4657/9575 cut-off events. For 57018/57113 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 88465 event pairs, 9 based on Foata normal form. 47/6582 useless extension candidates. Maximal degree in co-relation 28636. Up to 2900 conditions per place. [2021-03-25 12:51:47,362 INFO L142 LiptonReduction]: Number of co-enabled transitions 678 [2021-03-25 12:51:47,370 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:51:47,371 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:51:47,371 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1056 [2021-03-25 12:51:47,371 INFO L480 AbstractCegarLoop]: Abstraction has has 240 places, 255 transitions, 4700 flow [2021-03-25 12:51:47,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 217.75) internal successors, (1742), 8 states have internal predecessors, (1742), 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) [2021-03-25 12:51:47,371 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:51:47,371 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:51:47,371 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-03-25 12:51:47,371 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:51:47,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:51:47,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1346811799, now seen corresponding path program 2 times [2021-03-25 12:51:47,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:51:47,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714905862] [2021-03-25 12:51:47,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:51:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 12:51:47,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:47,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:51:47,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:47,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 12:51:47,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:47,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:51:47,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:47,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:51:47,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:47,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:51:47,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:47,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 12:51:47,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:47,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 12:51:47,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:47,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 12:51:47,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 12:51:47,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 12:51:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 12:51:47,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714905862] [2021-03-25 12:51:47,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 12:51:47,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 12:51:47,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006634885] [2021-03-25 12:51:47,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 12:51:47,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 12:51:47,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 12:51:47,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-25 12:51:47,436 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 352 [2021-03-25 12:51:47,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 255 transitions, 4700 flow. Second operand has 8 states, 8 states have (on average 184.75) internal successors, (1478), 8 states have internal predecessors, (1478), 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) [2021-03-25 12:51:47,437 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 12:51:47,437 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 352 [2021-03-25 12:51:47,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 12:51:49,653 INFO L129 PetriNetUnfolder]: 9008/15489 cut-off events. [2021-03-25 12:51:49,653 INFO L130 PetriNetUnfolder]: For 222478/222703 co-relation queries the response was YES. [2021-03-25 12:51:49,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79323 conditions, 15489 events. 9008/15489 cut-off events. For 222478/222703 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 121952 event pairs, 1538 based on Foata normal form. 71/11840 useless extension candidates. Maximal degree in co-relation 79226. Up to 9478 conditions per place. [2021-03-25 12:51:49,751 INFO L132 encePairwiseOnDemand]: 343/352 looper letters, 157 selfloop transitions, 48 changer transitions 15/271 dead transitions. [2021-03-25 12:51:49,751 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 271 transitions, 5455 flow [2021-03-25 12:51:49,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 12:51:49,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 12:51:49,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1343 transitions. [2021-03-25 12:51:49,752 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5450487012987013 [2021-03-25 12:51:49,752 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1343 transitions. [2021-03-25 12:51:49,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1343 transitions. [2021-03-25 12:51:49,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 12:51:49,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1343 transitions. [2021-03-25 12:51:49,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 191.85714285714286) internal successors, (1343), 7 states have internal predecessors, (1343), 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) [2021-03-25 12:51:49,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 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) [2021-03-25 12:51:49,754 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 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) [2021-03-25 12:51:49,754 INFO L185 Difference]: Start difference. First operand has 240 places, 255 transitions, 4700 flow. Second operand 7 states and 1343 transitions. [2021-03-25 12:51:49,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 271 transitions, 5455 flow [2021-03-25 12:51:50,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 271 transitions, 5352 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-03-25 12:51:50,197 INFO L241 Difference]: Finished difference. Result has 241 places, 249 transitions, 4671 flow [2021-03-25 12:51:50,197 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=4593, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4671, PETRI_PLACES=241, PETRI_TRANSITIONS=249} [2021-03-25 12:51:50,197 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 178 predicate places. [2021-03-25 12:51:50,197 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 12:51:50,197 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 241 places, 249 transitions, 4671 flow [2021-03-25 12:51:50,198 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 241 places, 249 transitions, 4671 flow [2021-03-25 12:51:50,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 241 places, 249 transitions, 4671 flow [2021-03-25 12:51:51,008 INFO L129 PetriNetUnfolder]: 4211/8636 cut-off events. [2021-03-25 12:51:51,009 INFO L130 PetriNetUnfolder]: For 48156/48249 co-relation queries the response was YES. [2021-03-25 12:51:51,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25866 conditions, 8636 events. 4211/8636 cut-off events. For 48156/48249 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 78299 event pairs, 23 based on Foata normal form. 47/5880 useless extension candidates. Maximal degree in co-relation 25773. Up to 2900 conditions per place. [2021-03-25 12:51:51,104 INFO L142 LiptonReduction]: Number of co-enabled transitions 630 [2021-03-25 12:51:51,113 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 12:51:51,113 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 12:51:51,113 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 916 [2021-03-25 12:51:51,113 INFO L480 AbstractCegarLoop]: Abstraction has has 241 places, 249 transitions, 4671 flow [2021-03-25 12:51:51,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 184.75) internal successors, (1478), 8 states have internal predecessors, (1478), 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) [2021-03-25 12:51:51,113 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 12:51:51,113 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 12:51:51,113 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-03-25 12:51:51,113 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-25 12:51:51,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 12:51:51,114 INFO L82 PathProgramCache]: Analyzing trace with hash 116708457, now seen corresponding path program 1 times [2021-03-25 12:51:51,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 12:51:51,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144436370] [2021-03-25 12:51:51,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 12:51:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 12:51:51,125 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 12:51:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 12:51:51,136 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 12:51:51,169 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 12:51:51,169 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 12:51:51,170 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-03-25 12:51:51,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 12:51:51 BasicIcfg [2021-03-25 12:51:51,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 12:51:51,271 INFO L168 Benchmark]: Toolchain (without parser) took 154147.04 ms. Allocated memory was 255.9 MB in the beginning and 15.9 GB in the end (delta: 15.6 GB). Free memory was 233.5 MB in the beginning and 13.4 GB in the end (delta: -13.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 16.0 GB. [2021-03-25 12:51:51,271 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 255.9 MB. Free memory is still 238.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 12:51:51,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 674.67 ms. Allocated memory was 255.9 MB in the beginning and 335.5 MB in the end (delta: 79.7 MB). Free memory was 233.5 MB in the beginning and 258.3 MB in the end (delta: -24.8 MB). Peak memory consumption was 55.4 MB. Max. memory is 16.0 GB. [2021-03-25 12:51:51,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.89 ms. Allocated memory is still 335.5 MB. Free memory was 258.3 MB in the beginning and 317.4 MB in the end (delta: -59.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 12:51:51,271 INFO L168 Benchmark]: Boogie Preprocessor took 38.58 ms. Allocated memory is still 335.5 MB. Free memory was 317.4 MB in the beginning and 316.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 12:51:51,271 INFO L168 Benchmark]: RCFGBuilder took 451.03 ms. Allocated memory is still 335.5 MB. Free memory was 316.3 MB in the beginning and 290.1 MB in the end (delta: 26.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.0 GB. [2021-03-25 12:51:51,271 INFO L168 Benchmark]: TraceAbstraction took 152911.27 ms. Allocated memory was 335.5 MB in the beginning and 15.9 GB in the end (delta: 15.6 GB). Free memory was 289.0 MB in the beginning and 13.4 GB in the end (delta: -13.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 16.0 GB. [2021-03-25 12:51:51,272 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 255.9 MB. Free memory is still 238.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 674.67 ms. Allocated memory was 255.9 MB in the beginning and 335.5 MB in the end (delta: 79.7 MB). Free memory was 233.5 MB in the beginning and 258.3 MB in the end (delta: -24.8 MB). Peak memory consumption was 55.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 66.89 ms. Allocated memory is still 335.5 MB. Free memory was 258.3 MB in the beginning and 317.4 MB in the end (delta: -59.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 38.58 ms. Allocated memory is still 335.5 MB. Free memory was 317.4 MB in the beginning and 316.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 451.03 ms. Allocated memory is still 335.5 MB. Free memory was 316.3 MB in the beginning and 290.1 MB in the end (delta: 26.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 152911.27 ms. Allocated memory was 335.5 MB in the beginning and 15.9 GB in the end (delta: 15.6 GB). Free memory was 289.0 MB in the beginning and 13.4 GB in the end (delta: -13.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1972.1ms, 119 PlacesBefore, 63 PlacesAfterwards, 140 TransitionsBefore, 84 TransitionsAfterwards, 4156 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 60 TotalNumberOfCompositions, 2005 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1736, positive: 1730, positive conditional: 0, positive unconditional: 1730, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1598, positive: 1592, positive conditional: 0, positive unconditional: 1592, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1598, positive: 1592, positive conditional: 0, positive unconditional: 1592, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1598, positive: 1592, positive conditional: 0, positive unconditional: 1592, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1736, positive: 138, positive conditional: 0, positive unconditional: 138, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1598, unknown conditional: 0, unknown unconditional: 1598] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1108.1ms, 64 PlacesBefore, 53 PlacesAfterwards, 87 TransitionsBefore, 77 TransitionsAfterwards, 1404 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 165 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 165, positive: 165, positive conditional: 0, positive unconditional: 165, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 124, positive: 124, positive conditional: 0, positive unconditional: 124, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 124, positive: 124, positive conditional: 0, positive unconditional: 124, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 124, positive: 124, positive conditional: 0, positive unconditional: 124, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 165, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 124, unknown conditional: 0, unknown unconditional: 124] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.3ms, 57 PlacesBefore, 57 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 1154 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.2ms, 64 PlacesBefore, 64 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 1222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 255.5ms, 70 PlacesBefore, 70 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 1916 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 227.9ms, 79 PlacesBefore, 79 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 1904 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 280.4ms, 85 PlacesBefore, 83 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 2092 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 222.5ms, 90 PlacesBefore, 90 PlacesAfterwards, 116 TransitionsBefore, 116 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 355.1ms, 97 PlacesBefore, 97 PlacesAfterwards, 122 TransitionsBefore, 122 TransitionsAfterwards, 2110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 372.9ms, 99 PlacesBefore, 99 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 2108 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 410.4ms, 112 PlacesBefore, 112 PlacesAfterwards, 146 TransitionsBefore, 146 TransitionsAfterwards, 2238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 380.7ms, 118 PlacesBefore, 118 PlacesAfterwards, 162 TransitionsBefore, 162 TransitionsAfterwards, 2484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 535.6ms, 126 PlacesBefore, 126 PlacesAfterwards, 159 TransitionsBefore, 159 TransitionsAfterwards, 2596 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 550.5ms, 130 PlacesBefore, 130 PlacesAfterwards, 165 TransitionsBefore, 165 TransitionsAfterwards, 2716 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 661.6ms, 133 PlacesBefore, 133 PlacesAfterwards, 165 TransitionsBefore, 165 TransitionsAfterwards, 2702 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 672.8ms, 139 PlacesBefore, 139 PlacesAfterwards, 175 TransitionsBefore, 175 TransitionsAfterwards, 2776 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 667.8ms, 149 PlacesBefore, 149 PlacesAfterwards, 187 TransitionsBefore, 187 TransitionsAfterwards, 2896 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 539.8ms, 164 PlacesBefore, 164 PlacesAfterwards, 202 TransitionsBefore, 202 TransitionsAfterwards, 3012 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 756.5ms, 171 PlacesBefore, 171 PlacesAfterwards, 218 TransitionsBefore, 218 TransitionsAfterwards, 3098 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 772.1ms, 176 PlacesBefore, 176 PlacesAfterwards, 235 TransitionsBefore, 235 TransitionsAfterwards, 3288 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 848.7ms, 182 PlacesBefore, 182 PlacesAfterwards, 233 TransitionsBefore, 233 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 777.5ms, 181 PlacesBefore, 181 PlacesAfterwards, 207 TransitionsBefore, 207 TransitionsAfterwards, 2868 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 814.6ms, 179 PlacesBefore, 179 PlacesAfterwards, 208 TransitionsBefore, 208 TransitionsAfterwards, 2848 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 832.6ms, 184 PlacesBefore, 184 PlacesAfterwards, 209 TransitionsBefore, 209 TransitionsAfterwards, 2798 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 556.2ms, 188 PlacesBefore, 188 PlacesAfterwards, 210 TransitionsBefore, 210 TransitionsAfterwards, 2748 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 850.1ms, 193 PlacesBefore, 193 PlacesAfterwards, 217 TransitionsBefore, 217 TransitionsAfterwards, 2696 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 672.3ms, 201 PlacesBefore, 200 PlacesAfterwards, 233 TransitionsBefore, 233 TransitionsAfterwards, 3414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 915.4ms, 203 PlacesBefore, 203 PlacesAfterwards, 248 TransitionsBefore, 248 TransitionsAfterwards, 3442 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 754.3ms, 208 PlacesBefore, 208 PlacesAfterwards, 261 TransitionsBefore, 261 TransitionsAfterwards, 3658 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 855.1ms, 214 PlacesBefore, 214 PlacesAfterwards, 270 TransitionsBefore, 270 TransitionsAfterwards, 3782 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 784.3ms, 223 PlacesBefore, 223 PlacesAfterwards, 292 TransitionsBefore, 292 TransitionsAfterwards, 3926 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 906.7ms, 219 PlacesBefore, 219 PlacesAfterwards, 278 TransitionsBefore, 278 TransitionsAfterwards, 3482 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 861.5ms, 217 PlacesBefore, 217 PlacesAfterwards, 259 TransitionsBefore, 259 TransitionsAfterwards, 3072 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 985.4ms, 212 PlacesBefore, 212 PlacesAfterwards, 245 TransitionsBefore, 245 TransitionsAfterwards, 2566 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 377 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 240, positive: 224, positive conditional: 0, positive unconditional: 224, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 240, positive: 210, positive conditional: 0, positive unconditional: 210, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 683.8ms, 208 PlacesBefore, 208 PlacesAfterwards, 240 TransitionsBefore, 240 TransitionsAfterwards, 2310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 305 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 195, positive: 182, positive conditional: 0, positive unconditional: 182, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 195, positive: 182, positive conditional: 0, positive unconditional: 182, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 710.5ms, 213 PlacesBefore, 213 PlacesAfterwards, 239 TransitionsBefore, 239 TransitionsAfterwards, 2146 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 281 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 180, positive: 168, positive conditional: 0, positive unconditional: 168, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 180, positive: 168, positive conditional: 0, positive unconditional: 168, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 904.0ms, 217 PlacesBefore, 217 PlacesAfterwards, 237 TransitionsBefore, 237 TransitionsAfterwards, 1978 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 233 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 150, positive: 140, positive conditional: 0, positive unconditional: 140, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, positive: 140, positive conditional: 0, positive unconditional: 140, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 649.8ms, 220 PlacesBefore, 220 PlacesAfterwards, 238 TransitionsBefore, 238 TransitionsAfterwards, 1810 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 185 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 120, positive: 112, positive conditional: 0, positive unconditional: 112, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, positive: 112, positive conditional: 0, positive unconditional: 112, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 963.0ms, 227 PlacesBefore, 227 PlacesAfterwards, 257 TransitionsBefore, 257 TransitionsAfterwards, 1974 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 209 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 135, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 135, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1166.2ms, 240 PlacesBefore, 240 PlacesAfterwards, 270 TransitionsBefore, 270 TransitionsAfterwards, 1890 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 209 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1066.7ms, 246 PlacesBefore, 246 PlacesAfterwards, 266 TransitionsBefore, 266 TransitionsAfterwards, 1530 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 70 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1137.6ms, 250 PlacesBefore, 250 PlacesAfterwards, 269 TransitionsBefore, 269 TransitionsAfterwards, 1528 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 70 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1525.2ms, 238 PlacesBefore, 237 PlacesAfterwards, 256 TransitionsBefore, 255 TransitionsAfterwards, 742 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 22 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 22 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1025.5ms, 238 PlacesBefore, 238 PlacesAfterwards, 253 TransitionsBefore, 253 TransitionsAfterwards, 698 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1055.3ms, 240 PlacesBefore, 240 PlacesAfterwards, 255 TransitionsBefore, 255 TransitionsAfterwards, 678 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 915.0ms, 241 PlacesBefore, 241 PlacesAfterwards, 249 TransitionsBefore, 249 TransitionsAfterwards, 630 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - CounterExampleResult [Line: 1123]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1124] 0 char *v; [L1161] 0 pthread_t t; [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={14:0}, t2={13:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={0:0}] [L1148] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={14:0}, t2={13:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) [L1128] 2 return 0; [L1163] 0 \read(t) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={14:0}, t2={13:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={14:0}, t2={13:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={14:0}, t2={13:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1133] 3 v[0] = 'X' [L1135] 3 return 0; [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={14:0}, t2={13:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={14:0}, t2={13:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1133] 5 v[0] = 'X' [L1135] 5 return 0; [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={14:0}, t2={13:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1153] 1 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={14:0}, t2={13:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={14:0}, t2={13:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1154] 1 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={14:0}, t2={13:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1133] 6 v[0] = 'X' [L1135] 6 return 0; [L1140] 4 v[0] = 'Y' [L1142] 4 return 0; [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={14:0}, t2={13:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1155] 1 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={14:0}, t2={13:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={14:0}, t2={13:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1156] 1 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={14:0}, t2={13:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={14:0}, t2={13:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, v={-1:0}] [L1164] 0 v[0] [L1123] COND TRUE 0 !expression [L1123] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, v={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 152514.5ms, OverallIterations: 46, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 112452.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2112.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1385 SDtfs, 2929 SDslu, 3267 SDs, 0 SdLazy, 11823 SolverSat, 1096 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6463.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 622 GetRequests, 55 SyntacticMatches, 16 SemanticMatches, 551 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 9982.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5368occurred in iteration=30, InterpolantAutomatonStates: 407, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 71.6ms SsaConstructionTime, 364.4ms SatisfiabilityAnalysisTime, 5010.8ms InterpolantComputationTime, 879 NumberOfCodeBlocks, 879 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 803 ConstructedInterpolants, 0 QuantifiedInterpolants, 12511 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 45 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...