/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-RepeatedVariableLbe.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 03:04:53,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 03:04:53,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 03:04:53,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 03:04:53,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 03:04:53,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 03:04:53,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 03:04:53,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 03:04:53,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 03:04:53,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 03:04:53,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 03:04:53,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 03:04:53,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 03:04:53,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 03:04:53,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 03:04:53,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 03:04:53,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 03:04:53,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 03:04:53,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 03:04:53,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 03:04:53,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 03:04:53,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 03:04:53,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 03:04:53,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 03:04:53,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 03:04:53,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 03:04:53,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 03:04:53,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 03:04:53,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 03:04:53,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 03:04:53,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 03:04:53,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 03:04:53,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 03:04:53,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 03:04:53,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 03:04:53,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 03:04:53,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 03:04:53,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 03:04:53,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 03:04:53,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 03:04:53,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 03:04:53,884 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-RepeatedVariableLbe.epf [2021-03-25 03:04:53,918 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 03:04:53,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 03:04:53,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 03:04:53,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 03:04:53,921 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 03:04:53,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 03:04:53,922 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 03:04:53,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 03:04:53,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 03:04:53,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 03:04:53,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 03:04:53,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 03:04:53,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 03:04:53,923 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 03:04:53,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 03:04:53,924 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 03:04:53,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 03:04:53,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 03:04:53,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 03:04:53,924 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 03:04:53,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 03:04:53,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 03:04:53,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 03:04:53,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 03:04:53,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 03:04:53,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 03:04:53,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 03:04:53,926 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 03:04:53,926 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 03:04:53,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 03:04:53,926 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 03:04:54,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 03:04:54,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 03:04:54,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 03:04:54,236 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 03:04:54,236 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 03:04:54,237 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 03:04:54,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a3680501/b5fb7f561bdf4458b863bf92df430161/FLAG83e0479b7 [2021-03-25 03:04:54,717 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 03:04:54,717 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2021-03-25 03:04:54,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a3680501/b5fb7f561bdf4458b863bf92df430161/FLAG83e0479b7 [2021-03-25 03:04:55,017 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a3680501/b5fb7f561bdf4458b863bf92df430161 [2021-03-25 03:04:55,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 03:04:55,020 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 03:04:55,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 03:04:55,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 03:04:55,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 03:04:55,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:04:55" (1/1) ... [2021-03-25 03:04:55,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41cef5a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:04:55, skipping insertion in model container [2021-03-25 03:04:55,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:04:55" (1/1) ... [2021-03-25 03:04:55,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 03:04:55,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 03:04:55,217 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-25 03:04:55,407 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 03:04:55,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 03:04:55,460 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 03:04:55,489 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-25 03:04:55,500 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 03:04:55,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 03:04:55,670 INFO L208 MainTranslator]: Completed translation [2021-03-25 03:04:55,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:04:55 WrapperNode [2021-03-25 03:04:55,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 03:04:55,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 03:04:55,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 03:04:55,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 03:04:55,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:04:55" (1/1) ... [2021-03-25 03:04:55,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:04:55" (1/1) ... [2021-03-25 03:04:55,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 03:04:55,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 03:04:55,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 03:04:55,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 03:04:55,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:04:55" (1/1) ... [2021-03-25 03:04:55,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:04:55" (1/1) ... [2021-03-25 03:04:55,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:04:55" (1/1) ... [2021-03-25 03:04:55,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:04:55" (1/1) ... [2021-03-25 03:04:55,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:04:55" (1/1) ... [2021-03-25 03:04:55,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:04:55" (1/1) ... [2021-03-25 03:04:55,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:04:55" (1/1) ... [2021-03-25 03:04:55,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 03:04:55,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 03:04:55,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 03:04:55,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 03:04:55,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:04:55" (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 03:04:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 03:04:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 03:04:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 03:04:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 03:04:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 03:04:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2021-03-25 03:04:55,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2021-03-25 03:04:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-25 03:04:55,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-25 03:04:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-25 03:04:55,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-25 03:04:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-25 03:04:55,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-25 03:04:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 03:04:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-03-25 03:04:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 03:04:55,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 03:04:55,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 03:04:55,844 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 03:04:56,293 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 03:04:56,294 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-03-25 03:04:56,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:04:56 BoogieIcfgContainer [2021-03-25 03:04:56,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 03:04:56,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 03:04:56,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 03:04:56,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 03:04:56,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 03:04:55" (1/3) ... [2021-03-25 03:04:56,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cb2253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:04:56, skipping insertion in model container [2021-03-25 03:04:56,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:04:55" (2/3) ... [2021-03-25 03:04:56,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cb2253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:04:56, skipping insertion in model container [2021-03-25 03:04:56,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:04:56" (3/3) ... [2021-03-25 03:04:56,303 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2021-03-25 03:04:56,310 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 03:04:56,314 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-25 03:04:56,315 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 03:04:56,376 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,376 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,377 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,377 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,377 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,377 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,377 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,377 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,377 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,377 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,378 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,378 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,379 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,379 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,379 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,379 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,379 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,379 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,380 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,380 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,380 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,380 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,380 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,380 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,381 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,381 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,381 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,381 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,381 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,381 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,381 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,382 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,382 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,382 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,382 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,382 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,382 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,382 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,383 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,383 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,383 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,383 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,383 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,384 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,384 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,384 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,384 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,384 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,384 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,384 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,384 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,385 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,385 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,385 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,385 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,385 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,385 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,385 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,386 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,386 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,386 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,386 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,386 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,386 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,386 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,387 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,387 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,387 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,387 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,387 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,387 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,387 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,387 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,388 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,388 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,388 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,388 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,388 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,388 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,388 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,388 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,388 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,389 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,389 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,389 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,389 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,389 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,389 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,389 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,389 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,390 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,390 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,390 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,390 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,390 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,390 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,390 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,390 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,391 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,391 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,391 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,391 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,391 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,394 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,394 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,394 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,395 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,395 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,395 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,395 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,395 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,395 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,395 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,395 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,396 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,396 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,396 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,396 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,396 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,396 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,396 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,396 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,397 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,397 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,397 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,397 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,398 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,398 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,398 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,398 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,398 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,398 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,399 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,399 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,399 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,400 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,400 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,400 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,400 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,400 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,400 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,400 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,401 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,401 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,401 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,401 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,401 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,401 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,402 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,402 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,402 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,402 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,403 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,403 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,403 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,403 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,403 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,403 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,403 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,403 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,404 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,404 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,404 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,404 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,404 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,404 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,404 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,405 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,405 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,405 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,405 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,405 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,405 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,405 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,405 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,405 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,406 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,406 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,406 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,406 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,406 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,406 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,407 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,407 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,407 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,407 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,407 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,407 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,408 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,408 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,408 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,409 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,409 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,409 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,409 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,409 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,409 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,409 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,409 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,409 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,414 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,415 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,415 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,415 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,419 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,419 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,420 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,420 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,422 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,422 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,422 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,423 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,424 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,424 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,425 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,425 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,425 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,425 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,427 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,427 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,428 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,430 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,431 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,431 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,432 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,437 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,437 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,437 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,437 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,437 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,437 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,437 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,437 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,437 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,437 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,438 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,438 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,438 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,438 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,438 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,441 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,446 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,447 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,447 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,450 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,450 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,450 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,450 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,450 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,450 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,452 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,452 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,452 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,452 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,454 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,454 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,454 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,454 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,455 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,455 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,455 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,456 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,457 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,457 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,457 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,457 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:04:56,563 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2021-03-25 03:04:56,580 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-03-25 03:04:56,609 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 03:04:56,609 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 03:04:56,613 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 03:04:56,613 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 03:04:56,613 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 03:04:56,613 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 03:04:56,613 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 03:04:56,613 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 03:04:56,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 248 transitions, 876 flow [2021-03-25 03:04:56,724 INFO L129 PetriNetUnfolder]: 61/274 cut-off events. [2021-03-25 03:04:56,724 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-03-25 03:04:56,729 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 03:04:56,730 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 248 transitions, 876 flow [2021-03-25 03:04:56,736 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 140 transitions, 433 flow [2021-03-25 03:04:56,737 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:04:56,744 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 140 transitions, 433 flow [2021-03-25 03:04:56,746 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 140 transitions, 433 flow [2021-03-25 03:04:56,748 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 140 transitions, 433 flow [2021-03-25 03:04:56,791 INFO L129 PetriNetUnfolder]: 61/274 cut-off events. [2021-03-25 03:04:56,791 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-03-25 03:04:56,793 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 03:04:56,801 INFO L142 LiptonReduction]: Number of co-enabled transitions 4156 [2021-03-25 03:04:58,837 INFO L154 LiptonReduction]: Checked pairs total: 2005 [2021-03-25 03:04:58,837 INFO L156 LiptonReduction]: Total number of compositions: 60 [2021-03-25 03:04:58,839 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2103 [2021-03-25 03:04:58,845 INFO L129 PetriNetUnfolder]: 2/17 cut-off events. [2021-03-25 03:04:58,846 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 03:04:58,846 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:04:58,846 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:04:58,846 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 03:04:58,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:04:58,851 INFO L82 PathProgramCache]: Analyzing trace with hash -828543654, now seen corresponding path program 1 times [2021-03-25 03:04:58,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:04:58,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460423944] [2021-03-25 03:04:58,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:04:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:04:59,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:04:59,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:04:59,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:04:59,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:04:59,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:04:59,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:04:59,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:04:59,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:04:59,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:04:59,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:04:59,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:04:59,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:04:59,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:04:59,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:04:59,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:04:59,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:04:59,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 03:04:59,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460423944] [2021-03-25 03:04:59,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:04:59,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 03:04:59,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120529161] [2021-03-25 03:04:59,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:04:59,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:04:59,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:04:59,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:04:59,123 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 319 [2021-03-25 03:04:59,129 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 03:04:59,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:04:59,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 319 [2021-03-25 03:04:59,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:04:59,795 INFO L129 PetriNetUnfolder]: 2937/4425 cut-off events. [2021-03-25 03:04:59,795 INFO L130 PetriNetUnfolder]: For 1350/1355 co-relation queries the response was YES. [2021-03-25 03:04:59,810 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 03:04:59,839 INFO L132 encePairwiseOnDemand]: 306/319 looper letters, 75 selfloop transitions, 12 changer transitions 6/134 dead transitions. [2021-03-25 03:04:59,839 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 134 transitions, 640 flow [2021-03-25 03:04:59,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 03:04:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 03:04:59,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1918 transitions. [2021-03-25 03:04:59,859 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6012539184952979 [2021-03-25 03:04:59,859 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1918 transitions. [2021-03-25 03:04:59,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1918 transitions. [2021-03-25 03:04:59,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:04:59,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1918 transitions. [2021-03-25 03:04:59,874 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 03:04:59,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 03:04:59,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 03:04:59,894 INFO L185 Difference]: Start difference. First operand has 63 places, 84 transitions, 321 flow. Second operand 10 states and 1918 transitions. [2021-03-25 03:04:59,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 134 transitions, 640 flow [2021-03-25 03:04:59,905 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 03:04:59,909 INFO L241 Difference]: Finished difference. Result has 64 places, 87 transitions, 271 flow [2021-03-25 03:04:59,910 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 03:04:59,911 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places. [2021-03-25 03:04:59,911 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:04:59,911 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 87 transitions, 271 flow [2021-03-25 03:04:59,912 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 87 transitions, 271 flow [2021-03-25 03:04:59,913 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 87 transitions, 271 flow [2021-03-25 03:04:59,934 INFO L129 PetriNetUnfolder]: 115/269 cut-off events. [2021-03-25 03:04:59,934 INFO L130 PetriNetUnfolder]: For 12/13 co-relation queries the response was YES. [2021-03-25 03:04:59,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 03:04:59,938 INFO L142 LiptonReduction]: Number of co-enabled transitions 1404 [2021-03-25 03:05:00,087 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2021-03-25 03:05:00,244 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2021-03-25 03:05:01,040 INFO L154 LiptonReduction]: Checked pairs total: 165 [2021-03-25 03:05:01,040 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-25 03:05:01,040 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1129 [2021-03-25 03:05:01,041 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 77 transitions, 249 flow [2021-03-25 03:05:01,042 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 03:05:01,042 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:01,042 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:05:01,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 03:05:01,042 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 03:05:01,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:01,043 INFO L82 PathProgramCache]: Analyzing trace with hash -198967952, now seen corresponding path program 2 times [2021-03-25 03:05:01,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:01,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741613466] [2021-03-25 03:05:01,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:01,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:01,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:01,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:01,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:05:01,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:01,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:05:01,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:01,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:01,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:01,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:01,122 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 03:05:01,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741613466] [2021-03-25 03:05:01,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:01,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 03:05:01,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775292314] [2021-03-25 03:05:01,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 03:05:01,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:01,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 03:05:01,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 03:05:01,126 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 330 [2021-03-25 03:05:01,127 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 03:05:01,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:01,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 330 [2021-03-25 03:05:01,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:01,572 INFO L129 PetriNetUnfolder]: 3689/5210 cut-off events. [2021-03-25 03:05:01,572 INFO L130 PetriNetUnfolder]: For 1287/1287 co-relation queries the response was YES. [2021-03-25 03:05:01,585 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 03:05:01,610 INFO L132 encePairwiseOnDemand]: 323/330 looper letters, 58 selfloop transitions, 6 changer transitions 0/105 dead transitions. [2021-03-25 03:05:01,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 105 transitions, 459 flow [2021-03-25 03:05:01,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 03:05:01,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 03:05:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1412 transitions. [2021-03-25 03:05:01,614 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7131313131313132 [2021-03-25 03:05:01,614 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1412 transitions. [2021-03-25 03:05:01,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1412 transitions. [2021-03-25 03:05:01,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:01,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1412 transitions. [2021-03-25 03:05:01,617 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 03:05:01,620 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 03:05:01,621 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 03:05:01,621 INFO L185 Difference]: Start difference. First operand has 53 places, 77 transitions, 249 flow. Second operand 6 states and 1412 transitions. [2021-03-25 03:05:01,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 105 transitions, 459 flow [2021-03-25 03:05:01,639 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 03:05:01,642 INFO L241 Difference]: Finished difference. Result has 57 places, 81 transitions, 285 flow [2021-03-25 03:05:01,642 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 03:05:01,642 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, -6 predicate places. [2021-03-25 03:05:01,643 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:01,643 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 81 transitions, 285 flow [2021-03-25 03:05:01,643 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 81 transitions, 285 flow [2021-03-25 03:05:01,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 81 transitions, 285 flow [2021-03-25 03:05:01,666 INFO L129 PetriNetUnfolder]: 174/355 cut-off events. [2021-03-25 03:05:01,666 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2021-03-25 03:05:01,667 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 03:05:01,670 INFO L142 LiptonReduction]: Number of co-enabled transitions 1154 [2021-03-25 03:05:01,680 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:01,680 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:01,680 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-03-25 03:05:01,681 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 81 transitions, 285 flow [2021-03-25 03:05:01,682 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 03:05:01,682 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:01,682 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:05:01,682 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 03:05:01,682 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 03:05:01,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:01,683 INFO L82 PathProgramCache]: Analyzing trace with hash 571325816, now seen corresponding path program 1 times [2021-03-25 03:05:01,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:01,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943683300] [2021-03-25 03:05:01,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:01,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:01,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:05:01,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:01,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:05:01,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:01,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:05:01,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:01,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:01,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:01,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:01,785 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 03:05:01,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943683300] [2021-03-25 03:05:01,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:01,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 03:05:01,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114516089] [2021-03-25 03:05:01,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 03:05:01,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:01,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 03:05:01,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 03:05:01,792 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 330 [2021-03-25 03:05:01,793 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 03:05:01,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:01,793 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 330 [2021-03-25 03:05:01,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:02,517 INFO L129 PetriNetUnfolder]: 4641/6448 cut-off events. [2021-03-25 03:05:02,517 INFO L130 PetriNetUnfolder]: For 2624/2624 co-relation queries the response was YES. [2021-03-25 03:05:02,540 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 03:05:02,577 INFO L132 encePairwiseOnDemand]: 323/330 looper letters, 81 selfloop transitions, 13 changer transitions 0/132 dead transitions. [2021-03-25 03:05:02,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 132 transitions, 606 flow [2021-03-25 03:05:02,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:05:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:05:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1386 transitions. [2021-03-25 03:05:02,581 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6 [2021-03-25 03:05:02,581 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1386 transitions. [2021-03-25 03:05:02,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1386 transitions. [2021-03-25 03:05:02,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:02,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1386 transitions. [2021-03-25 03:05:02,585 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 03:05:02,588 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 03:05:02,590 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 03:05:02,590 INFO L185 Difference]: Start difference. First operand has 57 places, 81 transitions, 285 flow. Second operand 7 states and 1386 transitions. [2021-03-25 03:05:02,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 132 transitions, 606 flow [2021-03-25 03:05:02,602 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 03:05:02,604 INFO L241 Difference]: Finished difference. Result has 64 places, 83 transitions, 332 flow [2021-03-25 03:05:02,604 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 03:05:02,604 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places. [2021-03-25 03:05:02,604 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:02,604 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 83 transitions, 332 flow [2021-03-25 03:05:02,606 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 83 transitions, 332 flow [2021-03-25 03:05:02,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 83 transitions, 332 flow [2021-03-25 03:05:02,637 INFO L129 PetriNetUnfolder]: 230/456 cut-off events. [2021-03-25 03:05:02,637 INFO L130 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2021-03-25 03:05:02,639 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 03:05:02,643 INFO L142 LiptonReduction]: Number of co-enabled transitions 1222 [2021-03-25 03:05:02,657 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:02,658 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:02,658 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 54 [2021-03-25 03:05:02,659 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 83 transitions, 332 flow [2021-03-25 03:05:02,660 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 03:05:02,660 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:02,660 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:05:02,660 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 03:05:02,660 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 03:05:02,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:02,661 INFO L82 PathProgramCache]: Analyzing trace with hash -690009964, now seen corresponding path program 1 times [2021-03-25 03:05:02,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:02,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486910038] [2021-03-25 03:05:02,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:02,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:02,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:02,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:02,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:05:02,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:02,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:02,732 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 03:05:02,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486910038] [2021-03-25 03:05:02,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:02,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 03:05:02,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070959678] [2021-03-25 03:05:02,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 03:05:02,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:02,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 03:05:02,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 03:05:02,735 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 330 [2021-03-25 03:05:02,736 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 03:05:02,736 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:02,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 330 [2021-03-25 03:05:02,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:03,365 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= (select (select |v_#memory_int_100| v_~v~0.base_30) v_~v~0.offset_30) |v_ULTIMATE.start_main_#t~mem19_15|) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_15|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_30, #memory_int=|v_#memory_int_100|, ~v~0.base=v_~v~0.base_30} OutVars{~v~0.offset=v_~v~0.offset_30, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ~v~0.base=v_~v~0.base_30, 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 03:05:03,365 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,365 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,365 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,366 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,366 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= (select (select |v_#memory_int_100| v_~v~0.base_30) v_~v~0.offset_30) |v_ULTIMATE.start_main_#t~mem19_15|) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_15|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_30, #memory_int=|v_#memory_int_100|, ~v~0.base=v_~v~0.base_30} OutVars{~v~0.offset=v_~v~0.offset_30, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ~v~0.base=v_~v~0.base_30, 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 03:05:03,366 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,366 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,366 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,366 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,367 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= (select (select |v_#memory_int_100| v_~v~0.base_30) v_~v~0.offset_30) |v_ULTIMATE.start_main_#t~mem19_15|) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_15|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_30, #memory_int=|v_#memory_int_100|, ~v~0.base=v_~v~0.base_30} OutVars{~v~0.offset=v_~v~0.offset_30, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ~v~0.base=v_~v~0.base_30, 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 03:05:03,367 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,367 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,367 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,367 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,367 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= (select (select |v_#memory_int_100| v_~v~0.base_30) v_~v~0.offset_30) |v_ULTIMATE.start_main_#t~mem19_15|) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_15|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_30, #memory_int=|v_#memory_int_100|, ~v~0.base=v_~v~0.base_30} OutVars{~v~0.offset=v_~v~0.offset_30, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ~v~0.base=v_~v~0.base_30, 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 03:05:03,368 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,368 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,368 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,368 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,368 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= (select (select |v_#memory_int_100| v_~v~0.base_30) v_~v~0.offset_30) |v_ULTIMATE.start_main_#t~mem19_15|) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_15|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_30, #memory_int=|v_#memory_int_100|, ~v~0.base=v_~v~0.base_30} OutVars{~v~0.offset=v_~v~0.offset_30, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ~v~0.base=v_~v~0.base_30, 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 03:05:03,368 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,368 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,369 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,369 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,369 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= (select (select |v_#memory_int_100| v_~v~0.base_30) v_~v~0.offset_30) |v_ULTIMATE.start_main_#t~mem19_15|) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_15|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_30, #memory_int=|v_#memory_int_100|, ~v~0.base=v_~v~0.base_30} OutVars{~v~0.offset=v_~v~0.offset_30, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ~v~0.base=v_~v~0.base_30, 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 03:05:03,369 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,369 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,369 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,369 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:03,370 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= (select (select |v_#memory_int_100| v_~v~0.base_30) v_~v~0.offset_30) |v_ULTIMATE.start_main_#t~mem19_15|) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_15|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_30, #memory_int=|v_#memory_int_100|, ~v~0.base=v_~v~0.base_30} OutVars{~v~0.offset=v_~v~0.offset_30, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ~v~0.base=v_~v~0.base_30, 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 03:05:03,370 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-03-25 03:05:03,370 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 03:05:03,370 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 03:05:03,370 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 03:05:03,370 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= (select (select |v_#memory_int_100| v_~v~0.base_30) v_~v~0.offset_30) |v_ULTIMATE.start_main_#t~mem19_15|) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_15|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_30, #memory_int=|v_#memory_int_100|, ~v~0.base=v_~v~0.base_30} OutVars{~v~0.offset=v_~v~0.offset_30, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ~v~0.base=v_~v~0.base_30, 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 03:05:03,371 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-03-25 03:05:03,371 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 03:05:03,371 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 03:05:03,371 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 03:05:03,374 INFO L129 PetriNetUnfolder]: 5286/7883 cut-off events. [2021-03-25 03:05:03,374 INFO L130 PetriNetUnfolder]: For 8271/8273 co-relation queries the response was YES. [2021-03-25 03:05:03,413 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 03:05:03,464 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 49 selfloop transitions, 20 changer transitions 3/125 dead transitions. [2021-03-25 03:05:03,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 125 transitions, 600 flow [2021-03-25 03:05:03,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 03:05:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 03:05:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1350 transitions. [2021-03-25 03:05:03,467 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2021-03-25 03:05:03,467 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1350 transitions. [2021-03-25 03:05:03,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1350 transitions. [2021-03-25 03:05:03,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:03,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1350 transitions. [2021-03-25 03:05:03,470 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 03:05:03,474 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 03:05:03,475 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 03:05:03,475 INFO L185 Difference]: Start difference. First operand has 64 places, 83 transitions, 332 flow. Second operand 5 states and 1350 transitions. [2021-03-25 03:05:03,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 125 transitions, 600 flow [2021-03-25 03:05:03,537 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 03:05:03,541 INFO L241 Difference]: Finished difference. Result has 70 places, 103 transitions, 500 flow [2021-03-25 03:05:03,541 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 03:05:03,542 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 7 predicate places. [2021-03-25 03:05:03,542 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:03,542 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 103 transitions, 500 flow [2021-03-25 03:05:03,542 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 103 transitions, 500 flow [2021-03-25 03:05:03,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 103 transitions, 500 flow [2021-03-25 03:05:03,748 INFO L129 PetriNetUnfolder]: 1941/3440 cut-off events. [2021-03-25 03:05:03,748 INFO L130 PetriNetUnfolder]: For 2375/2429 co-relation queries the response was YES. [2021-03-25 03:05:03,768 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 03:05:03,803 INFO L142 LiptonReduction]: Number of co-enabled transitions 1916 [2021-03-25 03:05:03,809 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:03,809 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:03,809 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 267 [2021-03-25 03:05:03,810 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 103 transitions, 500 flow [2021-03-25 03:05:03,811 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 03:05:03,811 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:03,811 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:05:03,811 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 03:05:03,811 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 03:05:03,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:03,812 INFO L82 PathProgramCache]: Analyzing trace with hash 84474452, now seen corresponding path program 1 times [2021-03-25 03:05:03,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:03,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908371064] [2021-03-25 03:05:03,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:03,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:03,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:05:03,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:03,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 03:05:03,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:03,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:05:03,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:03,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:03,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:03,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:03,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 03:05:03,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908371064] [2021-03-25 03:05:03,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:03,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 03:05:03,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203243047] [2021-03-25 03:05:03,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 03:05:03,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:03,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 03:05:03,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 03:05:03,914 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 330 [2021-03-25 03:05:03,915 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 03:05:03,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:03,915 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 330 [2021-03-25 03:05:03,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:04,951 INFO L129 PetriNetUnfolder]: 8519/11785 cut-off events. [2021-03-25 03:05:04,952 INFO L130 PetriNetUnfolder]: For 17589/18036 co-relation queries the response was YES. [2021-03-25 03:05:05,023 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 03:05:05,076 INFO L132 encePairwiseOnDemand]: 322/330 looper letters, 90 selfloop transitions, 17 changer transitions 0/140 dead transitions. [2021-03-25 03:05:05,076 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 140 transitions, 859 flow [2021-03-25 03:05:05,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 03:05:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 03:05:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1533 transitions. [2021-03-25 03:05:05,081 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5806818181818182 [2021-03-25 03:05:05,081 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1533 transitions. [2021-03-25 03:05:05,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1533 transitions. [2021-03-25 03:05:05,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:05,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1533 transitions. [2021-03-25 03:05:05,085 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 03:05:05,089 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 03:05:05,089 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 03:05:05,090 INFO L185 Difference]: Start difference. First operand has 70 places, 103 transitions, 500 flow. Second operand 8 states and 1533 transitions. [2021-03-25 03:05:05,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 140 transitions, 859 flow [2021-03-25 03:05:05,148 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 03:05:05,150 INFO L241 Difference]: Finished difference. Result has 79 places, 104 transitions, 554 flow [2021-03-25 03:05:05,150 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 03:05:05,150 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 16 predicate places. [2021-03-25 03:05:05,150 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:05,151 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 104 transitions, 554 flow [2021-03-25 03:05:05,151 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 104 transitions, 554 flow [2021-03-25 03:05:05,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 104 transitions, 554 flow [2021-03-25 03:05:05,339 INFO L129 PetriNetUnfolder]: 1830/3290 cut-off events. [2021-03-25 03:05:05,340 INFO L130 PetriNetUnfolder]: For 2553/2607 co-relation queries the response was YES. [2021-03-25 03:05:05,356 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 03:05:05,387 INFO L142 LiptonReduction]: Number of co-enabled transitions 1904 [2021-03-25 03:05:05,393 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:05,393 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:05,393 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 243 [2021-03-25 03:05:05,396 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 104 transitions, 554 flow [2021-03-25 03:05:05,396 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 03:05:05,396 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:05,396 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:05:05,396 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 03:05:05,396 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 03:05:05,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:05,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1236858740, now seen corresponding path program 2 times [2021-03-25 03:05:05,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:05,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808224292] [2021-03-25 03:05:05,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:05,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:05,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:05,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:05,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:05:05,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:05,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:05,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:05,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:05:05,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:05,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:05:05,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:05,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:05,533 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 03:05:05,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808224292] [2021-03-25 03:05:05,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:05,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 03:05:05,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630314083] [2021-03-25 03:05:05,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 03:05:05,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:05,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 03:05:05,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 03:05:05,536 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 330 [2021-03-25 03:05:05,538 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 03:05:05,538 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:05,538 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 330 [2021-03-25 03:05:05,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:06,330 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= (select (select |v_#memory_int_100| v_~v~0.base_30) v_~v~0.offset_30) |v_ULTIMATE.start_main_#t~mem19_15|) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_15|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_30, #memory_int=|v_#memory_int_100|, ~v~0.base=v_~v~0.base_30} OutVars{~v~0.offset=v_~v~0.offset_30, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ~v~0.base=v_~v~0.base_30, 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 03:05:06,331 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:05:06,331 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:06,331 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:06,331 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:06,390 INFO L129 PetriNetUnfolder]: 5238/7890 cut-off events. [2021-03-25 03:05:06,390 INFO L130 PetriNetUnfolder]: For 18106/18452 co-relation queries the response was YES. [2021-03-25 03:05:06,424 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 03:05:06,467 INFO L132 encePairwiseOnDemand]: 317/330 looper letters, 59 selfloop transitions, 32 changer transitions 8/150 dead transitions. [2021-03-25 03:05:06,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 150 transitions, 1026 flow [2021-03-25 03:05:06,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:05:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:05:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2160 transitions. [2021-03-25 03:05:06,473 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2021-03-25 03:05:06,473 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2160 transitions. [2021-03-25 03:05:06,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2160 transitions. [2021-03-25 03:05:06,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:06,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2160 transitions. [2021-03-25 03:05:06,478 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 03:05:06,483 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 03:05:06,484 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 03:05:06,484 INFO L185 Difference]: Start difference. First operand has 79 places, 104 transitions, 554 flow. Second operand 9 states and 2160 transitions. [2021-03-25 03:05:06,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 150 transitions, 1026 flow [2021-03-25 03:05:06,648 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 03:05:06,651 INFO L241 Difference]: Finished difference. Result has 85 places, 115 transitions, 738 flow [2021-03-25 03:05:06,651 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 03:05:06,651 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 22 predicate places. [2021-03-25 03:05:06,652 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:06,652 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 115 transitions, 738 flow [2021-03-25 03:05:06,652 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 115 transitions, 738 flow [2021-03-25 03:05:06,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 115 transitions, 738 flow [2021-03-25 03:05:06,888 INFO L129 PetriNetUnfolder]: 2037/3612 cut-off events. [2021-03-25 03:05:06,889 INFO L130 PetriNetUnfolder]: For 6152/6311 co-relation queries the response was YES. [2021-03-25 03:05:06,903 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 03:05:06,930 INFO L142 LiptonReduction]: Number of co-enabled transitions 2092 [2021-03-25 03:05:06,936 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:06,936 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:06,936 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 284 [2021-03-25 03:05:06,937 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 115 transitions, 738 flow [2021-03-25 03:05:06,938 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 03:05:06,938 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:06,938 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:05:06,938 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 03:05:06,938 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 03:05:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:06,939 INFO L82 PathProgramCache]: Analyzing trace with hash -625668609, now seen corresponding path program 1 times [2021-03-25 03:05:06,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:06,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527472727] [2021-03-25 03:05:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:06,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:06,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:05:06,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:06,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 03:05:06,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:06,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:05:06,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:06,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:06,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:06,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:06,989 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 03:05:06,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527472727] [2021-03-25 03:05:06,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:06,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 03:05:06,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638057123] [2021-03-25 03:05:06,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 03:05:06,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:06,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 03:05:06,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 03:05:06,993 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 330 [2021-03-25 03:05:06,994 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 03:05:06,994 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:06,994 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 330 [2021-03-25 03:05:06,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:07,964 INFO L129 PetriNetUnfolder]: 7914/11145 cut-off events. [2021-03-25 03:05:07,964 INFO L130 PetriNetUnfolder]: For 36468/37081 co-relation queries the response was YES. [2021-03-25 03:05:07,994 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 03:05:08,035 INFO L132 encePairwiseOnDemand]: 322/330 looper letters, 102 selfloop transitions, 17 changer transitions 0/153 dead transitions. [2021-03-25 03:05:08,035 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 153 transitions, 1183 flow [2021-03-25 03:05:08,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 03:05:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 03:05:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1532 transitions. [2021-03-25 03:05:08,039 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5803030303030303 [2021-03-25 03:05:08,039 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1532 transitions. [2021-03-25 03:05:08,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1532 transitions. [2021-03-25 03:05:08,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:08,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1532 transitions. [2021-03-25 03:05:08,043 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 03:05:08,046 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 03:05:08,047 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 03:05:08,047 INFO L185 Difference]: Start difference. First operand has 83 places, 115 transitions, 738 flow. Second operand 8 states and 1532 transitions. [2021-03-25 03:05:08,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 153 transitions, 1183 flow [2021-03-25 03:05:08,152 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 03:05:08,155 INFO L241 Difference]: Finished difference. Result has 90 places, 116 transitions, 779 flow [2021-03-25 03:05:08,155 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 03:05:08,155 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 27 predicate places. [2021-03-25 03:05:08,155 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:08,156 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 116 transitions, 779 flow [2021-03-25 03:05:08,156 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 116 transitions, 779 flow [2021-03-25 03:05:08,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 116 transitions, 779 flow [2021-03-25 03:05:08,410 INFO L129 PetriNetUnfolder]: 1923/3456 cut-off events. [2021-03-25 03:05:08,410 INFO L130 PetriNetUnfolder]: For 5605/5762 co-relation queries the response was YES. [2021-03-25 03:05:08,420 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 03:05:08,443 INFO L142 LiptonReduction]: Number of co-enabled transitions 2082 [2021-03-25 03:05:08,448 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:08,449 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:08,449 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 294 [2021-03-25 03:05:08,449 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 116 transitions, 779 flow [2021-03-25 03:05:08,449 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 03:05:08,450 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:08,450 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:05:08,450 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 03:05:08,450 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 03:05:08,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:08,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1690315253, now seen corresponding path program 2 times [2021-03-25 03:05:08,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:08,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513763289] [2021-03-25 03:05:08,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:08,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:08,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:05:08,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:08,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:05:08,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:08,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:05:08,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:08,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:05:08,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:08,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:05:08,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:08,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:05:08,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:08,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:08,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:08,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:08,555 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 03:05:08,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513763289] [2021-03-25 03:05:08,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:08,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 03:05:08,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843502485] [2021-03-25 03:05:08,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 03:05:08,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:08,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 03:05:08,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 03:05:08,562 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 330 [2021-03-25 03:05:08,564 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 03:05:08,564 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:08,564 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 330 [2021-03-25 03:05:08,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:09,961 INFO L129 PetriNetUnfolder]: 11288/15578 cut-off events. [2021-03-25 03:05:09,962 INFO L130 PetriNetUnfolder]: For 54194/54808 co-relation queries the response was YES. [2021-03-25 03:05:10,074 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 03:05:10,110 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 130 selfloop transitions, 31 changer transitions 13/208 dead transitions. [2021-03-25 03:05:10,110 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 208 transitions, 1711 flow [2021-03-25 03:05:10,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:05:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:05:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1739 transitions. [2021-03-25 03:05:10,115 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5855218855218856 [2021-03-25 03:05:10,115 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1739 transitions. [2021-03-25 03:05:10,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1739 transitions. [2021-03-25 03:05:10,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:10,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1739 transitions. [2021-03-25 03:05:10,119 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 03:05:10,134 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 03:05:10,136 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 03:05:10,136 INFO L185 Difference]: Start difference. First operand has 90 places, 116 transitions, 779 flow. Second operand 9 states and 1739 transitions. [2021-03-25 03:05:10,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 208 transitions, 1711 flow [2021-03-25 03:05:10,234 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 03:05:10,237 INFO L241 Difference]: Finished difference. Result has 97 places, 122 transitions, 949 flow [2021-03-25 03:05:10,237 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 03:05:10,237 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 34 predicate places. [2021-03-25 03:05:10,237 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:10,237 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 122 transitions, 949 flow [2021-03-25 03:05:10,237 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 122 transitions, 949 flow [2021-03-25 03:05:10,238 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 97 places, 122 transitions, 949 flow [2021-03-25 03:05:10,578 INFO L129 PetriNetUnfolder]: 2706/4836 cut-off events. [2021-03-25 03:05:10,578 INFO L130 PetriNetUnfolder]: For 11949/12040 co-relation queries the response was YES. [2021-03-25 03:05:10,593 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 03:05:10,627 INFO L142 LiptonReduction]: Number of co-enabled transitions 2110 [2021-03-25 03:05:10,633 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:10,633 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:10,633 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 396 [2021-03-25 03:05:10,634 INFO L480 AbstractCegarLoop]: Abstraction has has 97 places, 122 transitions, 949 flow [2021-03-25 03:05:10,634 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 03:05:10,634 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:10,634 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:05:10,634 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 03:05:10,634 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 03:05:10,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:10,635 INFO L82 PathProgramCache]: Analyzing trace with hash -997086584, now seen corresponding path program 1 times [2021-03-25 03:05:10,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:10,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143170568] [2021-03-25 03:05:10,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:10,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:10,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:05:10,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:10,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:05:10,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:10,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:05:10,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:10,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:05:10,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:10,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:05:10,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:10,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:05:10,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:10,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:10,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:10,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:10,734 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 03:05:10,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143170568] [2021-03-25 03:05:10,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:10,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 03:05:10,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54988141] [2021-03-25 03:05:10,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 03:05:10,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:10,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 03:05:10,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 03:05:10,736 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 330 [2021-03-25 03:05:10,737 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 03:05:10,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:10,738 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 330 [2021-03-25 03:05:10,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:11,957 INFO L129 PetriNetUnfolder]: 10125/14110 cut-off events. [2021-03-25 03:05:11,957 INFO L130 PetriNetUnfolder]: For 63198/63841 co-relation queries the response was YES. [2021-03-25 03:05:12,018 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 03:05:12,055 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 105 selfloop transitions, 20 changer transitions 0/159 dead transitions. [2021-03-25 03:05:12,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 159 transitions, 1448 flow [2021-03-25 03:05:12,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:05:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:05:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1341 transitions. [2021-03-25 03:05:12,059 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5805194805194805 [2021-03-25 03:05:12,059 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1341 transitions. [2021-03-25 03:05:12,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1341 transitions. [2021-03-25 03:05:12,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:12,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1341 transitions. [2021-03-25 03:05:12,065 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 03:05:12,069 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 03:05:12,069 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 03:05:12,070 INFO L185 Difference]: Start difference. First operand has 97 places, 122 transitions, 949 flow. Second operand 7 states and 1341 transitions. [2021-03-25 03:05:12,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 159 transitions, 1448 flow [2021-03-25 03:05:12,200 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 03:05:12,202 INFO L241 Difference]: Finished difference. Result has 99 places, 127 transitions, 954 flow [2021-03-25 03:05:12,202 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 03:05:12,202 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 36 predicate places. [2021-03-25 03:05:12,202 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:12,202 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 127 transitions, 954 flow [2021-03-25 03:05:12,202 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 127 transitions, 954 flow [2021-03-25 03:05:12,203 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 127 transitions, 954 flow [2021-03-25 03:05:12,591 INFO L129 PetriNetUnfolder]: 2644/4740 cut-off events. [2021-03-25 03:05:12,591 INFO L130 PetriNetUnfolder]: For 7995/8067 co-relation queries the response was YES. [2021-03-25 03:05:12,607 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 03:05:12,632 INFO L142 LiptonReduction]: Number of co-enabled transitions 2108 [2021-03-25 03:05:12,637 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:12,637 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:12,638 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 436 [2021-03-25 03:05:12,638 INFO L480 AbstractCegarLoop]: Abstraction has has 99 places, 127 transitions, 954 flow [2021-03-25 03:05:12,639 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 03:05:12,639 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:12,639 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:05:12,639 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 03:05:12,639 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 03:05:12,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:12,639 INFO L82 PathProgramCache]: Analyzing trace with hash -952393357, now seen corresponding path program 3 times [2021-03-25 03:05:12,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:12,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277776988] [2021-03-25 03:05:12,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:12,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:12,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:05:12,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:12,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 03:05:12,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:12,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:05:12,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:12,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:05:12,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:12,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:05:12,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:12,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:05:12,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:12,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:05:12,792 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-03-25 03:05:12,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:05:12,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:12,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:12,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:12,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:12,812 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 03:05:12,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277776988] [2021-03-25 03:05:12,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:12,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 03:05:12,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453652645] [2021-03-25 03:05:12,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 03:05:12,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:12,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 03:05:12,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-03-25 03:05:12,816 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 330 [2021-03-25 03:05:12,817 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 03:05:12,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:12,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 330 [2021-03-25 03:05:12,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:14,463 INFO L129 PetriNetUnfolder]: 11262/15600 cut-off events. [2021-03-25 03:05:14,463 INFO L130 PetriNetUnfolder]: For 55941/56541 co-relation queries the response was YES. [2021-03-25 03:05:14,576 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 03:05:14,621 INFO L132 encePairwiseOnDemand]: 319/330 looper letters, 120 selfloop transitions, 44 changer transitions 0/198 dead transitions. [2021-03-25 03:05:14,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 198 transitions, 1822 flow [2021-03-25 03:05:14,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 03:05:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 03:05:14,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2069 transitions. [2021-03-25 03:05:14,627 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5699724517906336 [2021-03-25 03:05:14,628 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2069 transitions. [2021-03-25 03:05:14,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2069 transitions. [2021-03-25 03:05:14,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:14,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2069 transitions. [2021-03-25 03:05:14,633 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 03:05:14,638 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 03:05:14,639 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 03:05:14,639 INFO L185 Difference]: Start difference. First operand has 99 places, 127 transitions, 954 flow. Second operand 11 states and 2069 transitions. [2021-03-25 03:05:14,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 198 transitions, 1822 flow [2021-03-25 03:05:14,695 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 03:05:14,698 INFO L241 Difference]: Finished difference. Result has 112 places, 146 transitions, 1262 flow [2021-03-25 03:05:14,698 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 03:05:14,699 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 49 predicate places. [2021-03-25 03:05:14,699 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:14,699 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 146 transitions, 1262 flow [2021-03-25 03:05:14,699 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 146 transitions, 1262 flow [2021-03-25 03:05:14,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 146 transitions, 1262 flow [2021-03-25 03:05:15,013 INFO L129 PetriNetUnfolder]: 2809/4982 cut-off events. [2021-03-25 03:05:15,013 INFO L130 PetriNetUnfolder]: For 9464/9605 co-relation queries the response was YES. [2021-03-25 03:05:15,042 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 03:05:15,087 INFO L142 LiptonReduction]: Number of co-enabled transitions 2238 [2021-03-25 03:05:15,094 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:15,094 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:15,094 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 395 [2021-03-25 03:05:15,095 INFO L480 AbstractCegarLoop]: Abstraction has has 112 places, 146 transitions, 1262 flow [2021-03-25 03:05:15,096 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 03:05:15,096 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:15,096 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 03:05:15,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 03:05:15,096 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 03:05:15,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:15,097 INFO L82 PathProgramCache]: Analyzing trace with hash -134167346, now seen corresponding path program 1 times [2021-03-25 03:05:15,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:15,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505104458] [2021-03-25 03:05:15,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:15,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:15,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:15,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:15,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:05:15,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:15,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:15,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:15,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:05:15,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:15,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:05:15,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:15,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:15,182 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 03:05:15,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505104458] [2021-03-25 03:05:15,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:15,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 03:05:15,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811708830] [2021-03-25 03:05:15,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 03:05:15,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:15,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 03:05:15,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 03:05:15,185 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 330 [2021-03-25 03:05:15,186 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 03:05:15,186 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:15,186 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 330 [2021-03-25 03:05:15,186 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:16,133 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= (select (select |v_#memory_int_100| v_~v~0.base_30) v_~v~0.offset_30) |v_ULTIMATE.start_main_#t~mem19_15|) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_15|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_30, #memory_int=|v_#memory_int_100|, ~v~0.base=v_~v~0.base_30} OutVars{~v~0.offset=v_~v~0.offset_30, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ~v~0.base=v_~v~0.base_30, 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 03:05:16,134 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:05:16,134 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:16,134 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:16,134 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:05:16,141 INFO L129 PetriNetUnfolder]: 6899/10530 cut-off events. [2021-03-25 03:05:16,141 INFO L130 PetriNetUnfolder]: For 48997/49542 co-relation queries the response was YES. [2021-03-25 03:05:16,206 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 03:05:16,252 INFO L132 encePairwiseOnDemand]: 317/330 looper letters, 90 selfloop transitions, 46 changer transitions 2/195 dead transitions. [2021-03-25 03:05:16,252 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 195 transitions, 1935 flow [2021-03-25 03:05:16,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:05:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:05:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1684 transitions. [2021-03-25 03:05:16,256 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.729004329004329 [2021-03-25 03:05:16,257 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1684 transitions. [2021-03-25 03:05:16,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1684 transitions. [2021-03-25 03:05:16,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:16,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1684 transitions. [2021-03-25 03:05:16,260 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 03:05:16,264 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 03:05:16,264 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 03:05:16,264 INFO L185 Difference]: Start difference. First operand has 112 places, 146 transitions, 1262 flow. Second operand 7 states and 1684 transitions. [2021-03-25 03:05:16,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 195 transitions, 1935 flow [2021-03-25 03:05:16,358 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 03:05:16,361 INFO L241 Difference]: Finished difference. Result has 118 places, 162 transitions, 1601 flow [2021-03-25 03:05:16,361 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 03:05:16,361 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 55 predicate places. [2021-03-25 03:05:16,361 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:16,361 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 162 transitions, 1601 flow [2021-03-25 03:05:16,362 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 162 transitions, 1601 flow [2021-03-25 03:05:16,363 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 118 places, 162 transitions, 1601 flow [2021-03-25 03:05:16,685 INFO L129 PetriNetUnfolder]: 2900/5188 cut-off events. [2021-03-25 03:05:16,686 INFO L130 PetriNetUnfolder]: For 15788/16017 co-relation queries the response was YES. [2021-03-25 03:05:16,714 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 03:05:16,758 INFO L142 LiptonReduction]: Number of co-enabled transitions 2484 [2021-03-25 03:05:16,764 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:16,764 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:16,764 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 403 [2021-03-25 03:05:16,764 INFO L480 AbstractCegarLoop]: Abstraction has has 118 places, 162 transitions, 1601 flow [2021-03-25 03:05:16,765 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 03:05:16,765 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:16,765 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 03:05:16,765 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 03:05:16,765 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 03:05:16,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:16,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1459150374, now seen corresponding path program 1 times [2021-03-25 03:05:16,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:16,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397946971] [2021-03-25 03:05:16,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:16,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:16,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:05:16,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:16,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:05:16,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:16,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:05:16,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:16,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:05:16,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:16,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:05:16,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:16,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:05:16,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:16,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:16,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:16,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:16,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 03:05:16,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397946971] [2021-03-25 03:05:16,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:16,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 03:05:16,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632366710] [2021-03-25 03:05:16,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 03:05:16,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:16,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 03:05:16,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-25 03:05:16,894 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 330 [2021-03-25 03:05:16,895 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 03:05:16,895 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:16,895 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 330 [2021-03-25 03:05:16,895 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:18,640 INFO L129 PetriNetUnfolder]: 12322/17346 cut-off events. [2021-03-25 03:05:18,640 INFO L130 PetriNetUnfolder]: For 109182/109812 co-relation queries the response was YES. [2021-03-25 03:05:18,731 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 03:05:18,769 INFO L132 encePairwiseOnDemand]: 318/330 looper letters, 127 selfloop transitions, 32 changer transitions 9/206 dead transitions. [2021-03-25 03:05:18,770 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 206 transitions, 2348 flow [2021-03-25 03:05:18,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:05:18,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:05:18,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1700 transitions. [2021-03-25 03:05:18,773 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5723905723905723 [2021-03-25 03:05:18,773 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1700 transitions. [2021-03-25 03:05:18,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1700 transitions. [2021-03-25 03:05:18,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:18,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1700 transitions. [2021-03-25 03:05:18,776 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 03:05:18,780 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 03:05:18,780 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 03:05:18,780 INFO L185 Difference]: Start difference. First operand has 118 places, 162 transitions, 1601 flow. Second operand 9 states and 1700 transitions. [2021-03-25 03:05:18,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 206 transitions, 2348 flow [2021-03-25 03:05:18,976 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 03:05:18,978 INFO L241 Difference]: Finished difference. Result has 126 places, 159 transitions, 1670 flow [2021-03-25 03:05:18,979 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 03:05:18,979 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 63 predicate places. [2021-03-25 03:05:18,979 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:18,979 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 159 transitions, 1670 flow [2021-03-25 03:05:18,979 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 159 transitions, 1670 flow [2021-03-25 03:05:18,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 159 transitions, 1670 flow [2021-03-25 03:05:19,284 INFO L129 PetriNetUnfolder]: 3115/5642 cut-off events. [2021-03-25 03:05:19,285 INFO L130 PetriNetUnfolder]: For 17567/17812 co-relation queries the response was YES. [2021-03-25 03:05:19,316 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 03:05:19,367 INFO L142 LiptonReduction]: Number of co-enabled transitions 2596 [2021-03-25 03:05:19,373 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:19,373 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:19,373 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 394 [2021-03-25 03:05:19,374 INFO L480 AbstractCegarLoop]: Abstraction has has 126 places, 159 transitions, 1670 flow [2021-03-25 03:05:19,374 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 03:05:19,374 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:19,374 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 03:05:19,374 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 03:05:19,375 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 03:05:19,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:19,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1550777458, now seen corresponding path program 2 times [2021-03-25 03:05:19,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:19,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562809951] [2021-03-25 03:05:19,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:19,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:19,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:05:19,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:19,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:05:19,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:19,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:05:19,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:19,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:05:19,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:19,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:05:19,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:19,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:19,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:19,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:19,452 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 03:05:19,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562809951] [2021-03-25 03:05:19,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:19,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 03:05:19,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438656004] [2021-03-25 03:05:19,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:05:19,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:19,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:05:19,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:05:19,455 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 330 [2021-03-25 03:05:19,456 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 03:05:19,456 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:19,456 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 330 [2021-03-25 03:05:19,456 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:21,112 INFO L129 PetriNetUnfolder]: 13430/18888 cut-off events. [2021-03-25 03:05:21,112 INFO L130 PetriNetUnfolder]: For 125170/125839 co-relation queries the response was YES. [2021-03-25 03:05:21,203 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 03:05:21,256 INFO L132 encePairwiseOnDemand]: 321/330 looper letters, 184 selfloop transitions, 27 changer transitions 0/249 dead transitions. [2021-03-25 03:05:21,257 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 249 transitions, 2878 flow [2021-03-25 03:05:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:05:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:05:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1738 transitions. [2021-03-25 03:05:21,260 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5851851851851851 [2021-03-25 03:05:21,261 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1738 transitions. [2021-03-25 03:05:21,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1738 transitions. [2021-03-25 03:05:21,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:21,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1738 transitions. [2021-03-25 03:05:21,264 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 03:05:21,267 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 03:05:21,267 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 03:05:21,267 INFO L185 Difference]: Start difference. First operand has 126 places, 159 transitions, 1670 flow. Second operand 9 states and 1738 transitions. [2021-03-25 03:05:21,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 249 transitions, 2878 flow [2021-03-25 03:05:21,394 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 03:05:21,398 INFO L241 Difference]: Finished difference. Result has 130 places, 165 transitions, 1761 flow [2021-03-25 03:05:21,398 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 03:05:21,398 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 67 predicate places. [2021-03-25 03:05:21,398 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:21,398 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 165 transitions, 1761 flow [2021-03-25 03:05:21,398 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 165 transitions, 1761 flow [2021-03-25 03:05:21,400 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 165 transitions, 1761 flow [2021-03-25 03:05:21,734 INFO L129 PetriNetUnfolder]: 3396/6066 cut-off events. [2021-03-25 03:05:21,734 INFO L130 PetriNetUnfolder]: For 19770/20129 co-relation queries the response was YES. [2021-03-25 03:05:21,765 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 03:05:21,809 INFO L142 LiptonReduction]: Number of co-enabled transitions 2716 [2021-03-25 03:05:21,814 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:21,814 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:21,815 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 417 [2021-03-25 03:05:21,815 INFO L480 AbstractCegarLoop]: Abstraction has has 130 places, 165 transitions, 1761 flow [2021-03-25 03:05:21,815 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 03:05:21,815 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:21,816 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 03:05:21,816 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 03:05:21,816 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 03:05:21,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:21,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1503408134, now seen corresponding path program 1 times [2021-03-25 03:05:21,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:21,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354760984] [2021-03-25 03:05:21,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:21,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:21,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:05:21,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:21,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:05:21,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:21,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:05:21,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:21,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:05:21,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:21,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:05:21,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:21,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:21,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:21,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:21,884 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 03:05:21,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354760984] [2021-03-25 03:05:21,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:21,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 03:05:21,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146826080] [2021-03-25 03:05:21,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:05:21,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:21,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:05:21,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:05:21,886 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 330 [2021-03-25 03:05:21,887 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 03:05:21,887 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:21,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 330 [2021-03-25 03:05:21,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:23,313 INFO L129 PetriNetUnfolder]: 12866/18286 cut-off events. [2021-03-25 03:05:23,314 INFO L130 PetriNetUnfolder]: For 122688/123431 co-relation queries the response was YES. [2021-03-25 03:05:23,438 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 03:05:23,485 INFO L132 encePairwiseOnDemand]: 321/330 looper letters, 154 selfloop transitions, 15 changer transitions 0/207 dead transitions. [2021-03-25 03:05:23,485 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 207 transitions, 2464 flow [2021-03-25 03:05:23,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:05:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:05:23,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1342 transitions. [2021-03-25 03:05:23,488 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2021-03-25 03:05:23,488 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1342 transitions. [2021-03-25 03:05:23,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1342 transitions. [2021-03-25 03:05:23,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:23,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1342 transitions. [2021-03-25 03:05:23,491 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 03:05:23,493 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 03:05:23,493 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 03:05:23,493 INFO L185 Difference]: Start difference. First operand has 130 places, 165 transitions, 1761 flow. Second operand 7 states and 1342 transitions. [2021-03-25 03:05:23,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 207 transitions, 2464 flow [2021-03-25 03:05:23,651 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 03:05:23,653 INFO L241 Difference]: Finished difference. Result has 133 places, 165 transitions, 1713 flow [2021-03-25 03:05:23,654 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 03:05:23,654 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 70 predicate places. [2021-03-25 03:05:23,654 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:23,654 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 165 transitions, 1713 flow [2021-03-25 03:05:23,654 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 165 transitions, 1713 flow [2021-03-25 03:05:23,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 133 places, 165 transitions, 1713 flow [2021-03-25 03:05:23,979 INFO L129 PetriNetUnfolder]: 3388/6112 cut-off events. [2021-03-25 03:05:23,979 INFO L130 PetriNetUnfolder]: For 16650/16943 co-relation queries the response was YES. [2021-03-25 03:05:24,025 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 03:05:24,075 INFO L142 LiptonReduction]: Number of co-enabled transitions 2702 [2021-03-25 03:05:24,080 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:24,080 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:24,080 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 426 [2021-03-25 03:05:24,080 INFO L480 AbstractCegarLoop]: Abstraction has has 133 places, 165 transitions, 1713 flow [2021-03-25 03:05:24,080 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 03:05:24,081 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:24,081 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 03:05:24,081 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 03:05:24,081 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 03:05:24,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:24,081 INFO L82 PathProgramCache]: Analyzing trace with hash -998949896, now seen corresponding path program 3 times [2021-03-25 03:05:24,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:24,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558553550] [2021-03-25 03:05:24,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:24,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:24,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:05:24,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:24,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 03:05:24,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:24,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:05:24,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:24,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:05:24,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:24,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:05:24,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:24,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:05:24,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:24,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:05:24,236 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-03-25 03:05:24,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:05:24,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:24,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:24,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:24,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:24,252 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 03:05:24,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558553550] [2021-03-25 03:05:24,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:24,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 03:05:24,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455738427] [2021-03-25 03:05:24,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 03:05:24,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:24,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 03:05:24,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-25 03:05:24,255 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 330 [2021-03-25 03:05:24,256 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 03:05:24,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:24,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 330 [2021-03-25 03:05:24,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:26,237 INFO L129 PetriNetUnfolder]: 13671/19241 cut-off events. [2021-03-25 03:05:26,237 INFO L130 PetriNetUnfolder]: For 115349/115924 co-relation queries the response was YES. [2021-03-25 03:05:26,353 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 03:05:26,398 INFO L132 encePairwiseOnDemand]: 318/330 looper letters, 125 selfloop transitions, 56 changer transitions 0/219 dead transitions. [2021-03-25 03:05:26,398 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 219 transitions, 2591 flow [2021-03-25 03:05:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 03:05:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 03:05:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1875 transitions. [2021-03-25 03:05:26,400 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2021-03-25 03:05:26,400 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1875 transitions. [2021-03-25 03:05:26,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1875 transitions. [2021-03-25 03:05:26,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:26,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1875 transitions. [2021-03-25 03:05:26,403 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 03:05:26,405 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 03:05:26,406 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 03:05:26,406 INFO L185 Difference]: Start difference. First operand has 133 places, 165 transitions, 1713 flow. Second operand 10 states and 1875 transitions. [2021-03-25 03:05:26,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 219 transitions, 2591 flow [2021-03-25 03:05:26,777 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 03:05:26,780 INFO L241 Difference]: Finished difference. Result has 139 places, 175 transitions, 1938 flow [2021-03-25 03:05:26,780 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 03:05:26,780 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 76 predicate places. [2021-03-25 03:05:26,780 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:26,780 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 175 transitions, 1938 flow [2021-03-25 03:05:26,780 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 175 transitions, 1938 flow [2021-03-25 03:05:26,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 139 places, 175 transitions, 1938 flow [2021-03-25 03:05:27,206 INFO L129 PetriNetUnfolder]: 3607/6582 cut-off events. [2021-03-25 03:05:27,207 INFO L130 PetriNetUnfolder]: For 17079/17273 co-relation queries the response was YES. [2021-03-25 03:05:27,247 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 03:05:27,308 INFO L142 LiptonReduction]: Number of co-enabled transitions 2776 [2021-03-25 03:05:27,314 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:27,314 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:27,314 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 534 [2021-03-25 03:05:27,314 INFO L480 AbstractCegarLoop]: Abstraction has has 139 places, 175 transitions, 1938 flow [2021-03-25 03:05:27,315 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 03:05:27,315 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:27,315 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 03:05:27,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 03:05:27,315 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 03:05:27,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:27,315 INFO L82 PathProgramCache]: Analyzing trace with hash 57606416, now seen corresponding path program 1 times [2021-03-25 03:05:27,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:27,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536616674] [2021-03-25 03:05:27,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:27,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:27,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 03:05:27,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:27,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:05:27,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:27,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 03:05:27,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:27,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:05:27,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:27,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:05:27,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:27,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:05:27,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:27,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:05:27,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:27,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:05:27,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:27,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:27,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:27,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:27,430 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 03:05:27,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536616674] [2021-03-25 03:05:27,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:27,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 03:05:27,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678732723] [2021-03-25 03:05:27,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 03:05:27,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:27,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 03:05:27,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-25 03:05:27,434 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 330 [2021-03-25 03:05:27,435 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 03:05:27,435 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:27,435 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 330 [2021-03-25 03:05:27,435 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:29,481 INFO L129 PetriNetUnfolder]: 14664/20437 cut-off events. [2021-03-25 03:05:29,481 INFO L130 PetriNetUnfolder]: For 117417/117972 co-relation queries the response was YES. [2021-03-25 03:05:29,627 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 03:05:29,686 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 167 selfloop transitions, 65 changer transitions 0/267 dead transitions. [2021-03-25 03:05:29,686 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 267 transitions, 3175 flow [2021-03-25 03:05:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 03:05:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 03:05:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2065 transitions. [2021-03-25 03:05:29,688 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.568870523415978 [2021-03-25 03:05:29,688 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2065 transitions. [2021-03-25 03:05:29,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2065 transitions. [2021-03-25 03:05:29,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:29,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2065 transitions. [2021-03-25 03:05:29,691 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 03:05:29,693 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 03:05:29,693 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 03:05:29,693 INFO L185 Difference]: Start difference. First operand has 139 places, 175 transitions, 1938 flow. Second operand 11 states and 2065 transitions. [2021-03-25 03:05:29,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 267 transitions, 3175 flow [2021-03-25 03:05:29,809 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 03:05:29,812 INFO L241 Difference]: Finished difference. Result has 149 places, 187 transitions, 2292 flow [2021-03-25 03:05:29,812 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 03:05:29,812 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 86 predicate places. [2021-03-25 03:05:29,812 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:29,812 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 187 transitions, 2292 flow [2021-03-25 03:05:29,812 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 187 transitions, 2292 flow [2021-03-25 03:05:29,814 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 149 places, 187 transitions, 2292 flow [2021-03-25 03:05:30,259 INFO L129 PetriNetUnfolder]: 3711/6647 cut-off events. [2021-03-25 03:05:30,259 INFO L130 PetriNetUnfolder]: For 20225/20525 co-relation queries the response was YES. [2021-03-25 03:05:30,302 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 03:05:30,364 INFO L142 LiptonReduction]: Number of co-enabled transitions 2896 [2021-03-25 03:05:30,371 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:30,372 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:30,372 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 560 [2021-03-25 03:05:30,372 INFO L480 AbstractCegarLoop]: Abstraction has has 149 places, 187 transitions, 2292 flow [2021-03-25 03:05:30,372 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 03:05:30,372 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:30,372 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 03:05:30,373 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 03:05:30,373 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 03:05:30,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:30,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1630737890, now seen corresponding path program 2 times [2021-03-25 03:05:30,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:30,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745215670] [2021-03-25 03:05:30,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:30,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:30,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:05:30,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:30,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 03:05:30,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:30,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 03:05:30,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:30,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:05:30,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:30,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:05:30,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:30,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:05:30,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:30,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 03:05:30,497 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-03-25 03:05:30,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:05:30,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:30,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:30,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:30,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:30,520 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 03:05:30,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745215670] [2021-03-25 03:05:30,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:30,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 03:05:30,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087597603] [2021-03-25 03:05:30,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 03:05:30,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:30,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 03:05:30,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-03-25 03:05:30,526 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 330 [2021-03-25 03:05:30,527 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 03:05:30,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:30,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 330 [2021-03-25 03:05:30,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:32,873 INFO L129 PetriNetUnfolder]: 14863/20854 cut-off events. [2021-03-25 03:05:32,874 INFO L130 PetriNetUnfolder]: For 130194/130802 co-relation queries the response was YES. [2021-03-25 03:05:33,036 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 03:05:33,088 INFO L132 encePairwiseOnDemand]: 318/330 looper letters, 136 selfloop transitions, 66 changer transitions 0/237 dead transitions. [2021-03-25 03:05:33,088 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 237 transitions, 3203 flow [2021-03-25 03:05:33,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-25 03:05:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-25 03:05:33,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2415 transitions. [2021-03-25 03:05:33,090 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5629370629370629 [2021-03-25 03:05:33,090 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2415 transitions. [2021-03-25 03:05:33,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2415 transitions. [2021-03-25 03:05:33,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:33,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2415 transitions. [2021-03-25 03:05:33,092 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 03:05:33,095 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 03:05:33,095 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 03:05:33,095 INFO L185 Difference]: Start difference. First operand has 149 places, 187 transitions, 2292 flow. Second operand 13 states and 2415 transitions. [2021-03-25 03:05:33,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 237 transitions, 3203 flow [2021-03-25 03:05:33,280 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 03:05:33,283 INFO L241 Difference]: Finished difference. Result has 164 places, 202 transitions, 2729 flow [2021-03-25 03:05:33,284 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 03:05:33,284 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 101 predicate places. [2021-03-25 03:05:33,284 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:33,284 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 202 transitions, 2729 flow [2021-03-25 03:05:33,284 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 202 transitions, 2729 flow [2021-03-25 03:05:33,285 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 164 places, 202 transitions, 2729 flow [2021-03-25 03:05:33,717 INFO L129 PetriNetUnfolder]: 3863/6978 cut-off events. [2021-03-25 03:05:33,717 INFO L130 PetriNetUnfolder]: For 24034/24405 co-relation queries the response was YES. [2021-03-25 03:05:33,759 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 03:05:33,816 INFO L142 LiptonReduction]: Number of co-enabled transitions 3012 [2021-03-25 03:05:33,825 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:33,825 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:33,825 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 541 [2021-03-25 03:05:33,825 INFO L480 AbstractCegarLoop]: Abstraction has has 164 places, 202 transitions, 2729 flow [2021-03-25 03:05:33,826 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 03:05:33,826 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:33,826 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 03:05:33,826 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 03:05:33,826 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 03:05:33,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:33,826 INFO L82 PathProgramCache]: Analyzing trace with hash 551550375, now seen corresponding path program 1 times [2021-03-25 03:05:33,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:33,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890757446] [2021-03-25 03:05:33,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:33,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:33,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:05:33,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:33,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 03:05:33,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:33,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 03:05:33,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:33,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:05:33,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:33,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:05:33,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:33,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:05:33,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:33,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:05:33,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:33,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:05:34,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:34,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:05:34,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:34,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:34,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:34,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:34,027 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 03:05:34,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890757446] [2021-03-25 03:05:34,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:34,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 03:05:34,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653452620] [2021-03-25 03:05:34,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 03:05:34,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:34,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 03:05:34,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-03-25 03:05:34,030 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 330 [2021-03-25 03:05:34,030 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 03:05:34,031 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:34,031 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 330 [2021-03-25 03:05:34,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:36,624 INFO L129 PetriNetUnfolder]: 16461/23110 cut-off events. [2021-03-25 03:05:36,624 INFO L130 PetriNetUnfolder]: For 166298/166791 co-relation queries the response was YES. [2021-03-25 03:05:36,900 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 03:05:36,964 INFO L132 encePairwiseOnDemand]: 317/330 looper letters, 194 selfloop transitions, 68 changer transitions 0/297 dead transitions. [2021-03-25 03:05:36,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 297 transitions, 4437 flow [2021-03-25 03:05:36,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 03:05:36,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 03:05:36,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1865 transitions. [2021-03-25 03:05:36,965 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5651515151515152 [2021-03-25 03:05:36,966 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1865 transitions. [2021-03-25 03:05:36,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1865 transitions. [2021-03-25 03:05:36,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:36,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1865 transitions. [2021-03-25 03:05:36,967 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 03:05:36,969 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 03:05:36,969 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 03:05:36,969 INFO L185 Difference]: Start difference. First operand has 164 places, 202 transitions, 2729 flow. Second operand 10 states and 1865 transitions. [2021-03-25 03:05:36,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 297 transitions, 4437 flow [2021-03-25 03:05:37,317 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 03:05:37,320 INFO L241 Difference]: Finished difference. Result has 171 places, 218 transitions, 3018 flow [2021-03-25 03:05:37,321 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 03:05:37,321 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 108 predicate places. [2021-03-25 03:05:37,321 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:37,321 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 218 transitions, 3018 flow [2021-03-25 03:05:37,321 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 218 transitions, 3018 flow [2021-03-25 03:05:37,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 171 places, 218 transitions, 3018 flow [2021-03-25 03:05:37,813 INFO L129 PetriNetUnfolder]: 4060/7293 cut-off events. [2021-03-25 03:05:37,813 INFO L130 PetriNetUnfolder]: For 27810/28105 co-relation queries the response was YES. [2021-03-25 03:05:37,857 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 03:05:37,915 INFO L142 LiptonReduction]: Number of co-enabled transitions 3098 [2021-03-25 03:05:37,923 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:37,923 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:37,923 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 602 [2021-03-25 03:05:37,923 INFO L480 AbstractCegarLoop]: Abstraction has has 171 places, 218 transitions, 3018 flow [2021-03-25 03:05:37,923 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 03:05:37,924 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:37,924 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 03:05:37,924 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 03:05:37,924 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 03:05:37,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:37,924 INFO L82 PathProgramCache]: Analyzing trace with hash 758589394, now seen corresponding path program 2 times [2021-03-25 03:05:37,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:37,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372093619] [2021-03-25 03:05:37,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:37,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:37,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:37,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:37,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 03:05:37,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:37,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 03:05:37,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:37,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:05:37,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:37,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:05:37,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:37,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:05:37,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:37,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:37,995 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 03:05:37,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372093619] [2021-03-25 03:05:37,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:37,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 03:05:37,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998853499] [2021-03-25 03:05:37,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:05:37,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:37,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:05:37,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:05:37,998 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 330 [2021-03-25 03:05:37,999 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 03:05:37,999 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:37,999 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 330 [2021-03-25 03:05:37,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:39,494 INFO L129 PetriNetUnfolder]: 9678/14827 cut-off events. [2021-03-25 03:05:39,494 INFO L130 PetriNetUnfolder]: For 133029/134019 co-relation queries the response was YES. [2021-03-25 03:05:39,603 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 03:05:39,656 INFO L132 encePairwiseOnDemand]: 318/330 looper letters, 135 selfloop transitions, 77 changer transitions 2/276 dead transitions. [2021-03-25 03:05:39,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 276 transitions, 4123 flow [2021-03-25 03:05:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:05:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:05:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1662 transitions. [2021-03-25 03:05:39,658 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7194805194805195 [2021-03-25 03:05:39,658 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1662 transitions. [2021-03-25 03:05:39,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1662 transitions. [2021-03-25 03:05:39,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:39,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1662 transitions. [2021-03-25 03:05:39,660 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 03:05:39,662 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 03:05:39,662 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 03:05:39,662 INFO L185 Difference]: Start difference. First operand has 171 places, 218 transitions, 3018 flow. Second operand 7 states and 1662 transitions. [2021-03-25 03:05:39,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 276 transitions, 4123 flow [2021-03-25 03:05:39,976 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 03:05:39,979 INFO L241 Difference]: Finished difference. Result has 176 places, 235 transitions, 3477 flow [2021-03-25 03:05:39,979 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 03:05:39,979 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 113 predicate places. [2021-03-25 03:05:39,980 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:39,980 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 235 transitions, 3477 flow [2021-03-25 03:05:39,980 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 235 transitions, 3477 flow [2021-03-25 03:05:39,982 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 176 places, 235 transitions, 3477 flow [2021-03-25 03:05:40,491 INFO L129 PetriNetUnfolder]: 4226/7629 cut-off events. [2021-03-25 03:05:40,491 INFO L130 PetriNetUnfolder]: For 38116/38463 co-relation queries the response was YES. [2021-03-25 03:05:40,543 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 03:05:40,610 INFO L142 LiptonReduction]: Number of co-enabled transitions 3288 [2021-03-25 03:05:40,620 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:40,620 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:40,620 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 640 [2021-03-25 03:05:40,621 INFO L480 AbstractCegarLoop]: Abstraction has has 176 places, 235 transitions, 3477 flow [2021-03-25 03:05:40,621 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 03:05:40,621 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:40,621 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 03:05:40,621 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-25 03:05:40,621 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 03:05:40,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:40,622 INFO L82 PathProgramCache]: Analyzing trace with hash 750841812, now seen corresponding path program 3 times [2021-03-25 03:05:40,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:40,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160228551] [2021-03-25 03:05:40,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:40,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:40,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 03:05:40,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:40,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:05:40,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:40,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 03:05:40,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:40,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:05:40,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:40,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:05:40,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:40,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:05:40,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:40,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:05:40,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:40,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:05:40,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:40,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:40,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:40,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:40,725 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 03:05:40,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160228551] [2021-03-25 03:05:40,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:40,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 03:05:40,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001540920] [2021-03-25 03:05:40,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 03:05:40,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:40,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 03:05:40,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-25 03:05:40,727 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 330 [2021-03-25 03:05:40,728 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 03:05:40,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:40,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 330 [2021-03-25 03:05:40,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:43,155 INFO L129 PetriNetUnfolder]: 16158/22578 cut-off events. [2021-03-25 03:05:43,156 INFO L130 PetriNetUnfolder]: For 238200/239088 co-relation queries the response was YES. [2021-03-25 03:05:43,441 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 03:05:43,504 INFO L132 encePairwiseOnDemand]: 321/330 looper letters, 183 selfloop transitions, 53 changer transitions 0/271 dead transitions. [2021-03-25 03:05:43,504 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 271 transitions, 4267 flow [2021-03-25 03:05:43,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 03:05:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 03:05:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1495 transitions. [2021-03-25 03:05:43,505 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5662878787878788 [2021-03-25 03:05:43,505 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1495 transitions. [2021-03-25 03:05:43,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1495 transitions. [2021-03-25 03:05:43,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:43,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1495 transitions. [2021-03-25 03:05:43,507 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 03:05:43,508 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 03:05:43,509 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 03:05:43,509 INFO L185 Difference]: Start difference. First operand has 176 places, 235 transitions, 3477 flow. Second operand 8 states and 1495 transitions. [2021-03-25 03:05:43,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 271 transitions, 4267 flow [2021-03-25 03:05:43,997 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 03:05:44,001 INFO L241 Difference]: Finished difference. Result has 182 places, 233 transitions, 3512 flow [2021-03-25 03:05:44,001 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 03:05:44,001 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 119 predicate places. [2021-03-25 03:05:44,001 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:44,001 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 233 transitions, 3512 flow [2021-03-25 03:05:44,001 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 233 transitions, 3512 flow [2021-03-25 03:05:44,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 182 places, 233 transitions, 3512 flow [2021-03-25 03:05:44,508 INFO L129 PetriNetUnfolder]: 4157/7504 cut-off events. [2021-03-25 03:05:44,508 INFO L130 PetriNetUnfolder]: For 37375/37643 co-relation queries the response was YES. [2021-03-25 03:05:44,563 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 03:05:44,633 INFO L142 LiptonReduction]: Number of co-enabled transitions 3270 [2021-03-25 03:05:44,641 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:44,642 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:44,642 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 641 [2021-03-25 03:05:44,642 INFO L480 AbstractCegarLoop]: Abstraction has has 182 places, 233 transitions, 3512 flow [2021-03-25 03:05:44,642 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 03:05:44,642 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:44,642 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 03:05:44,642 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-25 03:05:44,643 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 03:05:44,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:44,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1230078054, now seen corresponding path program 1 times [2021-03-25 03:05:44,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:44,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383517043] [2021-03-25 03:05:44,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:44,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:44,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:05:44,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:44,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 03:05:44,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:44,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 03:05:44,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:44,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:05:44,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:44,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:05:44,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:44,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 03:05:44,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:44,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:05:44,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:44,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:05:44,802 INFO L142 QuantifierPusher]: treesize reduction 14, result has 36.4 percent of original size [2021-03-25 03:05:44,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:05:44,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:44,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:44,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:44,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:44,818 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 03:05:44,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383517043] [2021-03-25 03:05:44,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:44,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 03:05:44,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032022419] [2021-03-25 03:05:44,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 03:05:44,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:44,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 03:05:44,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-03-25 03:05:44,821 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 330 [2021-03-25 03:05:44,822 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 03:05:44,822 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:44,822 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 330 [2021-03-25 03:05:44,822 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:47,634 INFO L129 PetriNetUnfolder]: 15407/21952 cut-off events. [2021-03-25 03:05:47,634 INFO L130 PetriNetUnfolder]: For 225833/226395 co-relation queries the response was YES. [2021-03-25 03:05:47,798 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 03:05:47,878 INFO L132 encePairwiseOnDemand]: 318/330 looper letters, 180 selfloop transitions, 53 changer transitions 0/276 dead transitions. [2021-03-25 03:05:47,879 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 276 transitions, 4540 flow [2021-03-25 03:05:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 03:05:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 03:05:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1851 transitions. [2021-03-25 03:05:47,880 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5609090909090909 [2021-03-25 03:05:47,880 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1851 transitions. [2021-03-25 03:05:47,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1851 transitions. [2021-03-25 03:05:47,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:47,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1851 transitions. [2021-03-25 03:05:47,884 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 03:05:47,886 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 03:05:47,886 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 03:05:47,886 INFO L185 Difference]: Start difference. First operand has 182 places, 233 transitions, 3512 flow. Second operand 10 states and 1851 transitions. [2021-03-25 03:05:47,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 276 transitions, 4540 flow [2021-03-25 03:05:48,288 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 03:05:48,291 INFO L241 Difference]: Finished difference. Result has 181 places, 207 transitions, 3044 flow [2021-03-25 03:05:48,292 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 03:05:48,292 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 118 predicate places. [2021-03-25 03:05:48,292 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:48,292 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 207 transitions, 3044 flow [2021-03-25 03:05:48,292 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 207 transitions, 3044 flow [2021-03-25 03:05:48,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 181 places, 207 transitions, 3044 flow [2021-03-25 03:05:48,750 INFO L129 PetriNetUnfolder]: 3964/7051 cut-off events. [2021-03-25 03:05:48,751 INFO L130 PetriNetUnfolder]: For 30775/31018 co-relation queries the response was YES. [2021-03-25 03:05:48,797 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 03:05:48,856 INFO L142 LiptonReduction]: Number of co-enabled transitions 2868 [2021-03-25 03:05:48,863 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:48,863 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:48,864 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 572 [2021-03-25 03:05:48,864 INFO L480 AbstractCegarLoop]: Abstraction has has 181 places, 207 transitions, 3044 flow [2021-03-25 03:05:48,864 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 03:05:48,864 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:48,864 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 03:05:48,865 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-25 03:05:48,865 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 03:05:48,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:48,865 INFO L82 PathProgramCache]: Analyzing trace with hash 110549166, now seen corresponding path program 1 times [2021-03-25 03:05:48,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:48,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060325729] [2021-03-25 03:05:48,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:48,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:48,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:05:48,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:48,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:05:48,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:48,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:48,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:48,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:48,890 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 03:05:48,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060325729] [2021-03-25 03:05:48,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:48,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 03:05:48,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505439411] [2021-03-25 03:05:48,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 03:05:48,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:48,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 03:05:48,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 03:05:48,892 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 330 [2021-03-25 03:05:48,892 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 03:05:48,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:48,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 330 [2021-03-25 03:05:48,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:51,044 INFO L129 PetriNetUnfolder]: 14425/20401 cut-off events. [2021-03-25 03:05:51,044 INFO L130 PetriNetUnfolder]: For 188998/189693 co-relation queries the response was YES. [2021-03-25 03:05:51,162 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 03:05:51,223 INFO L132 encePairwiseOnDemand]: 323/330 looper letters, 204 selfloop transitions, 7 changer transitions 0/261 dead transitions. [2021-03-25 03:05:51,223 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 261 transitions, 4180 flow [2021-03-25 03:05:51,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 03:05:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 03:05:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1412 transitions. [2021-03-25 03:05:51,225 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7131313131313132 [2021-03-25 03:05:51,225 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1412 transitions. [2021-03-25 03:05:51,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1412 transitions. [2021-03-25 03:05:51,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:51,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1412 transitions. [2021-03-25 03:05:51,226 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 03:05:51,227 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 03:05:51,227 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 03:05:51,228 INFO L185 Difference]: Start difference. First operand has 181 places, 207 transitions, 3044 flow. Second operand 6 states and 1412 transitions. [2021-03-25 03:05:51,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 261 transitions, 4180 flow [2021-03-25 03:05:51,503 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 03:05:51,507 INFO L241 Difference]: Finished difference. Result has 179 places, 208 transitions, 2966 flow [2021-03-25 03:05:51,507 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 03:05:51,507 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 116 predicate places. [2021-03-25 03:05:51,507 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:51,507 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 208 transitions, 2966 flow [2021-03-25 03:05:51,508 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 208 transitions, 2966 flow [2021-03-25 03:05:51,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 179 places, 208 transitions, 2966 flow [2021-03-25 03:05:51,983 INFO L129 PetriNetUnfolder]: 3883/7008 cut-off events. [2021-03-25 03:05:51,983 INFO L130 PetriNetUnfolder]: For 28572/28756 co-relation queries the response was YES. [2021-03-25 03:05:52,032 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 03:05:52,096 INFO L142 LiptonReduction]: Number of co-enabled transitions 2848 [2021-03-25 03:05:52,103 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:52,103 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:52,103 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 596 [2021-03-25 03:05:52,103 INFO L480 AbstractCegarLoop]: Abstraction has has 179 places, 208 transitions, 2966 flow [2021-03-25 03:05:52,103 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 03:05:52,103 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:52,104 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 03:05:52,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-25 03:05:52,104 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 03:05:52,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:52,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1575795269, now seen corresponding path program 1 times [2021-03-25 03:05:52,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:52,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812282428] [2021-03-25 03:05:52,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:52,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:52,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:05:52,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:52,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 03:05:52,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:52,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:05:52,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:52,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:52,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:52,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:52,141 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 03:05:52,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812282428] [2021-03-25 03:05:52,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:52,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 03:05:52,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058762744] [2021-03-25 03:05:52,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 03:05:52,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:52,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 03:05:52,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 03:05:52,144 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 330 [2021-03-25 03:05:52,144 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 03:05:52,144 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:52,144 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 330 [2021-03-25 03:05:52,144 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:54,111 INFO L129 PetriNetUnfolder]: 13950/19823 cut-off events. [2021-03-25 03:05:54,112 INFO L130 PetriNetUnfolder]: For 184419/185103 co-relation queries the response was YES. [2021-03-25 03:05:54,293 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 03:05:54,359 INFO L132 encePairwiseOnDemand]: 322/330 looper letters, 198 selfloop transitions, 19 changer transitions 0/262 dead transitions. [2021-03-25 03:05:54,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 262 transitions, 4092 flow [2021-03-25 03:05:54,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 03:05:54,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 03:05:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1531 transitions. [2021-03-25 03:05:54,363 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5799242424242425 [2021-03-25 03:05:54,363 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1531 transitions. [2021-03-25 03:05:54,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1531 transitions. [2021-03-25 03:05:54,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:54,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1531 transitions. [2021-03-25 03:05:54,365 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 03:05:54,366 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 03:05:54,366 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 03:05:54,366 INFO L185 Difference]: Start difference. First operand has 179 places, 208 transitions, 2966 flow. Second operand 8 states and 1531 transitions. [2021-03-25 03:05:54,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 262 transitions, 4092 flow [2021-03-25 03:05:54,770 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 03:05:54,774 INFO L241 Difference]: Finished difference. Result has 184 places, 209 transitions, 3016 flow [2021-03-25 03:05:54,774 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 03:05:54,774 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 121 predicate places. [2021-03-25 03:05:54,774 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:54,774 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 209 transitions, 3016 flow [2021-03-25 03:05:54,774 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 209 transitions, 3016 flow [2021-03-25 03:05:54,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 184 places, 209 transitions, 3016 flow [2021-03-25 03:05:55,237 INFO L129 PetriNetUnfolder]: 3836/6942 cut-off events. [2021-03-25 03:05:55,237 INFO L130 PetriNetUnfolder]: For 27505/27634 co-relation queries the response was YES. [2021-03-25 03:05:55,288 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 03:05:55,352 INFO L142 LiptonReduction]: Number of co-enabled transitions 2798 [2021-03-25 03:05:55,359 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:55,359 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:55,359 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 585 [2021-03-25 03:05:55,360 INFO L480 AbstractCegarLoop]: Abstraction has has 184 places, 209 transitions, 3016 flow [2021-03-25 03:05:55,360 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 03:05:55,360 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:55,360 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 03:05:55,360 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-25 03:05:55,360 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 03:05:55,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:55,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1438434779, now seen corresponding path program 2 times [2021-03-25 03:05:55,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:55,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89736885] [2021-03-25 03:05:55,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:55,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:55,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:05:55,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:55,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:05:55,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:55,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:05:55,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:55,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 03:05:55,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:55,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:05:55,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:55,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:55,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:55,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:55,439 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 03:05:55,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89736885] [2021-03-25 03:05:55,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:55,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 03:05:55,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563069978] [2021-03-25 03:05:55,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:05:55,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:55,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:05:55,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:05:55,444 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 330 [2021-03-25 03:05:55,445 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 03:05:55,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:55,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 330 [2021-03-25 03:05:55,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:05:57,671 INFO L129 PetriNetUnfolder]: 13499/19281 cut-off events. [2021-03-25 03:05:57,671 INFO L130 PetriNetUnfolder]: For 182632/183310 co-relation queries the response was YES. [2021-03-25 03:05:57,775 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 03:05:57,831 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 180 selfloop transitions, 32 changer transitions 0/257 dead transitions. [2021-03-25 03:05:57,831 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 257 transitions, 4009 flow [2021-03-25 03:05:57,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 03:05:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 03:05:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1890 transitions. [2021-03-25 03:05:57,835 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5727272727272728 [2021-03-25 03:05:57,835 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1890 transitions. [2021-03-25 03:05:57,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1890 transitions. [2021-03-25 03:05:57,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:05:57,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1890 transitions. [2021-03-25 03:05:57,837 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 03:05:57,839 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 03:05:57,839 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 03:05:57,839 INFO L185 Difference]: Start difference. First operand has 184 places, 209 transitions, 3016 flow. Second operand 10 states and 1890 transitions. [2021-03-25 03:05:57,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 257 transitions, 4009 flow [2021-03-25 03:05:58,112 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 03:05:58,116 INFO L241 Difference]: Finished difference. Result has 188 places, 210 transitions, 3072 flow [2021-03-25 03:05:58,116 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 03:05:58,116 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 125 predicate places. [2021-03-25 03:05:58,116 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:05:58,117 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 210 transitions, 3072 flow [2021-03-25 03:05:58,117 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 210 transitions, 3072 flow [2021-03-25 03:05:58,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 188 places, 210 transitions, 3072 flow [2021-03-25 03:05:58,572 INFO L129 PetriNetUnfolder]: 3774/6864 cut-off events. [2021-03-25 03:05:58,572 INFO L130 PetriNetUnfolder]: For 26694/26822 co-relation queries the response was YES. [2021-03-25 03:05:58,619 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 03:05:58,678 INFO L142 LiptonReduction]: Number of co-enabled transitions 2748 [2021-03-25 03:05:58,685 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:05:58,686 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:05:58,686 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 570 [2021-03-25 03:05:58,686 INFO L480 AbstractCegarLoop]: Abstraction has has 188 places, 210 transitions, 3072 flow [2021-03-25 03:05:58,686 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 03:05:58,686 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:05:58,686 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 03:05:58,686 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-25 03:05:58,686 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 03:05:58,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:05:58,687 INFO L82 PathProgramCache]: Analyzing trace with hash -710361757, now seen corresponding path program 3 times [2021-03-25 03:05:58,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:05:58,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403827941] [2021-03-25 03:05:58,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:05:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:05:58,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:58,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:05:58,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:58,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:05:58,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:58,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:05:58,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:58,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:05:58,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:58,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 03:05:58,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:58,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:05:58,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:58,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:05:58,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:05:58,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:05:58,783 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 03:05:58,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403827941] [2021-03-25 03:05:58,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:05:58,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 03:05:58,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804298304] [2021-03-25 03:05:58,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 03:05:58,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:05:58,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 03:05:58,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-25 03:05:58,785 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 330 [2021-03-25 03:05:58,786 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 03:05:58,786 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:05:58,786 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 330 [2021-03-25 03:05:58,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:06:00,727 INFO L129 PetriNetUnfolder]: 12995/18656 cut-off events. [2021-03-25 03:06:00,727 INFO L130 PetriNetUnfolder]: For 177993/178658 co-relation queries the response was YES. [2021-03-25 03:06:00,942 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 03:06:01,001 INFO L132 encePairwiseOnDemand]: 318/330 looper letters, 165 selfloop transitions, 57 changer transitions 0/267 dead transitions. [2021-03-25 03:06:01,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 267 transitions, 4285 flow [2021-03-25 03:06:01,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-25 03:06:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-25 03:06:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2247 transitions. [2021-03-25 03:06:01,003 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5674242424242424 [2021-03-25 03:06:01,003 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2247 transitions. [2021-03-25 03:06:01,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2247 transitions. [2021-03-25 03:06:01,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:06:01,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2247 transitions. [2021-03-25 03:06:01,005 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 03:06:01,007 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 03:06:01,007 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 03:06:01,007 INFO L185 Difference]: Start difference. First operand has 188 places, 210 transitions, 3072 flow. Second operand 12 states and 2247 transitions. [2021-03-25 03:06:01,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 267 transitions, 4285 flow [2021-03-25 03:06:01,372 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 03:06:01,376 INFO L241 Difference]: Finished difference. Result has 193 places, 217 transitions, 3300 flow [2021-03-25 03:06:01,376 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 03:06:01,376 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 130 predicate places. [2021-03-25 03:06:01,376 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:06:01,376 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 217 transitions, 3300 flow [2021-03-25 03:06:01,376 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 217 transitions, 3300 flow [2021-03-25 03:06:01,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 193 places, 217 transitions, 3300 flow [2021-03-25 03:06:01,840 INFO L129 PetriNetUnfolder]: 3728/6790 cut-off events. [2021-03-25 03:06:01,840 INFO L130 PetriNetUnfolder]: For 26773/26921 co-relation queries the response was YES. [2021-03-25 03:06:01,887 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 03:06:01,947 INFO L142 LiptonReduction]: Number of co-enabled transitions 2696 [2021-03-25 03:06:01,954 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:06:01,954 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:06:01,955 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 579 [2021-03-25 03:06:01,955 INFO L480 AbstractCegarLoop]: Abstraction has has 193 places, 217 transitions, 3300 flow [2021-03-25 03:06:01,955 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 03:06:01,955 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:06:01,955 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 03:06:01,955 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-25 03:06:01,955 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 03:06:01,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:06:01,956 INFO L82 PathProgramCache]: Analyzing trace with hash 730801183, now seen corresponding path program 1 times [2021-03-25 03:06:01,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:06:01,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573405296] [2021-03-25 03:06:01,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:06:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:06:01,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:01,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:06:01,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:01,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 03:06:01,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:01,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 03:06:01,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:01,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:06:01,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:01,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:06:02,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:02,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:06:02,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:02,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:06:02,024 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 03:06:02,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573405296] [2021-03-25 03:06:02,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:06:02,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 03:06:02,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953031998] [2021-03-25 03:06:02,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:06:02,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:06:02,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:06:02,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:06:02,027 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 330 [2021-03-25 03:06:02,028 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 03:06:02,028 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:06:02,028 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 330 [2021-03-25 03:06:02,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:06:03,529 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= (select (select |v_#memory_int_100| v_~v~0.base_30) v_~v~0.offset_30) |v_ULTIMATE.start_main_#t~mem19_15|) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_15|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_30, #memory_int=|v_#memory_int_100|, ~v~0.base=v_~v~0.base_30} OutVars{~v~0.offset=v_~v~0.offset_30, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ~v~0.base=v_~v~0.base_30, 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 03:06:03,530 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-25 03:06:03,530 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 03:06:03,530 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 03:06:03,530 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 03:06:03,530 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L1163-2-->L1164-2: Formula: (and (= (select (select |v_#memory_int_100| v_~v~0.base_30) v_~v~0.offset_30) |v_ULTIMATE.start_main_#t~mem19_15|) (= (ite (= 88 |v_ULTIMATE.start_main_#t~mem19_15|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~v~0.offset=v_~v~0.offset_30, #memory_int=|v_#memory_int_100|, ~v~0.base=v_~v~0.base_30} OutVars{~v~0.offset=v_~v~0.offset_30, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ~v~0.base=v_~v~0.base_30, 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 03:06:03,530 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-25 03:06:03,530 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 03:06:03,530 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 03:06:03,530 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 03:06:03,689 INFO L129 PetriNetUnfolder]: 9621/14987 cut-off events. [2021-03-25 03:06:03,689 INFO L130 PetriNetUnfolder]: For 146898/147830 co-relation queries the response was YES. [2021-03-25 03:06:03,816 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 03:06:03,853 INFO L132 encePairwiseOnDemand]: 318/330 looper letters, 140 selfloop transitions, 73 changer transitions 16/295 dead transitions. [2021-03-25 03:06:03,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 295 transitions, 4643 flow [2021-03-25 03:06:03,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:06:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:06:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1971 transitions. [2021-03-25 03:06:03,855 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2021-03-25 03:06:03,855 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1971 transitions. [2021-03-25 03:06:03,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1971 transitions. [2021-03-25 03:06:03,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:06:03,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1971 transitions. [2021-03-25 03:06:03,857 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 03:06:03,859 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 03:06:03,859 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 03:06:03,859 INFO L185 Difference]: Start difference. First operand has 193 places, 217 transitions, 3300 flow. Second operand 9 states and 1971 transitions. [2021-03-25 03:06:03,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 295 transitions, 4643 flow [2021-03-25 03:06:04,194 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 03:06:04,198 INFO L241 Difference]: Finished difference. Result has 201 places, 233 transitions, 3773 flow [2021-03-25 03:06:04,198 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 03:06:04,198 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 138 predicate places. [2021-03-25 03:06:04,198 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:06:04,198 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 233 transitions, 3773 flow [2021-03-25 03:06:04,198 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 233 transitions, 3773 flow [2021-03-25 03:06:04,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 200 places, 233 transitions, 3773 flow [2021-03-25 03:06:04,763 INFO L129 PetriNetUnfolder]: 4156/7619 cut-off events. [2021-03-25 03:06:04,764 INFO L130 PetriNetUnfolder]: For 37985/38259 co-relation queries the response was YES. [2021-03-25 03:06:04,823 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 03:06:04,896 INFO L142 LiptonReduction]: Number of co-enabled transitions 3414 [2021-03-25 03:06:04,908 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:06:04,909 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:06:04,909 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 711 [2021-03-25 03:06:04,909 INFO L480 AbstractCegarLoop]: Abstraction has has 200 places, 233 transitions, 3773 flow [2021-03-25 03:06:04,909 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 03:06:04,910 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:06:04,910 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 03:06:04,910 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-03-25 03:06:04,910 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 03:06:04,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:06:04,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1677324299, now seen corresponding path program 1 times [2021-03-25 03:06:04,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:06:04,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334234090] [2021-03-25 03:06:04,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:06:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:06:04,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:04,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:06:04,964 INFO L142 QuantifierPusher]: treesize reduction 4, result has 92.6 percent of original size [2021-03-25 03:06:04,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 03:06:04,984 INFO L142 QuantifierPusher]: treesize reduction 4, result has 92.0 percent of original size [2021-03-25 03:06:04,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 03:06:05,004 INFO L142 QuantifierPusher]: treesize reduction 4, result has 91.8 percent of original size [2021-03-25 03:06:05,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 03:06:05,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:05,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:06:05,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:05,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:06:05,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:05,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 03:06:05,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:05,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 03:06:05,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:05,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:06:05,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:05,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:06:05,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:05,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:06:05,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:05,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:06:05,160 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 03:06:05,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334234090] [2021-03-25 03:06:05,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:06:05,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 03:06:05,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375398371] [2021-03-25 03:06:05,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 03:06:05,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:06:05,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 03:06:05,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-03-25 03:06:05,162 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 330 [2021-03-25 03:06:05,163 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 03:06:05,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:06:05,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 330 [2021-03-25 03:06:05,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:06:08,425 INFO L129 PetriNetUnfolder]: 14920/21464 cut-off events. [2021-03-25 03:06:08,426 INFO L130 PetriNetUnfolder]: For 283652/284820 co-relation queries the response was YES. [2021-03-25 03:06:08,557 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 03:06:08,601 INFO L132 encePairwiseOnDemand]: 315/330 looper letters, 193 selfloop transitions, 84 changer transitions 17/333 dead transitions. [2021-03-25 03:06:08,601 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 333 transitions, 5709 flow [2021-03-25 03:06:08,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-25 03:06:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-25 03:06:08,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2368 transitions. [2021-03-25 03:06:08,607 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.551981351981352 [2021-03-25 03:06:08,607 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2368 transitions. [2021-03-25 03:06:08,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2368 transitions. [2021-03-25 03:06:08,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:06:08,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2368 transitions. [2021-03-25 03:06:08,610 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 03:06:08,612 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 03:06:08,613 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 03:06:08,613 INFO L185 Difference]: Start difference. First operand has 200 places, 233 transitions, 3773 flow. Second operand 13 states and 2368 transitions. [2021-03-25 03:06:08,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 333 transitions, 5709 flow [2021-03-25 03:06:09,241 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 03:06:09,246 INFO L241 Difference]: Finished difference. Result has 203 places, 248 transitions, 4025 flow [2021-03-25 03:06:09,247 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 03:06:09,247 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 140 predicate places. [2021-03-25 03:06:09,247 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:06:09,247 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 248 transitions, 4025 flow [2021-03-25 03:06:09,247 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 248 transitions, 4025 flow [2021-03-25 03:06:09,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 203 places, 248 transitions, 4025 flow [2021-03-25 03:06:09,804 INFO L129 PetriNetUnfolder]: 4380/8055 cut-off events. [2021-03-25 03:06:09,804 INFO L130 PetriNetUnfolder]: For 38275/38760 co-relation queries the response was YES. [2021-03-25 03:06:09,863 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 03:06:10,170 INFO L142 LiptonReduction]: Number of co-enabled transitions 3442 [2021-03-25 03:06:10,180 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:06:10,180 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:06:10,180 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 933 [2021-03-25 03:06:10,180 INFO L480 AbstractCegarLoop]: Abstraction has has 203 places, 248 transitions, 4025 flow [2021-03-25 03:06:10,180 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 03:06:10,181 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:06:10,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] [2021-03-25 03:06:10,181 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-03-25 03:06:10,181 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 03:06:10,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:06:10,181 INFO L82 PathProgramCache]: Analyzing trace with hash -427201177, now seen corresponding path program 2 times [2021-03-25 03:06:10,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:06:10,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122043193] [2021-03-25 03:06:10,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:06:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:06:10,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:10,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:06:10,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:10,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:06:10,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:10,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:06:10,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:10,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:06:10,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:10,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:06:10,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:10,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:06:10,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:10,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:06:10,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:10,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:06:10,259 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 03:06:10,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122043193] [2021-03-25 03:06:10,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:06:10,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 03:06:10,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392287777] [2021-03-25 03:06:10,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 03:06:10,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:06:10,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 03:06:10,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 03:06:10,261 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 330 [2021-03-25 03:06:10,262 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 03:06:10,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:06:10,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 330 [2021-03-25 03:06:10,262 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:06:12,158 INFO L129 PetriNetUnfolder]: 9807/15284 cut-off events. [2021-03-25 03:06:12,158 INFO L130 PetriNetUnfolder]: For 199504/200658 co-relation queries the response was YES. [2021-03-25 03:06:12,287 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 03:06:12,329 INFO L132 encePairwiseOnDemand]: 319/330 looper letters, 153 selfloop transitions, 88 changer transitions 5/310 dead transitions. [2021-03-25 03:06:12,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 310 transitions, 5218 flow [2021-03-25 03:06:12,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:06:12,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:06:12,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1961 transitions. [2021-03-25 03:06:12,332 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6602693602693602 [2021-03-25 03:06:12,332 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1961 transitions. [2021-03-25 03:06:12,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1961 transitions. [2021-03-25 03:06:12,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:06:12,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1961 transitions. [2021-03-25 03:06:12,334 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 03:06:12,336 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 03:06:12,336 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 03:06:12,336 INFO L185 Difference]: Start difference. First operand has 203 places, 248 transitions, 4025 flow. Second operand 9 states and 1961 transitions. [2021-03-25 03:06:12,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 310 transitions, 5218 flow [2021-03-25 03:06:12,979 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 03:06:12,983 INFO L241 Difference]: Finished difference. Result has 208 places, 261 transitions, 4490 flow [2021-03-25 03:06:12,983 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 03:06:12,983 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 145 predicate places. [2021-03-25 03:06:12,984 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:06:12,984 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 261 transitions, 4490 flow [2021-03-25 03:06:12,984 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 261 transitions, 4490 flow [2021-03-25 03:06:12,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 208 places, 261 transitions, 4490 flow [2021-03-25 03:06:13,702 INFO L129 PetriNetUnfolder]: 4310/7933 cut-off events. [2021-03-25 03:06:13,703 INFO L130 PetriNetUnfolder]: For 48654/49607 co-relation queries the response was YES. [2021-03-25 03:06:13,759 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 03:06:13,832 INFO L142 LiptonReduction]: Number of co-enabled transitions 3658 [2021-03-25 03:06:13,842 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:06:13,842 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:06:13,843 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 859 [2021-03-25 03:06:13,843 INFO L480 AbstractCegarLoop]: Abstraction has has 208 places, 261 transitions, 4490 flow [2021-03-25 03:06:13,843 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 03:06:13,843 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:06:13,843 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 03:06:13,843 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-03-25 03:06:13,843 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 03:06:13,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:06:13,844 INFO L82 PathProgramCache]: Analyzing trace with hash -369916801, now seen corresponding path program 4 times [2021-03-25 03:06:13,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:06:13,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814500456] [2021-03-25 03:06:13,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:06:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:06:13,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:13,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 03:06:13,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:13,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 03:06:13,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:13,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 03:06:13,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:13,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 03:06:13,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:13,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:06:13,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:13,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:06:14,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:14,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:06:14,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:14,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:06:14,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:14,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:06:14,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:14,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:06:14,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:14,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:06:14,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:14,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:06:14,058 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 03:06:14,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814500456] [2021-03-25 03:06:14,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:06:14,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 03:06:14,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935667625] [2021-03-25 03:06:14,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 03:06:14,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:06:14,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 03:06:14,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-03-25 03:06:14,060 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 330 [2021-03-25 03:06:14,060 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 03:06:14,060 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:06:14,061 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 330 [2021-03-25 03:06:14,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:06:17,270 INFO L129 PetriNetUnfolder]: 15814/22929 cut-off events. [2021-03-25 03:06:17,270 INFO L130 PetriNetUnfolder]: For 355014/355502 co-relation queries the response was YES. [2021-03-25 03:06:17,422 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 03:06:17,465 INFO L132 encePairwiseOnDemand]: 321/330 looper letters, 240 selfloop transitions, 41 changer transitions 12/338 dead transitions. [2021-03-25 03:06:17,465 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 338 transitions, 6327 flow [2021-03-25 03:06:17,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:06:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:06:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1312 transitions. [2021-03-25 03:06:17,467 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.567965367965368 [2021-03-25 03:06:17,467 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1312 transitions. [2021-03-25 03:06:17,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1312 transitions. [2021-03-25 03:06:17,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:06:17,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1312 transitions. [2021-03-25 03:06:17,469 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 03:06:17,470 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 03:06:17,470 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 03:06:17,470 INFO L185 Difference]: Start difference. First operand has 208 places, 261 transitions, 4490 flow. Second operand 7 states and 1312 transitions. [2021-03-25 03:06:17,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 338 transitions, 6327 flow [2021-03-25 03:06:18,556 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 03:06:18,561 INFO L241 Difference]: Finished difference. Result has 214 places, 270 transitions, 4723 flow [2021-03-25 03:06:18,562 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 03:06:18,562 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 151 predicate places. [2021-03-25 03:06:18,562 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:06:18,562 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 270 transitions, 4723 flow [2021-03-25 03:06:18,562 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 270 transitions, 4723 flow [2021-03-25 03:06:18,564 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 214 places, 270 transitions, 4723 flow [2021-03-25 03:06:19,245 INFO L129 PetriNetUnfolder]: 4257/7681 cut-off events. [2021-03-25 03:06:19,245 INFO L130 PetriNetUnfolder]: For 46144/46890 co-relation queries the response was YES. [2021-03-25 03:06:19,291 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 03:06:19,351 INFO L142 LiptonReduction]: Number of co-enabled transitions 3782 [2021-03-25 03:06:19,362 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:06:19,362 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:06:19,362 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 800 [2021-03-25 03:06:19,362 INFO L480 AbstractCegarLoop]: Abstraction has has 214 places, 270 transitions, 4723 flow [2021-03-25 03:06:19,362 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 03:06:19,362 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:06:19,363 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 03:06:19,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-03-25 03:06:19,363 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 03:06:19,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:06:19,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1225693259, now seen corresponding path program 5 times [2021-03-25 03:06:19,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:06:19,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629612] [2021-03-25 03:06:19,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:06:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:06:19,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:19,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:06:19,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:19,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 03:06:19,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:19,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:06:19,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:19,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:06:19,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:19,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:06:19,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:19,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:06:19,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:19,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:06:19,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:19,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:06:19,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:19,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:06:19,450 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 03:06:19,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629612] [2021-03-25 03:06:19,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:06:19,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 03:06:19,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043095096] [2021-03-25 03:06:19,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 03:06:19,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:06:19,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 03:06:19,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-03-25 03:06:19,453 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 330 [2021-03-25 03:06:19,454 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 03:06:19,454 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:06:19,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 330 [2021-03-25 03:06:19,454 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:06:22,593 INFO L129 PetriNetUnfolder]: 14638/21396 cut-off events. [2021-03-25 03:06:22,593 INFO L130 PetriNetUnfolder]: For 335940/336288 co-relation queries the response was YES. [2021-03-25 03:06:22,899 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 03:06:22,945 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 249 selfloop transitions, 70 changer transitions 12/376 dead transitions. [2021-03-25 03:06:22,945 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 376 transitions, 6942 flow [2021-03-25 03:06:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:06:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:06:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1719 transitions. [2021-03-25 03:06:22,947 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5787878787878787 [2021-03-25 03:06:22,947 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1719 transitions. [2021-03-25 03:06:22,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1719 transitions. [2021-03-25 03:06:22,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:06:22,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1719 transitions. [2021-03-25 03:06:22,949 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 03:06:22,951 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 03:06:22,951 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 03:06:22,951 INFO L185 Difference]: Start difference. First operand has 214 places, 270 transitions, 4723 flow. Second operand 9 states and 1719 transitions. [2021-03-25 03:06:22,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 376 transitions, 6942 flow [2021-03-25 03:06:23,611 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 03:06:23,616 INFO L241 Difference]: Finished difference. Result has 223 places, 292 transitions, 5368 flow [2021-03-25 03:06:23,616 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 03:06:23,616 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 160 predicate places. [2021-03-25 03:06:23,616 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:06:23,616 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 292 transitions, 5368 flow [2021-03-25 03:06:23,617 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 292 transitions, 5368 flow [2021-03-25 03:06:23,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 223 places, 292 transitions, 5368 flow [2021-03-25 03:06:24,437 INFO L129 PetriNetUnfolder]: 4610/8312 cut-off events. [2021-03-25 03:06:24,438 INFO L130 PetriNetUnfolder]: For 52073/52931 co-relation queries the response was YES. [2021-03-25 03:06:24,510 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 03:06:24,605 INFO L142 LiptonReduction]: Number of co-enabled transitions 3926 [2021-03-25 03:06:24,617 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:06:24,617 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:06:24,617 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1001 [2021-03-25 03:06:24,618 INFO L480 AbstractCegarLoop]: Abstraction has has 223 places, 292 transitions, 5368 flow [2021-03-25 03:06:24,618 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 03:06:24,618 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:06:24,618 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 03:06:24,618 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-03-25 03:06:24,618 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 03:06:24,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:06:24,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1710503265, now seen corresponding path program 1 times [2021-03-25 03:06:24,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:06:24,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725615890] [2021-03-25 03:06:24,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:06:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:06:24,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:24,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:06:24,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:24,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 03:06:24,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:24,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 03:06:24,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:24,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 03:06:24,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:24,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:06:24,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:24,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 03:06:24,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:24,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 03:06:24,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:24,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:06:24,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:24,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:06:24,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:24,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:06:24,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:24,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:06:24,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:24,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:06:24,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:24,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:06:24,898 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 03:06:24,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725615890] [2021-03-25 03:06:24,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:06:24,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 03:06:24,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703767869] [2021-03-25 03:06:24,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 03:06:24,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:06:24,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 03:06:24,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-03-25 03:06:24,901 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 330 [2021-03-25 03:06:24,902 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 03:06:24,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:06:24,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 330 [2021-03-25 03:06:24,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:06:28,280 INFO L129 PetriNetUnfolder]: 14375/21128 cut-off events. [2021-03-25 03:06:28,280 INFO L130 PetriNetUnfolder]: For 344563/345251 co-relation queries the response was YES. [2021-03-25 03:06:28,434 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 03:06:28,489 INFO L132 encePairwiseOnDemand]: 317/330 looper letters, 236 selfloop transitions, 57 changer transitions 3/349 dead transitions. [2021-03-25 03:06:28,489 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 349 transitions, 6619 flow [2021-03-25 03:06:28,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 03:06:28,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 03:06:28,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2006 transitions. [2021-03-25 03:06:28,491 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5526170798898071 [2021-03-25 03:06:28,491 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2006 transitions. [2021-03-25 03:06:28,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2006 transitions. [2021-03-25 03:06:28,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:06:28,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2006 transitions. [2021-03-25 03:06:28,493 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 03:06:28,494 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 03:06:28,494 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 03:06:28,495 INFO L185 Difference]: Start difference. First operand has 223 places, 292 transitions, 5368 flow. Second operand 11 states and 2006 transitions. [2021-03-25 03:06:28,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 349 transitions, 6619 flow [2021-03-25 03:06:29,337 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 03:06:29,341 INFO L241 Difference]: Finished difference. Result has 219 places, 278 transitions, 4969 flow [2021-03-25 03:06:29,341 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 03:06:29,341 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 156 predicate places. [2021-03-25 03:06:29,342 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:06:29,342 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 278 transitions, 4969 flow [2021-03-25 03:06:29,342 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 278 transitions, 4969 flow [2021-03-25 03:06:29,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 219 places, 278 transitions, 4969 flow [2021-03-25 03:06:30,119 INFO L129 PetriNetUnfolder]: 4441/8015 cut-off events. [2021-03-25 03:06:30,119 INFO L130 PetriNetUnfolder]: For 48274/48904 co-relation queries the response was YES. [2021-03-25 03:06:30,166 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 03:06:30,227 INFO L142 LiptonReduction]: Number of co-enabled transitions 3482 [2021-03-25 03:06:30,238 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:06:30,238 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:06:30,238 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 896 [2021-03-25 03:06:30,239 INFO L480 AbstractCegarLoop]: Abstraction has has 219 places, 278 transitions, 4969 flow [2021-03-25 03:06:30,239 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 03:06:30,239 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:06:30,239 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 03:06:30,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-03-25 03:06:30,239 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 03:06:30,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:06:30,239 INFO L82 PathProgramCache]: Analyzing trace with hash 726249076, now seen corresponding path program 1 times [2021-03-25 03:06:30,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:06:30,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520623732] [2021-03-25 03:06:30,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:06:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:06:30,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:30,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 03:06:30,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:30,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 03:06:30,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:30,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 03:06:30,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:30,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 03:06:30,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:30,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:06:30,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:30,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:06:30,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:30,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:06:30,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:30,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:06:30,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:30,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:06:30,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:30,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:06:30,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:30,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:06:30,405 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 03:06:30,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520623732] [2021-03-25 03:06:30,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:06:30,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 03:06:30,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974552307] [2021-03-25 03:06:30,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 03:06:30,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:06:30,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 03:06:30,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-03-25 03:06:30,408 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 330 [2021-03-25 03:06:30,409 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 03:06:30,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:06:30,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 330 [2021-03-25 03:06:30,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:06:33,332 INFO L129 PetriNetUnfolder]: 13174/19418 cut-off events. [2021-03-25 03:06:33,332 INFO L130 PetriNetUnfolder]: For 333043/333276 co-relation queries the response was YES. [2021-03-25 03:06:33,499 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 03:06:33,546 INFO L132 encePairwiseOnDemand]: 322/330 looper letters, 189 selfloop transitions, 101 changer transitions 20/355 dead transitions. [2021-03-25 03:06:33,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 355 transitions, 6622 flow [2021-03-25 03:06:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:06:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:06:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1686 transitions. [2021-03-25 03:06:33,548 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5676767676767677 [2021-03-25 03:06:33,548 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1686 transitions. [2021-03-25 03:06:33,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1686 transitions. [2021-03-25 03:06:33,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:06:33,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1686 transitions. [2021-03-25 03:06:33,550 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 03:06:33,551 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 03:06:33,552 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 03:06:33,552 INFO L185 Difference]: Start difference. First operand has 219 places, 278 transitions, 4969 flow. Second operand 9 states and 1686 transitions. [2021-03-25 03:06:33,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 355 transitions, 6622 flow [2021-03-25 03:06:34,401 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 03:06:34,406 INFO L241 Difference]: Finished difference. Result has 217 places, 259 transitions, 4630 flow [2021-03-25 03:06:34,406 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 03:06:34,406 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 154 predicate places. [2021-03-25 03:06:34,406 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:06:34,406 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 259 transitions, 4630 flow [2021-03-25 03:06:34,406 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 259 transitions, 4630 flow [2021-03-25 03:06:34,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 217 places, 259 transitions, 4630 flow [2021-03-25 03:06:34,949 INFO L129 PetriNetUnfolder]: 4303/7795 cut-off events. [2021-03-25 03:06:34,949 INFO L130 PetriNetUnfolder]: For 43923/44448 co-relation queries the response was YES. [2021-03-25 03:06:35,006 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 03:06:35,078 INFO L142 LiptonReduction]: Number of co-enabled transitions 3072 [2021-03-25 03:06:35,089 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:06:35,089 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:06:35,089 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 683 [2021-03-25 03:06:35,089 INFO L480 AbstractCegarLoop]: Abstraction has has 217 places, 259 transitions, 4630 flow [2021-03-25 03:06:35,090 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 03:06:35,090 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:06:35,090 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 03:06:35,090 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-03-25 03:06:35,090 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 03:06:35,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:06:35,090 INFO L82 PathProgramCache]: Analyzing trace with hash 363151152, now seen corresponding path program 1 times [2021-03-25 03:06:35,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:06:35,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68120331] [2021-03-25 03:06:35,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:06:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:06:35,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:35,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:06:35,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:35,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 03:06:35,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:35,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 03:06:35,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:35,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 03:06:35,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:35,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:06:35,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:35,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:06:35,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:35,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:06:35,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:35,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:06:35,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:35,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:06:35,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:35,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:06:35,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:35,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:06:35,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:35,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:06:35,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:35,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:06:35,412 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 03:06:35,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68120331] [2021-03-25 03:06:35,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:06:35,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 03:06:35,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008840596] [2021-03-25 03:06:35,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 03:06:35,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:06:35,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 03:06:35,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-03-25 03:06:35,415 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 330 [2021-03-25 03:06:35,416 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 03:06:35,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:06:35,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 330 [2021-03-25 03:06:35,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:06:38,070 INFO L129 PetriNetUnfolder]: 12079/17972 cut-off events. [2021-03-25 03:06:38,070 INFO L130 PetriNetUnfolder]: For 303398/303594 co-relation queries the response was YES. [2021-03-25 03:06:38,179 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 03:06:38,216 INFO L132 encePairwiseOnDemand]: 317/330 looper letters, 198 selfloop transitions, 60 changer transitions 3/306 dead transitions. [2021-03-25 03:06:38,216 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 306 transitions, 5717 flow [2021-03-25 03:06:38,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 03:06:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 03:06:38,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1997 transitions. [2021-03-25 03:06:38,218 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.550137741046832 [2021-03-25 03:06:38,218 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1997 transitions. [2021-03-25 03:06:38,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1997 transitions. [2021-03-25 03:06:38,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:06:38,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1997 transitions. [2021-03-25 03:06:38,219 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 03:06:38,221 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 03:06:38,222 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 03:06:38,222 INFO L185 Difference]: Start difference. First operand has 217 places, 259 transitions, 4630 flow. Second operand 11 states and 1997 transitions. [2021-03-25 03:06:38,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 306 transitions, 5717 flow [2021-03-25 03:06:38,933 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 03:06:38,937 INFO L241 Difference]: Finished difference. Result has 212 places, 245 transitions, 4262 flow [2021-03-25 03:06:38,937 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 03:06:38,937 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 149 predicate places. [2021-03-25 03:06:38,937 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:06:38,937 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 245 transitions, 4262 flow [2021-03-25 03:06:38,937 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 212 places, 245 transitions, 4262 flow [2021-03-25 03:06:38,939 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 212 places, 245 transitions, 4262 flow [2021-03-25 03:06:39,506 INFO L129 PetriNetUnfolder]: 4147/7508 cut-off events. [2021-03-25 03:06:39,507 INFO L130 PetriNetUnfolder]: For 40958/41751 co-relation queries the response was YES. [2021-03-25 03:06:39,563 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 03:06:39,639 INFO L142 LiptonReduction]: Number of co-enabled transitions 2566 [2021-03-25 03:06:39,794 INFO L154 LiptonReduction]: Checked pairs total: 377 [2021-03-25 03:06:39,794 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:06:39,794 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 857 [2021-03-25 03:06:39,794 INFO L480 AbstractCegarLoop]: Abstraction has has 212 places, 245 transitions, 4262 flow [2021-03-25 03:06:39,795 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 03:06:39,795 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:06:39,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, 1, 1] [2021-03-25 03:06:39,795 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-03-25 03:06:39,795 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 03:06:39,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:06:39,795 INFO L82 PathProgramCache]: Analyzing trace with hash 487627517, now seen corresponding path program 1 times [2021-03-25 03:06:39,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:06:39,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940877359] [2021-03-25 03:06:39,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:06:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:06:39,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:39,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:06:39,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:39,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 03:06:39,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:39,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:06:39,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:39,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:06:39,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:39,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:06:39,834 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 03:06:39,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940877359] [2021-03-25 03:06:39,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:06:39,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 03:06:39,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818877279] [2021-03-25 03:06:39,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 03:06:39,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:06:39,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 03:06:39,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 03:06:39,837 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 330 [2021-03-25 03:06:39,837 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 03:06:39,837 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:06:39,837 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 330 [2021-03-25 03:06:39,838 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:06:41,732 INFO L129 PetriNetUnfolder]: 10649/16291 cut-off events. [2021-03-25 03:06:41,732 INFO L130 PetriNetUnfolder]: For 273883/274269 co-relation queries the response was YES. [2021-03-25 03:06:41,830 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 03:06:41,863 INFO L132 encePairwiseOnDemand]: 322/330 looper letters, 221 selfloop transitions, 14 changer transitions 7/298 dead transitions. [2021-03-25 03:06:41,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 298 transitions, 5527 flow [2021-03-25 03:06:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 03:06:41,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 03:06:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1524 transitions. [2021-03-25 03:06:41,865 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5772727272727273 [2021-03-25 03:06:41,865 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1524 transitions. [2021-03-25 03:06:41,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1524 transitions. [2021-03-25 03:06:41,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:06:41,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1524 transitions. [2021-03-25 03:06:41,869 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 03:06:41,870 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 03:06:41,871 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 03:06:41,871 INFO L185 Difference]: Start difference. First operand has 212 places, 245 transitions, 4262 flow. Second operand 8 states and 1524 transitions. [2021-03-25 03:06:41,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 298 transitions, 5527 flow [2021-03-25 03:06:42,441 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 03:06:42,445 INFO L241 Difference]: Finished difference. Result has 208 places, 240 transitions, 4019 flow [2021-03-25 03:06:42,445 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 03:06:42,445 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 145 predicate places. [2021-03-25 03:06:42,445 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:06:42,445 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 240 transitions, 4019 flow [2021-03-25 03:06:42,445 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 240 transitions, 4019 flow [2021-03-25 03:06:42,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 208 places, 240 transitions, 4019 flow [2021-03-25 03:06:42,909 INFO L129 PetriNetUnfolder]: 4052/7382 cut-off events. [2021-03-25 03:06:42,909 INFO L130 PetriNetUnfolder]: For 34737/35451 co-relation queries the response was YES. [2021-03-25 03:06:42,956 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 03:06:43,029 INFO L142 LiptonReduction]: Number of co-enabled transitions 2310 [2021-03-25 03:06:43,132 INFO L154 LiptonReduction]: Checked pairs total: 305 [2021-03-25 03:06:43,132 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:06:43,132 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 687 [2021-03-25 03:06:43,132 INFO L480 AbstractCegarLoop]: Abstraction has has 208 places, 240 transitions, 4019 flow [2021-03-25 03:06:43,133 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 03:06:43,133 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:06:43,133 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 03:06:43,133 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-03-25 03:06:43,133 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 03:06:43,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:06:43,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1269875945, now seen corresponding path program 2 times [2021-03-25 03:06:43,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:06:43,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319493565] [2021-03-25 03:06:43,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:06:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:06:43,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:43,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:06:43,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:43,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:06:43,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:43,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:06:43,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:43,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 03:06:43,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:43,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:06:43,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:43,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:06:43,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:43,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:06:43,206 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 03:06:43,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319493565] [2021-03-25 03:06:43,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:06:43,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 03:06:43,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145030837] [2021-03-25 03:06:43,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:06:43,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:06:43,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:06:43,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:06:43,208 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 330 [2021-03-25 03:06:43,209 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 03:06:43,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:06:43,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 330 [2021-03-25 03:06:43,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:06:45,173 INFO L129 PetriNetUnfolder]: 10230/15763 cut-off events. [2021-03-25 03:06:45,174 INFO L130 PetriNetUnfolder]: For 251217/251619 co-relation queries the response was YES. [2021-03-25 03:06:45,271 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 03:06:45,509 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 207 selfloop transitions, 27 changer transitions 4/294 dead transitions. [2021-03-25 03:06:45,509 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 294 transitions, 5281 flow [2021-03-25 03:06:45,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 03:06:45,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 03:06:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1883 transitions. [2021-03-25 03:06:45,511 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5706060606060606 [2021-03-25 03:06:45,511 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1883 transitions. [2021-03-25 03:06:45,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1883 transitions. [2021-03-25 03:06:45,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:06:45,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1883 transitions. [2021-03-25 03:06:45,513 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 03:06:45,515 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 03:06:45,515 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 03:06:45,515 INFO L185 Difference]: Start difference. First operand has 208 places, 240 transitions, 4019 flow. Second operand 10 states and 1883 transitions. [2021-03-25 03:06:45,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 294 transitions, 5281 flow [2021-03-25 03:06:45,840 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 03:06:45,844 INFO L241 Difference]: Finished difference. Result has 213 places, 239 transitions, 4014 flow [2021-03-25 03:06:45,844 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 03:06:45,845 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 150 predicate places. [2021-03-25 03:06:45,845 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:06:45,845 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 239 transitions, 4014 flow [2021-03-25 03:06:45,845 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 239 transitions, 4014 flow [2021-03-25 03:06:45,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 213 places, 239 transitions, 4014 flow [2021-03-25 03:06:46,114 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_23|, 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 03:06:46,114 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-25 03:06:46,115 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 03:06:46,115 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 03:06:46,115 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 03:06:46,421 INFO L129 PetriNetUnfolder]: 4043/7374 cut-off events. [2021-03-25 03:06:46,421 INFO L130 PetriNetUnfolder]: For 33035/33721 co-relation queries the response was YES. [2021-03-25 03:06:46,478 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 03:06:46,561 INFO L142 LiptonReduction]: Number of co-enabled transitions 2146 [2021-03-25 03:06:46,688 INFO L154 LiptonReduction]: Checked pairs total: 281 [2021-03-25 03:06:46,688 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:06:46,688 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 843 [2021-03-25 03:06:46,689 INFO L480 AbstractCegarLoop]: Abstraction has has 213 places, 239 transitions, 4014 flow [2021-03-25 03:06:46,689 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 03:06:46,689 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:06:46,689 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 03:06:46,689 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-03-25 03:06:46,689 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 03:06:46,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:06:46,689 INFO L82 PathProgramCache]: Analyzing trace with hash -240802259, now seen corresponding path program 3 times [2021-03-25 03:06:46,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:06:46,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463128622] [2021-03-25 03:06:46,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:06:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:06:46,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:46,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:06:46,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:46,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:06:46,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:46,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:06:46,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:46,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:06:46,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:46,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 03:06:46,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:46,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:06:46,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:46,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:06:46,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:46,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:06:46,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 03:06:46,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463128622] [2021-03-25 03:06:46,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:06:46,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 03:06:46,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416274817] [2021-03-25 03:06:46,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 03:06:46,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:06:46,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 03:06:46,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-25 03:06:46,793 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 330 [2021-03-25 03:06:46,794 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 03:06:46,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:06:46,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 330 [2021-03-25 03:06:46,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:06:48,801 INFO L129 PetriNetUnfolder]: 9845/15275 cut-off events. [2021-03-25 03:06:48,801 INFO L130 PetriNetUnfolder]: For 231732/232136 co-relation queries the response was YES. [2021-03-25 03:06:48,894 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 03:06:48,930 INFO L132 encePairwiseOnDemand]: 319/330 looper letters, 191 selfloop transitions, 44 changer transitions 4/295 dead transitions. [2021-03-25 03:06:48,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 295 transitions, 5288 flow [2021-03-25 03:06:48,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-25 03:06:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-25 03:06:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2238 transitions. [2021-03-25 03:06:48,937 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5651515151515152 [2021-03-25 03:06:48,937 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2238 transitions. [2021-03-25 03:06:48,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2238 transitions. [2021-03-25 03:06:48,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:06:48,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2238 transitions. [2021-03-25 03:06:48,944 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 03:06:48,946 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 03:06:48,946 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 03:06:48,946 INFO L185 Difference]: Start difference. First operand has 213 places, 239 transitions, 4014 flow. Second operand 12 states and 2238 transitions. [2021-03-25 03:06:48,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 295 transitions, 5288 flow [2021-03-25 03:06:49,463 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 03:06:49,466 INFO L241 Difference]: Finished difference. Result has 217 places, 237 transitions, 3985 flow [2021-03-25 03:06:49,467 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 03:06:49,467 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 154 predicate places. [2021-03-25 03:06:49,467 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:06:49,467 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 237 transitions, 3985 flow [2021-03-25 03:06:49,467 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 237 transitions, 3985 flow [2021-03-25 03:06:49,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 217 places, 237 transitions, 3985 flow [2021-03-25 03:06:49,937 INFO L129 PetriNetUnfolder]: 4015/7339 cut-off events. [2021-03-25 03:06:49,938 INFO L130 PetriNetUnfolder]: For 32742/33536 co-relation queries the response was YES. [2021-03-25 03:06:49,985 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 03:06:50,049 INFO L142 LiptonReduction]: Number of co-enabled transitions 1978 [2021-03-25 03:06:50,148 INFO L154 LiptonReduction]: Checked pairs total: 233 [2021-03-25 03:06:50,149 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:06:50,149 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 682 [2021-03-25 03:06:50,149 INFO L480 AbstractCegarLoop]: Abstraction has has 217 places, 237 transitions, 3985 flow [2021-03-25 03:06:50,149 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 03:06:50,150 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:06:50,150 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 03:06:50,150 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-03-25 03:06:50,150 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 03:06:50,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:06:50,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1311261863, now seen corresponding path program 4 times [2021-03-25 03:06:50,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:06:50,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353989013] [2021-03-25 03:06:50,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:06:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:06:50,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:50,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:06:50,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:50,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:06:50,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:50,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:06:50,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:50,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:06:50,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:50,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:06:50,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:50,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 03:06:50,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:50,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:06:50,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:50,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:06:50,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:50,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:06:50,266 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 03:06:50,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353989013] [2021-03-25 03:06:50,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:06:50,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 03:06:50,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070493427] [2021-03-25 03:06:50,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 03:06:50,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:06:50,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 03:06:50,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-25 03:06:50,269 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 330 [2021-03-25 03:06:50,270 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 03:06:50,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:06:50,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 330 [2021-03-25 03:06:50,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:06:50,584 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-03-25 03:06:52,349 INFO L129 PetriNetUnfolder]: 9449/14773 cut-off events. [2021-03-25 03:06:52,349 INFO L130 PetriNetUnfolder]: For 221191/221567 co-relation queries the response was YES. [2021-03-25 03:06:52,448 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 03:06:52,485 INFO L132 encePairwiseOnDemand]: 318/330 looper letters, 178 selfloop transitions, 54 changer transitions 4/292 dead transitions. [2021-03-25 03:06:52,485 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 292 transitions, 5266 flow [2021-03-25 03:06:52,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-25 03:06:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-25 03:06:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2230 transitions. [2021-03-25 03:06:52,487 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5631313131313131 [2021-03-25 03:06:52,487 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2230 transitions. [2021-03-25 03:06:52,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2230 transitions. [2021-03-25 03:06:52,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:06:52,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2230 transitions. [2021-03-25 03:06:52,489 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 03:06:52,490 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 03:06:52,491 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 03:06:52,491 INFO L185 Difference]: Start difference. First operand has 217 places, 237 transitions, 3985 flow. Second operand 12 states and 2230 transitions. [2021-03-25 03:06:52,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 292 transitions, 5266 flow [2021-03-25 03:06:52,857 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 03:06:52,861 INFO L241 Difference]: Finished difference. Result has 220 places, 238 transitions, 4049 flow [2021-03-25 03:06:52,861 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 03:06:52,861 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 157 predicate places. [2021-03-25 03:06:52,862 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:06:52,862 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 238 transitions, 4049 flow [2021-03-25 03:06:52,862 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 238 transitions, 4049 flow [2021-03-25 03:06:52,864 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 220 places, 238 transitions, 4049 flow [2021-03-25 03:06:53,564 INFO L129 PetriNetUnfolder]: 3994/7314 cut-off events. [2021-03-25 03:06:53,564 INFO L130 PetriNetUnfolder]: For 32815/33575 co-relation queries the response was YES. [2021-03-25 03:06:53,618 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 03:06:53,689 INFO L142 LiptonReduction]: Number of co-enabled transitions 1810 [2021-03-25 03:06:53,752 INFO L154 LiptonReduction]: Checked pairs total: 185 [2021-03-25 03:06:53,752 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:06:53,752 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 890 [2021-03-25 03:06:53,752 INFO L480 AbstractCegarLoop]: Abstraction has has 220 places, 238 transitions, 4049 flow [2021-03-25 03:06:53,752 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 03:06:53,753 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:06:53,753 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 03:06:53,753 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-03-25 03:06:53,753 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 03:06:53,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:06:53,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1399198597, now seen corresponding path program 5 times [2021-03-25 03:06:53,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:06:53,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51285203] [2021-03-25 03:06:53,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:06:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:06:53,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:53,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:06:53,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:53,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 03:06:53,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:53,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 03:06:53,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:53,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:06:53,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:53,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:06:53,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:53,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:06:53,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:53,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:06:53,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:53,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:06:53,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:53,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:06:53,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:53,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:06:53,860 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 03:06:53,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51285203] [2021-03-25 03:06:53,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:06:53,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 03:06:53,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180938213] [2021-03-25 03:06:53,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 03:06:53,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:06:53,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 03:06:53,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-03-25 03:06:53,862 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 330 [2021-03-25 03:06:53,863 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 03:06:53,863 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:06:53,863 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 330 [2021-03-25 03:06:53,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:06:56,024 INFO L129 PetriNetUnfolder]: 10334/16133 cut-off events. [2021-03-25 03:06:56,024 INFO L130 PetriNetUnfolder]: For 250182/250523 co-relation queries the response was YES. [2021-03-25 03:06:56,126 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 03:06:56,155 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 202 selfloop transitions, 70 changer transitions 6/334 dead transitions. [2021-03-25 03:06:56,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 334 transitions, 5901 flow [2021-03-25 03:06:56,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:06:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:06:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1699 transitions. [2021-03-25 03:06:56,157 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.572053872053872 [2021-03-25 03:06:56,157 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1699 transitions. [2021-03-25 03:06:56,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1699 transitions. [2021-03-25 03:06:56,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:06:56,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1699 transitions. [2021-03-25 03:06:56,159 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 03:06:56,160 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 03:06:56,160 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 03:06:56,160 INFO L185 Difference]: Start difference. First operand has 220 places, 238 transitions, 4049 flow. Second operand 9 states and 1699 transitions. [2021-03-25 03:06:56,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 334 transitions, 5901 flow [2021-03-25 03:06:56,583 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 03:06:56,587 INFO L241 Difference]: Finished difference. Result has 227 places, 257 transitions, 4621 flow [2021-03-25 03:06:56,587 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 03:06:56,587 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 164 predicate places. [2021-03-25 03:06:56,587 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:06:56,588 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 257 transitions, 4621 flow [2021-03-25 03:06:56,588 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 227 places, 257 transitions, 4621 flow [2021-03-25 03:06:56,589 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 227 places, 257 transitions, 4621 flow [2021-03-25 03:06:57,409 INFO L129 PetriNetUnfolder]: 4428/8139 cut-off events. [2021-03-25 03:06:57,409 INFO L130 PetriNetUnfolder]: For 45516/46255 co-relation queries the response was YES. [2021-03-25 03:06:57,466 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 03:06:57,543 INFO L142 LiptonReduction]: Number of co-enabled transitions 1974 [2021-03-25 03:06:57,625 INFO L154 LiptonReduction]: Checked pairs total: 209 [2021-03-25 03:06:57,625 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:06:57,625 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1038 [2021-03-25 03:06:57,625 INFO L480 AbstractCegarLoop]: Abstraction has has 227 places, 257 transitions, 4621 flow [2021-03-25 03:06:57,625 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 03:06:57,625 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:06:57,625 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 03:06:57,625 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-03-25 03:06:57,626 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 03:06:57,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:06:57,626 INFO L82 PathProgramCache]: Analyzing trace with hash -924061497, now seen corresponding path program 6 times [2021-03-25 03:06:57,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:06:57,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479728104] [2021-03-25 03:06:57,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:06:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:06:57,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:57,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:06:57,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:57,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 03:06:57,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:57,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 03:06:57,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:57,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 03:06:57,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:57,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:06:57,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:57,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:06:57,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:57,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:06:57,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:57,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:06:57,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:57,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:06:57,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:57,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:06:57,838 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-03-25 03:06:57,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:06:57,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:57,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:06:57,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:06:57,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:06:57,863 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 03:06:57,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479728104] [2021-03-25 03:06:57,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:06:57,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-25 03:06:57,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688774850] [2021-03-25 03:06:57,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-25 03:06:57,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:06:57,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-25 03:06:57,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-03-25 03:06:57,866 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 330 [2021-03-25 03:06:57,874 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 03:06:57,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:06:57,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 330 [2021-03-25 03:06:57,874 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:00,910 INFO L129 PetriNetUnfolder]: 11581/18423 cut-off events. [2021-03-25 03:07:00,910 INFO L130 PetriNetUnfolder]: For 312996/313438 co-relation queries the response was YES. [2021-03-25 03:07:01,014 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 03:07:01,043 INFO L132 encePairwiseOnDemand]: 316/330 looper letters, 177 selfloop transitions, 76 changer transitions 10/319 dead transitions. [2021-03-25 03:07:01,044 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 319 transitions, 5964 flow [2021-03-25 03:07:01,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-25 03:07:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-25 03:07:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2193 transitions. [2021-03-25 03:07:01,045 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5537878787878788 [2021-03-25 03:07:01,046 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2193 transitions. [2021-03-25 03:07:01,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2193 transitions. [2021-03-25 03:07:01,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:01,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2193 transitions. [2021-03-25 03:07:01,047 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 03:07:01,048 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 03:07:01,049 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 03:07:01,049 INFO L185 Difference]: Start difference. First operand has 227 places, 257 transitions, 4621 flow. Second operand 12 states and 2193 transitions. [2021-03-25 03:07:01,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 319 transitions, 5964 flow [2021-03-25 03:07:01,695 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 03:07:01,704 INFO L241 Difference]: Finished difference. Result has 240 places, 270 transitions, 5041 flow [2021-03-25 03:07:01,704 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 03:07:01,704 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 177 predicate places. [2021-03-25 03:07:01,704 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:01,705 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 240 places, 270 transitions, 5041 flow [2021-03-25 03:07:01,705 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 240 places, 270 transitions, 5041 flow [2021-03-25 03:07:01,707 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 240 places, 270 transitions, 5041 flow [2021-03-25 03:07:02,550 INFO L129 PetriNetUnfolder]: 5260/9822 cut-off events. [2021-03-25 03:07:02,550 INFO L130 PetriNetUnfolder]: For 56080/56163 co-relation queries the response was YES. [2021-03-25 03:07:02,616 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 03:07:02,701 INFO L142 LiptonReduction]: Number of co-enabled transitions 1890 [2021-03-25 03:07:02,774 INFO L154 LiptonReduction]: Checked pairs total: 209 [2021-03-25 03:07:02,774 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:02,774 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1070 [2021-03-25 03:07:02,775 INFO L480 AbstractCegarLoop]: Abstraction has has 240 places, 270 transitions, 5041 flow [2021-03-25 03:07:02,775 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 03:07:02,775 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:02,775 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 03:07:02,775 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-03-25 03:07:02,775 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 03:07:02,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:02,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1076838129, now seen corresponding path program 1 times [2021-03-25 03:07:02,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:02,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432583813] [2021-03-25 03:07:02,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:02,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:02,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 03:07:02,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:02,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:07:02,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:02,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 03:07:02,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:02,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:07:02,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:02,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:07:02,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:02,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:07:02,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:02,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:07:02,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:02,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:07:02,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:02,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:02,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:02,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:02,884 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 03:07:02,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432583813] [2021-03-25 03:07:02,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:02,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 03:07:02,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665755426] [2021-03-25 03:07:02,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 03:07:02,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:02,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 03:07:02,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-03-25 03:07:02,887 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 330 [2021-03-25 03:07:02,888 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 03:07:02,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:02,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 330 [2021-03-25 03:07:02,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:05,371 INFO L129 PetriNetUnfolder]: 10492/16900 cut-off events. [2021-03-25 03:07:05,372 INFO L130 PetriNetUnfolder]: For 305474/305641 co-relation queries the response was YES. [2021-03-25 03:07:05,533 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 03:07:05,570 INFO L132 encePairwiseOnDemand]: 322/330 looper letters, 211 selfloop transitions, 52 changer transitions 0/319 dead transitions. [2021-03-25 03:07:05,570 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 319 transitions, 6409 flow [2021-03-25 03:07:05,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 03:07:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 03:07:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1486 transitions. [2021-03-25 03:07:05,571 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5628787878787879 [2021-03-25 03:07:05,571 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1486 transitions. [2021-03-25 03:07:05,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1486 transitions. [2021-03-25 03:07:05,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:05,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1486 transitions. [2021-03-25 03:07:05,572 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 03:07:05,573 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 03:07:05,574 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 03:07:05,574 INFO L185 Difference]: Start difference. First operand has 240 places, 270 transitions, 5041 flow. Second operand 8 states and 1486 transitions. [2021-03-25 03:07:05,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 319 transitions, 6409 flow [2021-03-25 03:07:06,540 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 03:07:06,545 INFO L241 Difference]: Finished difference. Result has 246 places, 266 transitions, 5000 flow [2021-03-25 03:07:06,546 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 03:07:06,546 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 183 predicate places. [2021-03-25 03:07:06,546 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:06,546 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 246 places, 266 transitions, 5000 flow [2021-03-25 03:07:06,546 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 246 places, 266 transitions, 5000 flow [2021-03-25 03:07:06,549 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 246 places, 266 transitions, 5000 flow [2021-03-25 03:07:07,280 INFO L129 PetriNetUnfolder]: 5225/9773 cut-off events. [2021-03-25 03:07:07,280 INFO L130 PetriNetUnfolder]: For 52899/52984 co-relation queries the response was YES. [2021-03-25 03:07:07,572 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 03:07:07,638 INFO L142 LiptonReduction]: Number of co-enabled transitions 1530 [2021-03-25 03:07:07,678 INFO L154 LiptonReduction]: Checked pairs total: 70 [2021-03-25 03:07:07,678 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:07,678 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1132 [2021-03-25 03:07:07,678 INFO L480 AbstractCegarLoop]: Abstraction has has 246 places, 266 transitions, 5000 flow [2021-03-25 03:07:07,678 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 03:07:07,678 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:07,679 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 03:07:07,679 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-03-25 03:07:07,679 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 03:07:07,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:07,679 INFO L82 PathProgramCache]: Analyzing trace with hash -55935116, now seen corresponding path program 1 times [2021-03-25 03:07:07,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:07,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951260174] [2021-03-25 03:07:07,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:07,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:07,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 03:07:07,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:07,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:07:07,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:07,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 03:07:07,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:07,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 03:07:07,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:07,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 03:07:07,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:07,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:07:07,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:07,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:07:07,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:07,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:07:07,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:07,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:07:07,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:07,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:07:07,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:07,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:07,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:07,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:07,844 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 03:07:07,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951260174] [2021-03-25 03:07:07,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:07,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 03:07:07,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061987593] [2021-03-25 03:07:07,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 03:07:07,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:07,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 03:07:07,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-03-25 03:07:07,847 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 330 [2021-03-25 03:07:07,848 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 03:07:07,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:07,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 330 [2021-03-25 03:07:07,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:10,503 INFO L129 PetriNetUnfolder]: 10691/17300 cut-off events. [2021-03-25 03:07:10,503 INFO L130 PetriNetUnfolder]: For 287642/287826 co-relation queries the response was YES. [2021-03-25 03:07:10,627 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 03:07:10,668 INFO L132 encePairwiseOnDemand]: 319/330 looper letters, 223 selfloop transitions, 34 changer transitions 1/314 dead transitions. [2021-03-25 03:07:10,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 314 transitions, 6129 flow [2021-03-25 03:07:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:07:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:07:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1636 transitions. [2021-03-25 03:07:10,670 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5508417508417508 [2021-03-25 03:07:10,671 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1636 transitions. [2021-03-25 03:07:10,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1636 transitions. [2021-03-25 03:07:10,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:10,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1636 transitions. [2021-03-25 03:07:10,672 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 03:07:10,674 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 03:07:10,674 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 03:07:10,674 INFO L185 Difference]: Start difference. First operand has 246 places, 266 transitions, 5000 flow. Second operand 9 states and 1636 transitions. [2021-03-25 03:07:10,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 314 transitions, 6129 flow [2021-03-25 03:07:11,412 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 03:07:11,417 INFO L241 Difference]: Finished difference. Result has 250 places, 269 transitions, 5063 flow [2021-03-25 03:07:11,417 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 03:07:11,417 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 187 predicate places. [2021-03-25 03:07:11,417 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:11,417 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 269 transitions, 5063 flow [2021-03-25 03:07:11,417 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 250 places, 269 transitions, 5063 flow [2021-03-25 03:07:11,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 250 places, 269 transitions, 5063 flow [2021-03-25 03:07:12,301 INFO L129 PetriNetUnfolder]: 5460/10210 cut-off events. [2021-03-25 03:07:12,301 INFO L130 PetriNetUnfolder]: For 57282/57361 co-relation queries the response was YES. [2021-03-25 03:07:12,376 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 03:07:12,469 INFO L142 LiptonReduction]: Number of co-enabled transitions 1528 [2021-03-25 03:07:12,501 INFO L154 LiptonReduction]: Checked pairs total: 70 [2021-03-25 03:07:12,502 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:12,502 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1085 [2021-03-25 03:07:12,502 INFO L480 AbstractCegarLoop]: Abstraction has has 250 places, 269 transitions, 5063 flow [2021-03-25 03:07:12,502 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 03:07:12,502 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:12,502 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 03:07:12,502 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-03-25 03:07:12,502 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 03:07:12,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:12,503 INFO L82 PathProgramCache]: Analyzing trace with hash -328721308, now seen corresponding path program 2 times [2021-03-25 03:07:12,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:12,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072331310] [2021-03-25 03:07:12,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:12,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:12,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 03:07:12,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:12,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:07:12,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:12,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:07:12,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:12,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 03:07:12,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:12,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 03:07:12,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:12,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:07:12,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:12,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:07:12,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:12,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:07:12,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:12,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:07:12,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:12,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:07:12,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:12,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:12,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:12,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:12,646 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 03:07:12,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072331310] [2021-03-25 03:07:12,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:12,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 03:07:12,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809228483] [2021-03-25 03:07:12,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 03:07:12,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:12,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 03:07:12,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-03-25 03:07:12,649 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 330 [2021-03-25 03:07:12,650 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 03:07:12,650 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:12,650 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 330 [2021-03-25 03:07:12,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:15,016 INFO L129 PetriNetUnfolder]: 9890/16173 cut-off events. [2021-03-25 03:07:15,016 INFO L130 PetriNetUnfolder]: For 272839/272965 co-relation queries the response was YES. [2021-03-25 03:07:15,128 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 03:07:15,160 INFO L132 encePairwiseOnDemand]: 320/330 looper letters, 200 selfloop transitions, 70 changer transitions 0/326 dead transitions. [2021-03-25 03:07:15,160 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 326 transitions, 6264 flow [2021-03-25 03:07:15,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 03:07:15,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 03:07:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1821 transitions. [2021-03-25 03:07:15,162 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5518181818181818 [2021-03-25 03:07:15,162 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1821 transitions. [2021-03-25 03:07:15,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1821 transitions. [2021-03-25 03:07:15,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:15,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1821 transitions. [2021-03-25 03:07:15,163 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 03:07:15,165 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 03:07:15,165 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 03:07:15,165 INFO L185 Difference]: Start difference. First operand has 250 places, 269 transitions, 5063 flow. Second operand 10 states and 1821 transitions. [2021-03-25 03:07:15,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 326 transitions, 6264 flow [2021-03-25 03:07:16,084 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 03:07:16,088 INFO L241 Difference]: Finished difference. Result has 238 places, 256 transitions, 4654 flow [2021-03-25 03:07:16,088 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 03:07:16,088 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 175 predicate places. [2021-03-25 03:07:16,088 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:16,088 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 256 transitions, 4654 flow [2021-03-25 03:07:16,088 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 256 transitions, 4654 flow [2021-03-25 03:07:16,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 238 places, 256 transitions, 4654 flow [2021-03-25 03:07:17,007 INFO L129 PetriNetUnfolder]: 5390/10089 cut-off events. [2021-03-25 03:07:17,008 INFO L130 PetriNetUnfolder]: For 47744/47811 co-relation queries the response was YES. [2021-03-25 03:07:17,062 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 03:07:17,139 INFO L142 LiptonReduction]: Number of co-enabled transitions 742 [2021-03-25 03:07:17,672 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:07:17,673 INFO L156 LiptonReduction]: Total number of compositions: 22 [2021-03-25 03:07:17,673 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1585 [2021-03-25 03:07:17,673 INFO L480 AbstractCegarLoop]: Abstraction has has 237 places, 255 transitions, 4652 flow [2021-03-25 03:07:17,673 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 03:07:17,674 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:17,674 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 03:07:17,674 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-03-25 03:07:17,674 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 03:07:17,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:17,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2048436766, now seen corresponding path program 1 times [2021-03-25 03:07:17,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:17,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532097561] [2021-03-25 03:07:17,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:17,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:17,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:17,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:17,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:07:17,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:17,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:07:17,712 INFO L142 QuantifierPusher]: treesize reduction 4, result has 80.0 percent of original size [2021-03-25 03:07:17,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:07:17,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:17,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:07:17,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:17,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:07:17,749 INFO L142 QuantifierPusher]: treesize reduction 16, result has 44.8 percent of original size [2021-03-25 03:07:17,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:07:17,758 INFO L142 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-03-25 03:07:17,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 03:07:17,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:17,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:17,767 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 03:07:17,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532097561] [2021-03-25 03:07:17,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:17,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 03:07:17,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80574613] [2021-03-25 03:07:17,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:07:17,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:17,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:07:17,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:07:17,770 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 352 [2021-03-25 03:07:17,771 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 03:07:17,771 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:17,772 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 352 [2021-03-25 03:07:17,772 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:20,155 INFO L129 PetriNetUnfolder]: 9717/16023 cut-off events. [2021-03-25 03:07:20,155 INFO L130 PetriNetUnfolder]: For 235314/235428 co-relation queries the response was YES. [2021-03-25 03:07:20,238 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 03:07:20,266 INFO L132 encePairwiseOnDemand]: 342/352 looper letters, 166 selfloop transitions, 43 changer transitions 6/268 dead transitions. [2021-03-25 03:07:20,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 268 transitions, 5344 flow [2021-03-25 03:07:20,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:07:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:07:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1574 transitions. [2021-03-25 03:07:20,268 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6387987012987013 [2021-03-25 03:07:20,268 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1574 transitions. [2021-03-25 03:07:20,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1574 transitions. [2021-03-25 03:07:20,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:20,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1574 transitions. [2021-03-25 03:07:20,269 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 03:07:20,270 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 03:07:20,270 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 03:07:20,270 INFO L185 Difference]: Start difference. First operand has 237 places, 255 transitions, 4652 flow. Second operand 7 states and 1574 transitions. [2021-03-25 03:07:20,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 268 transitions, 5344 flow [2021-03-25 03:07:20,604 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 03:07:20,609 INFO L241 Difference]: Finished difference. Result has 238 places, 253 transitions, 4685 flow [2021-03-25 03:07:20,609 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 03:07:20,609 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 175 predicate places. [2021-03-25 03:07:20,609 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:20,609 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 253 transitions, 4685 flow [2021-03-25 03:07:20,609 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 253 transitions, 4685 flow [2021-03-25 03:07:20,611 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 238 places, 253 transitions, 4685 flow [2021-03-25 03:07:21,474 INFO L129 PetriNetUnfolder]: 4803/9475 cut-off events. [2021-03-25 03:07:21,474 INFO L130 PetriNetUnfolder]: For 46505/46574 co-relation queries the response was YES. [2021-03-25 03:07:21,537 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 03:07:21,610 INFO L142 LiptonReduction]: Number of co-enabled transitions 698 [2021-03-25 03:07:21,621 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:07:21,621 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:21,621 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1012 [2021-03-25 03:07:21,622 INFO L480 AbstractCegarLoop]: Abstraction has has 238 places, 253 transitions, 4685 flow [2021-03-25 03:07:21,622 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 03:07:21,622 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:21,622 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 03:07:21,622 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-03-25 03:07:21,622 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 03:07:21,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:21,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1588706145, now seen corresponding path program 1 times [2021-03-25 03:07:21,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:21,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396881628] [2021-03-25 03:07:21,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:21,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:21,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:21,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:21,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:07:21,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:21,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 03:07:21,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:21,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:07:21,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:21,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:07:21,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:21,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:07:21,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:21,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:07:21,699 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-03-25 03:07:21,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:07:21,704 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 03:07:21,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:21,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:21,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:21,711 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 03:07:21,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396881628] [2021-03-25 03:07:21,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:21,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 03:07:21,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771859011] [2021-03-25 03:07:21,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:07:21,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:21,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:07:21,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:07:21,713 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 352 [2021-03-25 03:07:21,714 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 03:07:21,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:21,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 352 [2021-03-25 03:07:21,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:24,235 INFO L129 PetriNetUnfolder]: 9304/15864 cut-off events. [2021-03-25 03:07:24,235 INFO L130 PetriNetUnfolder]: For 226662/226776 co-relation queries the response was YES. [2021-03-25 03:07:24,339 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 03:07:24,368 INFO L132 encePairwiseOnDemand]: 338/352 looper letters, 151 selfloop transitions, 66 changer transitions 14/281 dead transitions. [2021-03-25 03:07:24,368 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 281 transitions, 5469 flow [2021-03-25 03:07:24,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 03:07:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 03:07:24,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1809 transitions. [2021-03-25 03:07:24,370 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6424005681818182 [2021-03-25 03:07:24,370 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1809 transitions. [2021-03-25 03:07:24,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1809 transitions. [2021-03-25 03:07:24,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:24,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1809 transitions. [2021-03-25 03:07:24,371 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 03:07:24,372 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 03:07:24,372 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 03:07:24,372 INFO L185 Difference]: Start difference. First operand has 238 places, 253 transitions, 4685 flow. Second operand 8 states and 1809 transitions. [2021-03-25 03:07:24,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 281 transitions, 5469 flow [2021-03-25 03:07:24,825 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 03:07:24,829 INFO L241 Difference]: Finished difference. Result has 240 places, 255 transitions, 4700 flow [2021-03-25 03:07:24,829 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 03:07:24,829 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 177 predicate places. [2021-03-25 03:07:24,829 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:24,830 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 240 places, 255 transitions, 4700 flow [2021-03-25 03:07:24,830 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 240 places, 255 transitions, 4700 flow [2021-03-25 03:07:24,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 240 places, 255 transitions, 4700 flow [2021-03-25 03:07:25,704 INFO L129 PetriNetUnfolder]: 4657/9575 cut-off events. [2021-03-25 03:07:25,704 INFO L130 PetriNetUnfolder]: For 57018/57113 co-relation queries the response was YES. [2021-03-25 03:07:25,768 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 03:07:25,851 INFO L142 LiptonReduction]: Number of co-enabled transitions 678 [2021-03-25 03:07:25,859 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:07:25,860 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:25,860 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1031 [2021-03-25 03:07:25,860 INFO L480 AbstractCegarLoop]: Abstraction has has 240 places, 255 transitions, 4700 flow [2021-03-25 03:07:25,860 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 03:07:25,860 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:25,860 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 03:07:25,860 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-03-25 03:07:25,861 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 03:07:25,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:25,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1346811799, now seen corresponding path program 2 times [2021-03-25 03:07:25,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:25,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12598119] [2021-03-25 03:07:25,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:25,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:25,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:25,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:25,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:07:25,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:25,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:25,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:25,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:07:25,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:25,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:07:25,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:25,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:07:25,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:25,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:07:25,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:25,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:25,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:25,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:25,919 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 03:07:25,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12598119] [2021-03-25 03:07:25,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:25,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 03:07:25,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310751535] [2021-03-25 03:07:25,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:07:25,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:25,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:07:25,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:07:25,922 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 352 [2021-03-25 03:07:25,923 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 03:07:25,923 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:25,923 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 352 [2021-03-25 03:07:25,923 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:28,043 INFO L129 PetriNetUnfolder]: 9008/15489 cut-off events. [2021-03-25 03:07:28,043 INFO L130 PetriNetUnfolder]: For 222478/222703 co-relation queries the response was YES. [2021-03-25 03:07:28,154 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 03:07:28,181 INFO L132 encePairwiseOnDemand]: 343/352 looper letters, 157 selfloop transitions, 48 changer transitions 15/271 dead transitions. [2021-03-25 03:07:28,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 271 transitions, 5455 flow [2021-03-25 03:07:28,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:07:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:07:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1343 transitions. [2021-03-25 03:07:28,183 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5450487012987013 [2021-03-25 03:07:28,183 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1343 transitions. [2021-03-25 03:07:28,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1343 transitions. [2021-03-25 03:07:28,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:28,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1343 transitions. [2021-03-25 03:07:28,184 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 03:07:28,185 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 03:07:28,185 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 03:07:28,185 INFO L185 Difference]: Start difference. First operand has 240 places, 255 transitions, 4700 flow. Second operand 7 states and 1343 transitions. [2021-03-25 03:07:28,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 271 transitions, 5455 flow [2021-03-25 03:07:28,734 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 03:07:28,738 INFO L241 Difference]: Finished difference. Result has 241 places, 249 transitions, 4671 flow [2021-03-25 03:07:28,738 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 03:07:28,738 INFO L343 CegarLoopForPetriNet]: 63 programPoint places, 178 predicate places. [2021-03-25 03:07:28,738 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:28,738 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 241 places, 249 transitions, 4671 flow [2021-03-25 03:07:28,738 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 241 places, 249 transitions, 4671 flow [2021-03-25 03:07:28,740 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 241 places, 249 transitions, 4671 flow [2021-03-25 03:07:29,623 INFO L129 PetriNetUnfolder]: 4211/8636 cut-off events. [2021-03-25 03:07:29,623 INFO L130 PetriNetUnfolder]: For 48156/48249 co-relation queries the response was YES. [2021-03-25 03:07:29,678 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 03:07:29,752 INFO L142 LiptonReduction]: Number of co-enabled transitions 630 [2021-03-25 03:07:29,760 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:07:29,760 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:29,760 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1022 [2021-03-25 03:07:29,761 INFO L480 AbstractCegarLoop]: Abstraction has has 241 places, 249 transitions, 4671 flow [2021-03-25 03:07:29,761 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 03:07:29,761 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:29,761 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 03:07:29,761 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-03-25 03:07:29,761 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 03:07:29,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:29,761 INFO L82 PathProgramCache]: Analyzing trace with hash 116708457, now seen corresponding path program 1 times [2021-03-25 03:07:29,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:29,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381695815] [2021-03-25 03:07:29,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 03:07:29,772 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 03:07:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 03:07:29,783 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 03:07:29,805 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 03:07:29,805 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 03:07:29,805 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-03-25 03:07:29,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 03:07:29 BasicIcfg [2021-03-25 03:07:29,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 03:07:29,905 INFO L168 Benchmark]: Toolchain (without parser) took 154884.64 ms. Allocated memory was 348.1 MB in the beginning and 14.8 GB in the end (delta: 14.5 GB). Free memory was 310.2 MB in the beginning and 8.8 GB in the end (delta: -8.5 GB). Peak memory consumption was 6.0 GB. Max. memory is 16.0 GB. [2021-03-25 03:07:29,905 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 348.1 MB. Free memory was 328.9 MB in the beginning and 328.8 MB in the end (delta: 126.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 03:07:29,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 642.76 ms. Allocated memory is still 348.1 MB. Free memory was 310.0 MB in the beginning and 271.7 MB in the end (delta: 38.4 MB). Peak memory consumption was 40.7 MB. Max. memory is 16.0 GB. [2021-03-25 03:07:29,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.11 ms. Allocated memory is still 348.1 MB. Free memory was 271.7 MB in the beginning and 269.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 03:07:29,905 INFO L168 Benchmark]: Boogie Preprocessor took 37.71 ms. Allocated memory is still 348.1 MB. Free memory was 269.6 MB in the beginning and 268.6 MB in the end (delta: 943.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 03:07:29,905 INFO L168 Benchmark]: RCFGBuilder took 528.28 ms. Allocated memory is still 348.1 MB. Free memory was 268.6 MB in the beginning and 241.4 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.0 GB. [2021-03-25 03:07:29,905 INFO L168 Benchmark]: TraceAbstraction took 153605.79 ms. Allocated memory was 348.1 MB in the beginning and 14.8 GB in the end (delta: 14.5 GB). Free memory was 240.3 MB in the beginning and 8.8 GB in the end (delta: -8.6 GB). Peak memory consumption was 5.9 GB. Max. memory is 16.0 GB. [2021-03-25 03:07:29,906 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.15 ms. Allocated memory is still 348.1 MB. Free memory was 328.9 MB in the beginning and 328.8 MB in the end (delta: 126.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 642.76 ms. Allocated memory is still 348.1 MB. Free memory was 310.0 MB in the beginning and 271.7 MB in the end (delta: 38.4 MB). Peak memory consumption was 40.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 56.11 ms. Allocated memory is still 348.1 MB. Free memory was 271.7 MB in the beginning and 269.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 37.71 ms. Allocated memory is still 348.1 MB. Free memory was 269.6 MB in the beginning and 268.6 MB in the end (delta: 943.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 528.28 ms. Allocated memory is still 348.1 MB. Free memory was 268.6 MB in the beginning and 241.4 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 153605.79 ms. Allocated memory was 348.1 MB in the beginning and 14.8 GB in the end (delta: 14.5 GB). Free memory was 240.3 MB in the beginning and 8.8 GB in the end (delta: -8.6 GB). Peak memory consumption was 5.9 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2090.6ms, 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: 1443, positive: 1437, positive conditional: 0, positive unconditional: 1437, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1443, positive: 1437, positive conditional: 0, positive unconditional: 1437, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1736, positive: 293, positive conditional: 0, positive unconditional: 293, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1443, unknown conditional: 0, unknown unconditional: 1443] , 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: 1127.6ms, 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: 122, positive: 122, positive conditional: 0, positive unconditional: 122, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 122, positive: 122, positive conditional: 0, positive unconditional: 122, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 165, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 122, unknown conditional: 0, unknown unconditional: 122] , 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: 36.6ms, 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: 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] , 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: 51.9ms, 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: 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] , 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: 267.1ms, 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: 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] , 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: 242.2ms, 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: 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] , 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: 284.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: 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] , 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: 292.8ms, 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: 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] , 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: 395.7ms, 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: 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] , 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: 435.1ms, 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: 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] , 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: 394.9ms, 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: 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] , 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: 402.1ms, 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: 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] , 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: 394.2ms, 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: 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] , 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: 416.1ms, 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: 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] , 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: 425.7ms, 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: 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] , 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: 533.5ms, 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: 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] , 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: 559.2ms, 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: 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] , 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: 540.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: 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] , 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: 601.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: 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] , 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: 640.2ms, 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: 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] , 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: 640.2ms, 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: 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] , 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: 571.4ms, 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: 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] , 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: 595.2ms, 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: 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] , 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: 585.1ms, 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: 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] , 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: 568.8ms, 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: 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] , 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: 578.0ms, 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: 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] , 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: 710.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: 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] , 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: 932.5ms, 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: 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] , 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: 858.6ms, 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: 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] , 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: 799.5ms, 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: 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] , 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: 1000.8ms, 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: 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] , 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: 896.5ms, 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: 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] , 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: 682.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: 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] , 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: 856.5ms, 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: 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] , 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: 686.9ms, 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: 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] , 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: 843.2ms, 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: 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] , 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: 681.8ms, 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: 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] , 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: 890.0ms, 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: 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] , 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: 1037.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: 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] , 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: 1069.6ms, 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: 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] , 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: 1131.4ms, 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: 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] , 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: 1084.4ms, 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: 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] , 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: 1584.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: 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] , 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: 1011.9ms, 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: 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] , 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: 1030.0ms, 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: 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] , 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: 1022.1ms, 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: 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] , 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={11:0}, t3={10:0}, t4={13: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={11:0}, t3={10:0}, t4={13: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={11:0}, t3={10:0}, t4={13: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={11:0}, t3={10:0}, t4={13: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={11:0}, t3={10:0}, t4={13: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={11:0}, t3={10:0}, t4={13: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={11:0}, t3={10:0}, t4={13: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={11:0}, t3={10:0}, t4={13: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={11:0}, t3={10:0}, t4={13: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={11:0}, t3={10:0}, t4={13: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={11:0}, t3={10:0}, t4={13: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={11:0}, t3={10:0}, t4={13: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={11:0}, t3={10:0}, t4={13: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={11:0}, t3={10:0}, t4={13: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={11:0}, t3={10:0}, t4={13: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={11:0}, t3={10:0}, t4={13: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: 3.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 153200.8ms, OverallIterations: 46, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 114831.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2229.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1385 SDtfs, 2929 SDslu, 3267 SDs, 0 SdLazy, 11823 SolverSat, 1096 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6560.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 622 GetRequests, 55 SyntacticMatches, 16 SemanticMatches, 551 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 9624.8ms 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: 65.9ms SsaConstructionTime, 358.0ms SatisfiabilityAnalysisTime, 4908.9ms 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...