/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 22:38:27,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 22:38:27,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 22:38:27,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 22:38:27,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 22:38:27,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 22:38:27,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 22:38:27,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 22:38:27,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 22:38:27,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 22:38:27,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 22:38:27,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 22:38:27,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 22:38:27,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 22:38:27,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 22:38:27,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 22:38:27,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 22:38:27,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 22:38:27,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 22:38:27,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 22:38:27,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 22:38:27,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 22:38:27,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 22:38:27,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 22:38:27,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 22:38:27,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 22:38:27,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 22:38:27,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 22:38:27,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 22:38:27,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 22:38:27,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 22:38:27,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 22:38:27,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 22:38:27,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 22:38:27,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 22:38:27,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 22:38:27,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 22:38:27,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 22:38:27,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 22:38:27,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 22:38:27,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 22:38:27,873 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-25 22:38:27,907 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 22:38:27,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 22:38:27,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 22:38:27,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 22:38:27,910 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 22:38:27,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 22:38:27,910 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 22:38:27,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 22:38:27,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 22:38:27,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 22:38:27,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 22:38:27,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 22:38:27,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 22:38:27,912 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 22:38:27,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 22:38:27,912 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 22:38:27,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 22:38:27,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 22:38:27,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 22:38:27,913 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 22:38:27,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 22:38:27,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 22:38:27,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 22:38:27,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 22:38:27,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 22:38:27,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 22:38:27,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 22:38:27,914 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-25 22:38:27,914 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 22:38:27,915 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 22:38:27,915 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 22:38:28,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 22:38:28,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 22:38:28,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 22:38:28,232 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 22:38:28,232 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 22:38:28,233 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i [2021-03-25 22:38:28,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9fcb031/a071f76fe3434e5884816eee7b454cbf/FLAG20f685668 [2021-03-25 22:38:28,724 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 22:38:28,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i [2021-03-25 22:38:28,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9fcb031/a071f76fe3434e5884816eee7b454cbf/FLAG20f685668 [2021-03-25 22:38:29,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9fcb031/a071f76fe3434e5884816eee7b454cbf [2021-03-25 22:38:29,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 22:38:29,031 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 22:38:29,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 22:38:29,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 22:38:29,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 22:38:29,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 10:38:29" (1/1) ... [2021-03-25 22:38:29,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d9c2eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:38:29, skipping insertion in model container [2021-03-25 22:38:29,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 10:38:29" (1/1) ... [2021-03-25 22:38:29,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 22:38:29,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 22:38:29,266 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-25 22:38:29,462 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_with-uninit-problems.i[55568,55581] [2021-03-25 22:38:29,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 22:38:29,496 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 22:38:29,525 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-25 22:38:29,548 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_with-uninit-problems.i[55568,55581] [2021-03-25 22:38:29,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 22:38:29,693 INFO L208 MainTranslator]: Completed translation [2021-03-25 22:38:29,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:38:29 WrapperNode [2021-03-25 22:38:29,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 22:38:29,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 22:38:29,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 22:38:29,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 22:38:29,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:38:29" (1/1) ... [2021-03-25 22:38:29,731 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:38:29" (1/1) ... [2021-03-25 22:38:29,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 22:38:29,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 22:38:29,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 22:38:29,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 22:38:29,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:38:29" (1/1) ... [2021-03-25 22:38:29,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:38:29" (1/1) ... [2021-03-25 22:38:29,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:38:29" (1/1) ... [2021-03-25 22:38:29,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:38:29" (1/1) ... [2021-03-25 22:38:29,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:38:29" (1/1) ... [2021-03-25 22:38:29,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:38:29" (1/1) ... [2021-03-25 22:38:29,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:38:29" (1/1) ... [2021-03-25 22:38:29,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 22:38:29,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 22:38:29,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 22:38:29,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 22:38:29,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:38:29" (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 22:38:29,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 22:38:29,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 22:38:29,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 22:38:29,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 22:38:29,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 22:38:29,855 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2021-03-25 22:38:29,855 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2021-03-25 22:38:29,855 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-25 22:38:29,855 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-25 22:38:29,856 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-25 22:38:29,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-25 22:38:29,856 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-25 22:38:29,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-25 22:38:29,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 22:38:29,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-03-25 22:38:29,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 22:38:29,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 22:38:29,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 22:38:29,858 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 22:38:30,234 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 22:38:30,235 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-03-25 22:38:30,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 10:38:30 BoogieIcfgContainer [2021-03-25 22:38:30,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 22:38:30,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 22:38:30,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 22:38:30,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 22:38:30,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 10:38:29" (1/3) ... [2021-03-25 22:38:30,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc37079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 10:38:30, skipping insertion in model container [2021-03-25 22:38:30,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:38:29" (2/3) ... [2021-03-25 22:38:30,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc37079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 10:38:30, skipping insertion in model container [2021-03-25 22:38:30,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 10:38:30" (3/3) ... [2021-03-25 22:38:30,243 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.i [2021-03-25 22:38:30,249 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 22:38:30,253 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-25 22:38:30,254 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 22:38:30,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,321 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,321 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,322 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,322 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,322 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,322 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,322 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,322 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,322 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,322 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,323 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,323 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,323 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,323 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,323 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,323 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,324 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,324 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,324 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,324 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,324 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,324 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,324 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,324 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,325 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,325 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,325 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,325 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,325 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,325 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,325 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,326 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,326 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,326 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,326 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,326 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,326 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,327 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,327 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,327 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,327 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,327 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,327 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,327 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,328 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,328 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,328 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,328 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,328 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,328 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,328 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,328 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,329 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,329 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,329 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,329 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,329 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,329 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,329 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,329 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,330 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,330 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,330 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,330 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,330 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,330 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,330 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,330 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,330 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,331 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,331 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,331 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,331 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,331 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,331 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,331 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,331 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,332 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,332 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,332 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,332 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,332 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,332 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,332 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,332 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,332 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,333 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,333 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,333 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,333 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,333 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,333 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,333 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,333 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,333 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,334 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,334 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,334 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,334 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,334 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,334 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,334 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,334 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,335 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,335 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,335 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,335 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,335 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,335 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,335 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,338 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,338 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,339 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,339 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,339 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,339 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,339 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,340 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,340 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,340 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,340 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,341 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,341 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,341 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,341 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,341 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,341 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,342 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,342 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,342 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,343 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,343 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,343 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,343 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,343 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,343 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,343 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,344 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,344 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,345 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,345 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,345 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,345 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,345 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,345 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,346 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,346 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,346 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,346 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,347 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,347 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,347 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,347 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,347 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,347 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,347 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,347 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,347 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,348 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,348 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,348 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,348 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,348 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,348 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,348 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,349 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,349 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,349 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,351 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,351 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,351 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,351 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,351 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,352 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,352 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,352 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,352 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,352 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,352 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,352 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,352 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,352 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,353 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,353 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,353 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,353 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,353 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,353 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,354 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,354 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,354 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,354 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,356 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,356 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,357 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,357 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,358 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,359 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,359 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,359 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,364 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,364 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,364 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,365 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,366 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,366 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,366 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,367 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,369 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,369 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,369 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,369 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,369 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,369 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,372 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,372 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,373 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,375 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,376 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,376 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,377 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,382 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,382 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,382 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,382 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,382 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,382 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,382 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,383 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,383 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,383 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,388 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,388 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,389 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,389 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,389 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,389 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,389 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,394 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,394 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,394 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,394 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,396 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,396 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,396 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,396 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,396 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,396 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,398 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,398 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,398 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,398 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,400 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,400 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,400 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,400 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,403 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,403 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,403 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,403 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,405 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,405 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,406 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,406 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:38:30,509 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2021-03-25 22:38:30,523 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-03-25 22:38:30,538 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 22:38:30,538 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 22:38:30,538 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 22:38:30,538 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 22:38:30,539 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 22:38:30,539 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 22:38:30,539 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 22:38:30,539 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 22:38:30,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 255 transitions, 890 flow [2021-03-25 22:38:30,621 INFO L129 PetriNetUnfolder]: 67/316 cut-off events. [2021-03-25 22:38:30,622 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-03-25 22:38:30,644 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 316 events. 67/316 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 995 event pairs, 0 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 365. Up to 24 conditions per place. [2021-03-25 22:38:30,644 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 255 transitions, 890 flow [2021-03-25 22:38:30,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 147 transitions, 447 flow [2021-03-25 22:38:30,652 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:38:30,661 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 147 transitions, 447 flow [2021-03-25 22:38:30,664 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 147 transitions, 447 flow [2021-03-25 22:38:30,666 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 147 transitions, 447 flow [2021-03-25 22:38:30,716 INFO L129 PetriNetUnfolder]: 67/316 cut-off events. [2021-03-25 22:38:30,717 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-03-25 22:38:30,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 316 events. 67/316 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 983 event pairs, 0 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 365. Up to 24 conditions per place. [2021-03-25 22:38:30,735 INFO L142 LiptonReduction]: Number of co-enabled transitions 4982 [2021-03-25 22:38:32,843 INFO L154 LiptonReduction]: Checked pairs total: 2660 [2021-03-25 22:38:32,844 INFO L156 LiptonReduction]: Total number of compositions: 70 [2021-03-25 22:38:32,846 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2195 [2021-03-25 22:38:32,866 INFO L129 PetriNetUnfolder]: 2/21 cut-off events. [2021-03-25 22:38:32,866 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 22:38:32,866 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:38:32,866 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 22:38:32,867 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:38:32,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:38:32,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1880774221, now seen corresponding path program 1 times [2021-03-25 22:38:32,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:38:32,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652691777] [2021-03-25 22:38:32,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:38:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:38:33,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:33,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:33,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:33,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 22:38:33,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:33,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:38:33,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:33,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:38:33,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:33,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 22:38:33,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:33,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:38:33,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:33,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:33,157 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 22:38:33,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652691777] [2021-03-25 22:38:33,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:38:33,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 22:38:33,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451633962] [2021-03-25 22:38:33,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 22:38:33,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:38:33,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 22:38:33,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 22:38:33,184 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 336 [2021-03-25 22:38:33,190 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 85 transitions, 323 flow. Second operand has 7 states, 7 states have (on average 193.71428571428572) internal successors, (1356), 7 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:33,191 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:38:33,191 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 336 [2021-03-25 22:38:33,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:38:33,901 INFO L129 PetriNetUnfolder]: 3307/4976 cut-off events. [2021-03-25 22:38:33,901 INFO L130 PetriNetUnfolder]: For 1440/1445 co-relation queries the response was YES. [2021-03-25 22:38:33,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10444 conditions, 4976 events. 3307/4976 cut-off events. For 1440/1445 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 26754 event pairs, 1751 based on Foata normal form. 121/3980 useless extension candidates. Maximal degree in co-relation 10407. Up to 2724 conditions per place. [2021-03-25 22:38:33,944 INFO L132 encePairwiseOnDemand]: 325/336 looper letters, 69 selfloop transitions, 7 changer transitions 4/121 dead transitions. [2021-03-25 22:38:33,944 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 121 transitions, 588 flow [2021-03-25 22:38:33,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 22:38:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 22:38:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1620 transitions. [2021-03-25 22:38:33,962 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6026785714285714 [2021-03-25 22:38:33,962 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1620 transitions. [2021-03-25 22:38:33,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1620 transitions. [2021-03-25 22:38:33,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:38:33,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1620 transitions. [2021-03-25 22:38:33,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 202.5) internal successors, (1620), 8 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:33,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 336.0) internal successors, (3024), 9 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:33,988 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 336.0) internal successors, (3024), 9 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:33,989 INFO L185 Difference]: Start difference. First operand has 64 places, 85 transitions, 323 flow. Second operand 8 states and 1620 transitions. [2021-03-25 22:38:33,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 121 transitions, 588 flow [2021-03-25 22:38:34,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 121 transitions, 464 flow, removed 0 selfloop flow, removed 12 redundant places. [2021-03-25 22:38:34,005 INFO L241 Difference]: Finished difference. Result has 62 places, 86 transitions, 256 flow [2021-03-25 22:38:34,007 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=256, PETRI_PLACES=62, PETRI_TRANSITIONS=86} [2021-03-25 22:38:34,007 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2021-03-25 22:38:34,007 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:38:34,008 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 86 transitions, 256 flow [2021-03-25 22:38:34,009 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 86 transitions, 256 flow [2021-03-25 22:38:34,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 86 transitions, 256 flow [2021-03-25 22:38:34,027 INFO L129 PetriNetUnfolder]: 115/277 cut-off events. [2021-03-25 22:38:34,027 INFO L130 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2021-03-25 22:38:34,028 INFO L84 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 277 events. 115/277 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 883 event pairs, 1 based on Foata normal form. 1/196 useless extension candidates. Maximal degree in co-relation 320. Up to 48 conditions per place. [2021-03-25 22:38:34,031 INFO L142 LiptonReduction]: Number of co-enabled transitions 1484 [2021-03-25 22:38:34,902 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2021-03-25 22:38:35,065 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2021-03-25 22:38:35,367 INFO L154 LiptonReduction]: Checked pairs total: 323 [2021-03-25 22:38:35,368 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 22:38:35,368 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1361 [2021-03-25 22:38:35,370 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 75 transitions, 234 flow [2021-03-25 22:38:35,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 193.71428571428572) internal successors, (1356), 7 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:35,371 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:38:35,371 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 22:38:35,372 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 22:38:35,372 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:38:35,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:38:35,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1911423025, now seen corresponding path program 1 times [2021-03-25 22:38:35,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:38:35,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561603838] [2021-03-25 22:38:35,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:38:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:38:35,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:35,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:35,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:35,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:38:35,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:35,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:38:35,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:35,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:38:35,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:35,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:35,469 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 22:38:35,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561603838] [2021-03-25 22:38:35,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:38:35,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 22:38:35,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21917307] [2021-03-25 22:38:35,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 22:38:35,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:38:35,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 22:38:35,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 22:38:35,474 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 348 [2021-03-25 22:38:35,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 75 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 236.6) internal successors, (1183), 5 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:35,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:38:35,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 348 [2021-03-25 22:38:35,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:38:36,043 INFO L129 PetriNetUnfolder]: 4056/5694 cut-off events. [2021-03-25 22:38:36,043 INFO L130 PetriNetUnfolder]: For 1025/1025 co-relation queries the response was YES. [2021-03-25 22:38:36,055 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10629 conditions, 5694 events. 4056/5694 cut-off events. For 1025/1025 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 26293 event pairs, 1893 based on Foata normal form. 2/4271 useless extension candidates. Maximal degree in co-relation 9570. Up to 3235 conditions per place. [2021-03-25 22:38:36,082 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 58 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2021-03-25 22:38:36,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 103 transitions, 442 flow [2021-03-25 22:38:36,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 22:38:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 22:38:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1473 transitions. [2021-03-25 22:38:36,086 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7054597701149425 [2021-03-25 22:38:36,086 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1473 transitions. [2021-03-25 22:38:36,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1473 transitions. [2021-03-25 22:38:36,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:38:36,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1473 transitions. [2021-03-25 22:38:36,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 245.5) internal successors, (1473), 6 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:36,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 348.0) internal successors, (2436), 7 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:36,094 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 348.0) internal successors, (2436), 7 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:36,094 INFO L185 Difference]: Start difference. First operand has 50 places, 75 transitions, 234 flow. Second operand 6 states and 1473 transitions. [2021-03-25 22:38:36,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 103 transitions, 442 flow [2021-03-25 22:38:36,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 103 transitions, 429 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-03-25 22:38:36,102 INFO L241 Difference]: Finished difference. Result has 54 places, 79 transitions, 269 flow [2021-03-25 22:38:36,102 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=54, PETRI_TRANSITIONS=79} [2021-03-25 22:38:36,103 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, -10 predicate places. [2021-03-25 22:38:36,103 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:38:36,103 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 79 transitions, 269 flow [2021-03-25 22:38:36,104 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 79 transitions, 269 flow [2021-03-25 22:38:36,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 79 transitions, 269 flow [2021-03-25 22:38:36,131 INFO L129 PetriNetUnfolder]: 174/356 cut-off events. [2021-03-25 22:38:36,131 INFO L130 PetriNetUnfolder]: For 23/24 co-relation queries the response was YES. [2021-03-25 22:38:36,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 356 events. 174/356 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1162 event pairs, 1 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 308. Up to 72 conditions per place. [2021-03-25 22:38:36,135 INFO L142 LiptonReduction]: Number of co-enabled transitions 1154 [2021-03-25 22:38:36,138 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:38:36,138 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:38:36,138 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-25 22:38:36,140 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 79 transitions, 269 flow [2021-03-25 22:38:36,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 236.6) internal successors, (1183), 5 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:36,141 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:38:36,141 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 22:38:36,141 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 22:38:36,142 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:38:36,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:38:36,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1741067560, now seen corresponding path program 1 times [2021-03-25 22:38:36,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:38:36,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095116854] [2021-03-25 22:38:36,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:38:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:38:36,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:36,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 22:38:36,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:36,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:38:36,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:36,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:38:36,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:36,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:38:36,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:36,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:36,246 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 22:38:36,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095116854] [2021-03-25 22:38:36,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:38:36,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 22:38:36,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068622171] [2021-03-25 22:38:36,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 22:38:36,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:38:36,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 22:38:36,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 22:38:36,249 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 348 [2021-03-25 22:38:36,251 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 79 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:36,251 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:38:36,251 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 348 [2021-03-25 22:38:36,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:38:36,967 INFO L129 PetriNetUnfolder]: 4974/6927 cut-off events. [2021-03-25 22:38:36,967 INFO L130 PetriNetUnfolder]: For 1741/1741 co-relation queries the response was YES. [2021-03-25 22:38:36,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13252 conditions, 6927 events. 4974/6927 cut-off events. For 1741/1741 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 32693 event pairs, 2253 based on Foata normal form. 2/5194 useless extension candidates. Maximal degree in co-relation 10690. Up to 2520 conditions per place. [2021-03-25 22:38:37,013 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 82 selfloop transitions, 12 changer transitions 0/131 dead transitions. [2021-03-25 22:38:37,014 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 131 transitions, 588 flow [2021-03-25 22:38:37,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 22:38:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 22:38:37,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1457 transitions. [2021-03-25 22:38:37,017 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5981116584564861 [2021-03-25 22:38:37,017 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1457 transitions. [2021-03-25 22:38:37,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1457 transitions. [2021-03-25 22:38:37,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:38:37,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1457 transitions. [2021-03-25 22:38:37,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 208.14285714285714) internal successors, (1457), 7 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:37,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:37,026 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:37,026 INFO L185 Difference]: Start difference. First operand has 54 places, 79 transitions, 269 flow. Second operand 7 states and 1457 transitions. [2021-03-25 22:38:37,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 131 transitions, 588 flow [2021-03-25 22:38:37,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 131 transitions, 577 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-25 22:38:37,035 INFO L241 Difference]: Finished difference. Result has 61 places, 81 transitions, 311 flow [2021-03-25 22:38:37,035 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=61, PETRI_TRANSITIONS=81} [2021-03-25 22:38:37,036 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2021-03-25 22:38:37,036 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:38:37,036 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 81 transitions, 311 flow [2021-03-25 22:38:37,037 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 81 transitions, 311 flow [2021-03-25 22:38:37,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 81 transitions, 311 flow [2021-03-25 22:38:37,066 INFO L129 PetriNetUnfolder]: 230/457 cut-off events. [2021-03-25 22:38:37,067 INFO L130 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2021-03-25 22:38:37,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 457 events. 230/457 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1645 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 410. Up to 96 conditions per place. [2021-03-25 22:38:37,072 INFO L142 LiptonReduction]: Number of co-enabled transitions 1222 [2021-03-25 22:38:37,075 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:38:37,075 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:38:37,075 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-03-25 22:38:37,078 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 81 transitions, 311 flow [2021-03-25 22:38:37,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:37,079 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:38:37,079 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 22:38:37,080 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 22:38:37,080 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:38:37,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:38:37,080 INFO L82 PathProgramCache]: Analyzing trace with hash 883125792, now seen corresponding path program 1 times [2021-03-25 22:38:37,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:38:37,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512166131] [2021-03-25 22:38:37,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:38:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:38:37,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:37,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:37,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:37,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:38:37,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:37,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:37,137 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 22:38:37,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512166131] [2021-03-25 22:38:37,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:38:37,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 22:38:37,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765287852] [2021-03-25 22:38:37,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 22:38:37,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:38:37,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 22:38:37,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 22:38:37,140 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 348 [2021-03-25 22:38:37,141 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 81 transitions, 311 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 22:38:37,141 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:38:37,141 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 348 [2021-03-25 22:38:37,141 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:38:37,760 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][32], [Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 202#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 215#(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: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 220#(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)), 213#true, 42#L1156-1true, 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 125#L1164-2true]) [2021-03-25 22:38:37,760 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,760 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,761 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,761 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,761 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][42], [Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 202#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 215#(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: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 220#(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)), 213#true, 229#true, 42#L1156-1true, 125#L1164-2true]) [2021-03-25 22:38:37,761 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,761 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,761 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,761 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,762 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][35], [Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 202#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 220#(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: 203#(= |ULTIMATE.start_main_#t~mem18| 5), 213#true, 42#L1156-1true, 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 125#L1164-2true]) [2021-03-25 22:38:37,762 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,762 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,762 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,762 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,763 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][34], [Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 187#(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: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 202#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 220#(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: 203#(= |ULTIMATE.start_main_#t~mem18| 5), 213#true, 229#true, 42#L1156-1true, 125#L1164-2true]) [2021-03-25 22:38:37,763 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,763 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,763 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,763 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,763 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][37], [Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 187#(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: 215#(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: 202#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 220#(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: 203#(= |ULTIMATE.start_main_#t~mem18| 5), 213#true, 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 42#L1156-1true, 125#L1164-2true]) [2021-03-25 22:38:37,763 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,763 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,764 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,764 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,764 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][36], [Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 202#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 220#(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: 203#(= |ULTIMATE.start_main_#t~mem18| 5), 213#true, 229#true, 42#L1156-1true, 125#L1164-2true]) [2021-03-25 22:38:37,764 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,764 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,764 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,764 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:37,765 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][31], [Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 187#(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: 215#(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: 202#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 220#(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)), 213#true, 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 42#L1156-1true, 125#L1164-2true]) [2021-03-25 22:38:37,765 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-03-25 22:38:37,765 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 22:38:37,765 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 22:38:37,765 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 22:38:37,765 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][30], [Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 187#(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: 215#(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: 202#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 220#(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)), 213#true, 229#true, 42#L1156-1true, 125#L1164-2true]) [2021-03-25 22:38:37,765 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-03-25 22:38:37,766 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 22:38:37,766 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 22:38:37,766 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 22:38:37,768 INFO L129 PetriNetUnfolder]: 5344/7964 cut-off events. [2021-03-25 22:38:37,768 INFO L130 PetriNetUnfolder]: For 6190/6190 co-relation queries the response was YES. [2021-03-25 22:38:37,793 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17336 conditions, 7964 events. 5344/7964 cut-off events. For 6190/6190 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 45393 event pairs, 563 based on Foata normal form. 0/6058 useless extension candidates. Maximal degree in co-relation 11570. Up to 2435 conditions per place. [2021-03-25 22:38:37,836 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 48 selfloop transitions, 20 changer transitions 2/122 dead transitions. [2021-03-25 22:38:37,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 122 transitions, 561 flow [2021-03-25 22:38:37,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 22:38:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 22:38:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1350 transitions. [2021-03-25 22:38:37,840 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7758620689655172 [2021-03-25 22:38:37,840 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1350 transitions. [2021-03-25 22:38:37,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1350 transitions. [2021-03-25 22:38:37,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:38:37,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1350 transitions. [2021-03-25 22:38:37,843 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 22:38:37,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:37,847 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:37,847 INFO L185 Difference]: Start difference. First operand has 61 places, 81 transitions, 311 flow. Second operand 5 states and 1350 transitions. [2021-03-25 22:38:37,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 122 transitions, 561 flow [2021-03-25 22:38:37,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 122 transitions, 540 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-03-25 22:38:37,862 INFO L241 Difference]: Finished difference. Result has 67 places, 101 transitions, 476 flow [2021-03-25 22:38:37,862 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=476, PETRI_PLACES=67, PETRI_TRANSITIONS=101} [2021-03-25 22:38:37,862 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2021-03-25 22:38:37,862 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:38:37,863 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 101 transitions, 476 flow [2021-03-25 22:38:37,863 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 101 transitions, 476 flow [2021-03-25 22:38:37,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 101 transitions, 476 flow [2021-03-25 22:38:38,052 INFO L129 PetriNetUnfolder]: 1930/3496 cut-off events. [2021-03-25 22:38:38,052 INFO L130 PetriNetUnfolder]: For 1857/1872 co-relation queries the response was YES. [2021-03-25 22:38:38,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6224 conditions, 3496 events. 1930/3496 cut-off events. For 1857/1872 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 23304 event pairs, 76 based on Foata normal form. 10/2428 useless extension candidates. Maximal degree in co-relation 4122. Up to 718 conditions per place. [2021-03-25 22:38:38,129 INFO L142 LiptonReduction]: Number of co-enabled transitions 1914 [2021-03-25 22:38:38,134 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:38:38,134 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:38:38,134 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 272 [2021-03-25 22:38:38,135 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 101 transitions, 476 flow [2021-03-25 22:38:38,137 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 22:38:38,137 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:38:38,137 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 22:38:38,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 22:38:38,137 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:38:38,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:38:38,138 INFO L82 PathProgramCache]: Analyzing trace with hash 2007144294, now seen corresponding path program 1 times [2021-03-25 22:38:38,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:38:38,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820687329] [2021-03-25 22:38:38,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:38:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:38:38,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:38,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 22:38:38,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:38,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 22:38:38,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:38,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:38:38,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:38,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:38:38,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:38,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 22:38:38,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820687329] [2021-03-25 22:38:38,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:38:38,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 22:38:38,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7315663] [2021-03-25 22:38:38,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 22:38:38,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:38:38,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 22:38:38,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 22:38:38,222 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 348 [2021-03-25 22:38:38,223 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 101 transitions, 476 flow. Second operand has 6 states, 6 states have (on average 194.16666666666666) internal successors, (1165), 6 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:38,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:38:38,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 348 [2021-03-25 22:38:38,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:38:39,253 INFO L129 PetriNetUnfolder]: 8841/12184 cut-off events. [2021-03-25 22:38:39,253 INFO L130 PetriNetUnfolder]: For 15760/16001 co-relation queries the response was YES. [2021-03-25 22:38:39,292 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33357 conditions, 12184 events. 8841/12184 cut-off events. For 15760/16001 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 61792 event pairs, 2226 based on Foata normal form. 224/9246 useless extension candidates. Maximal degree in co-relation 23844. Up to 5422 conditions per place. [2021-03-25 22:38:39,338 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 90 selfloop transitions, 16 changer transitions 0/138 dead transitions. [2021-03-25 22:38:39,338 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 138 transitions, 832 flow [2021-03-25 22:38:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 22:38:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 22:38:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1613 transitions. [2021-03-25 22:38:39,343 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.579382183908046 [2021-03-25 22:38:39,343 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1613 transitions. [2021-03-25 22:38:39,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1613 transitions. [2021-03-25 22:38:39,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:38:39,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1613 transitions. [2021-03-25 22:38:39,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 201.625) internal successors, (1613), 8 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:39,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:39,350 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:39,350 INFO L185 Difference]: Start difference. First operand has 67 places, 101 transitions, 476 flow. Second operand 8 states and 1613 transitions. [2021-03-25 22:38:39,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 138 transitions, 832 flow [2021-03-25 22:38:39,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 138 transitions, 832 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 22:38:39,365 INFO L241 Difference]: Finished difference. Result has 76 places, 102 transitions, 527 flow [2021-03-25 22:38:39,365 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=527, PETRI_PLACES=76, PETRI_TRANSITIONS=102} [2021-03-25 22:38:39,365 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 12 predicate places. [2021-03-25 22:38:39,365 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:38:39,365 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 102 transitions, 527 flow [2021-03-25 22:38:39,366 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 102 transitions, 527 flow [2021-03-25 22:38:39,366 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 102 transitions, 527 flow [2021-03-25 22:38:39,543 INFO L129 PetriNetUnfolder]: 1823/3350 cut-off events. [2021-03-25 22:38:39,544 INFO L130 PetriNetUnfolder]: For 2026/2044 co-relation queries the response was YES. [2021-03-25 22:38:39,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6157 conditions, 3350 events. 1823/3350 cut-off events. For 2026/2044 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 22692 event pairs, 76 based on Foata normal form. 13/2341 useless extension candidates. Maximal degree in co-relation 4229. Up to 722 conditions per place. [2021-03-25 22:38:39,590 INFO L142 LiptonReduction]: Number of co-enabled transitions 1902 [2021-03-25 22:38:39,595 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:38:39,595 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:38:39,595 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 230 [2021-03-25 22:38:39,597 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 102 transitions, 527 flow [2021-03-25 22:38:39,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 194.16666666666666) internal successors, (1165), 6 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:39,597 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:38:39,597 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 22:38:39,598 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 22:38:39,598 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:38:39,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:38:39,598 INFO L82 PathProgramCache]: Analyzing trace with hash -185521214, now seen corresponding path program 2 times [2021-03-25 22:38:39,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:38:39,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970818183] [2021-03-25 22:38:39,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:38:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:38:39,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:39,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:39,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:39,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 22:38:39,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:39,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:38:39,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:39,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:38:39,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:39,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:38:39,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:39,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:39,669 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 22:38:39,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970818183] [2021-03-25 22:38:39,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:38:39,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 22:38:39,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431289122] [2021-03-25 22:38:39,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 22:38:39,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:38:39,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 22:38:39,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 22:38:39,672 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 348 [2021-03-25 22:38:39,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 102 transitions, 527 flow. Second operand has 7 states, 7 states have (on average 236.57142857142858) internal successors, (1656), 7 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:39,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:38:39,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 348 [2021-03-25 22:38:39,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:38:40,305 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][33], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 220#(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)), 42#L1156-1true, 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 229#true, Black: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), 269#(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|) |ULTIMATE.start_main_#t~short21|), Black: 232#|ULTIMATE.start_main_#t~short21|, 240#true, Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 202#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), 125#L1164-2true, Black: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:38:40,306 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 22:38:40,306 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:40,306 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:40,306 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:40,306 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][48], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 220#(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)), 229#true, 265#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), 42#L1156-1true, Black: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 232#|ULTIMATE.start_main_#t~short21|, Black: 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 240#true, Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 202#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), 125#L1164-2true, Black: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:38:40,306 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 22:38:40,306 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:40,306 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:40,307 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:40,324 INFO L129 PetriNetUnfolder]: 5295/8001 cut-off events. [2021-03-25 22:38:40,324 INFO L130 PetriNetUnfolder]: For 15808/16153 co-relation queries the response was YES. [2021-03-25 22:38:40,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24110 conditions, 8001 events. 5295/8001 cut-off events. For 15808/16153 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 46954 event pairs, 609 based on Foata normal form. 180/6341 useless extension candidates. Maximal degree in co-relation 17298. Up to 2487 conditions per place. [2021-03-25 22:38:40,406 INFO L132 encePairwiseOnDemand]: 336/348 looper letters, 56 selfloop transitions, 34 changer transitions 10/151 dead transitions. [2021-03-25 22:38:40,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 151 transitions, 1016 flow [2021-03-25 22:38:40,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 22:38:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 22:38:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2187 transitions. [2021-03-25 22:38:40,411 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6982758620689655 [2021-03-25 22:38:40,411 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2187 transitions. [2021-03-25 22:38:40,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2187 transitions. [2021-03-25 22:38:40,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:38:40,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2187 transitions. [2021-03-25 22:38:40,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 243.0) internal successors, (2187), 9 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:40,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:40,420 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:40,420 INFO L185 Difference]: Start difference. First operand has 76 places, 102 transitions, 527 flow. Second operand 9 states and 2187 transitions. [2021-03-25 22:38:40,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 151 transitions, 1016 flow [2021-03-25 22:38:40,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 151 transitions, 980 flow, removed 1 selfloop flow, removed 6 redundant places. [2021-03-25 22:38:40,437 INFO L241 Difference]: Finished difference. Result has 81 places, 114 transitions, 711 flow [2021-03-25 22:38:40,437 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=711, PETRI_PLACES=81, PETRI_TRANSITIONS=114} [2021-03-25 22:38:40,437 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 17 predicate places. [2021-03-25 22:38:40,437 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:38:40,437 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 114 transitions, 711 flow [2021-03-25 22:38:40,437 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 114 transitions, 711 flow [2021-03-25 22:38:40,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 114 transitions, 711 flow [2021-03-25 22:38:40,638 INFO L129 PetriNetUnfolder]: 1932/3547 cut-off events. [2021-03-25 22:38:40,638 INFO L130 PetriNetUnfolder]: For 4566/4597 co-relation queries the response was YES. [2021-03-25 22:38:40,652 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7761 conditions, 3547 events. 1932/3547 cut-off events. For 4566/4597 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 24287 event pairs, 78 based on Foata normal form. 20/2516 useless extension candidates. Maximal degree in co-relation 5832. Up to 768 conditions per place. [2021-03-25 22:38:40,675 INFO L142 LiptonReduction]: Number of co-enabled transitions 2076 [2021-03-25 22:38:40,681 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:38:40,681 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:38:40,681 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 244 [2021-03-25 22:38:40,682 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 114 transitions, 711 flow [2021-03-25 22:38:40,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 236.57142857142858) internal successors, (1656), 7 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:40,683 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:38:40,683 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 22:38:40,683 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 22:38:40,683 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:38:40,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:38:40,684 INFO L82 PathProgramCache]: Analyzing trace with hash 38701981, now seen corresponding path program 1 times [2021-03-25 22:38:40,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:38:40,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362378600] [2021-03-25 22:38:40,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:38:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:38:40,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:40,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:40,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:40,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:38:40,709 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 22:38:40,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362378600] [2021-03-25 22:38:40,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:38:40,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 22:38:40,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361264427] [2021-03-25 22:38:40,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 22:38:40,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:38:40,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 22:38:40,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 22:38:40,712 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 348 [2021-03-25 22:38:40,712 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 114 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:40,712 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:38:40,713 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 348 [2021-03-25 22:38:40,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:38:41,279 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][52], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 187#(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: 215#(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: 220#(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)), 229#true, 265#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), 42#L1156-1true, Black: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 232#|ULTIMATE.start_main_#t~short21|, Black: 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 267#(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: 269#(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|) |ULTIMATE.start_main_#t~short21|), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 271#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), 280#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 125#L1164-2true, Black: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:38:41,279 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 22:38:41,279 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:41,279 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:41,279 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:41,280 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][30], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 187#(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: 215#(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: 220#(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)), 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 42#L1156-1true, Black: 229#true, 269#(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|) |ULTIMATE.start_main_#t~short21|), Black: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 232#|ULTIMATE.start_main_#t~short21|, Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 267#(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: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 271#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), 278#true, 125#L1164-2true, Black: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:38:41,280 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 22:38:41,280 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:41,280 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:41,280 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:41,288 INFO L129 PetriNetUnfolder]: 5777/8739 cut-off events. [2021-03-25 22:38:41,288 INFO L130 PetriNetUnfolder]: For 31750/32366 co-relation queries the response was YES. [2021-03-25 22:38:41,318 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30608 conditions, 8739 events. 5777/8739 cut-off events. For 31750/32366 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 52328 event pairs, 621 based on Foata normal form. 222/7185 useless extension candidates. Maximal degree in co-relation 24236. Up to 4370 conditions per place. [2021-03-25 22:38:41,362 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 67 selfloop transitions, 16 changer transitions 1/136 dead transitions. [2021-03-25 22:38:41,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 136 transitions, 1052 flow [2021-03-25 22:38:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 22:38:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 22:38:41,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2021-03-25 22:38:41,365 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8132183908045977 [2021-03-25 22:38:41,365 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 849 transitions. [2021-03-25 22:38:41,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 849 transitions. [2021-03-25 22:38:41,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:38:41,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 849 transitions. [2021-03-25 22:38:41,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:41,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:41,369 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:41,369 INFO L185 Difference]: Start difference. First operand has 79 places, 114 transitions, 711 flow. Second operand 3 states and 849 transitions. [2021-03-25 22:38:41,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 136 transitions, 1052 flow [2021-03-25 22:38:41,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 136 transitions, 1046 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 22:38:41,427 INFO L241 Difference]: Finished difference. Result has 80 places, 123 transitions, 865 flow [2021-03-25 22:38:41,427 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=865, PETRI_PLACES=80, PETRI_TRANSITIONS=123} [2021-03-25 22:38:41,427 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 16 predicate places. [2021-03-25 22:38:41,427 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:38:41,428 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 123 transitions, 865 flow [2021-03-25 22:38:41,428 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 123 transitions, 865 flow [2021-03-25 22:38:41,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 123 transitions, 865 flow [2021-03-25 22:38:41,643 INFO L129 PetriNetUnfolder]: 2267/4100 cut-off events. [2021-03-25 22:38:41,643 INFO L130 PetriNetUnfolder]: For 7266/7388 co-relation queries the response was YES. [2021-03-25 22:38:41,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9762 conditions, 4100 events. 2267/4100 cut-off events. For 7266/7388 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 28698 event pairs, 75 based on Foata normal form. 22/2934 useless extension candidates. Maximal degree in co-relation 7361. Up to 914 conditions per place. [2021-03-25 22:38:41,685 INFO L142 LiptonReduction]: Number of co-enabled transitions 2306 [2021-03-25 22:38:41,691 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:38:41,691 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:38:41,691 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 264 [2021-03-25 22:38:41,692 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 123 transitions, 865 flow [2021-03-25 22:38:41,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:41,692 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:38:41,692 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 22:38:41,692 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 22:38:41,692 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:38:41,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:38:41,693 INFO L82 PathProgramCache]: Analyzing trace with hash -480965221, now seen corresponding path program 1 times [2021-03-25 22:38:41,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:38:41,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048139562] [2021-03-25 22:38:41,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:38:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:38:41,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:41,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 22:38:41,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:41,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 22:38:41,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:41,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:38:41,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:41,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:38:41,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:41,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:41,737 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 22:38:41,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048139562] [2021-03-25 22:38:41,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:38:41,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 22:38:41,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705893379] [2021-03-25 22:38:41,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 22:38:41,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:38:41,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 22:38:41,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 22:38:41,740 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 348 [2021-03-25 22:38:41,741 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 123 transitions, 865 flow. Second operand has 6 states, 6 states have (on average 194.33333333333334) internal successors, (1166), 6 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:41,741 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:38:41,741 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 348 [2021-03-25 22:38:41,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:38:42,630 INFO L129 PetriNetUnfolder]: 9056/12715 cut-off events. [2021-03-25 22:38:42,630 INFO L130 PetriNetUnfolder]: For 52335/53103 co-relation queries the response was YES. [2021-03-25 22:38:42,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45155 conditions, 12715 events. 9056/12715 cut-off events. For 52335/53103 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 67840 event pairs, 1908 based on Foata normal form. 281/10085 useless extension candidates. Maximal degree in co-relation 37022. Up to 6303 conditions per place. [2021-03-25 22:38:42,690 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 103 selfloop transitions, 16 changer transitions 19/165 dead transitions. [2021-03-25 22:38:42,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 165 transitions, 1398 flow [2021-03-25 22:38:42,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 22:38:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 22:38:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1610 transitions. [2021-03-25 22:38:42,694 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5783045977011494 [2021-03-25 22:38:42,694 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1610 transitions. [2021-03-25 22:38:42,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1610 transitions. [2021-03-25 22:38:42,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:38:42,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1610 transitions. [2021-03-25 22:38:42,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 201.25) internal successors, (1610), 8 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:42,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:42,702 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:42,702 INFO L185 Difference]: Start difference. First operand has 80 places, 123 transitions, 865 flow. Second operand 8 states and 1610 transitions. [2021-03-25 22:38:42,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 165 transitions, 1398 flow [2021-03-25 22:38:42,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 165 transitions, 1374 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 22:38:42,762 INFO L241 Difference]: Finished difference. Result has 88 places, 111 transitions, 825 flow [2021-03-25 22:38:42,763 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=825, PETRI_PLACES=88, PETRI_TRANSITIONS=111} [2021-03-25 22:38:42,763 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 24 predicate places. [2021-03-25 22:38:42,763 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:38:42,763 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 111 transitions, 825 flow [2021-03-25 22:38:42,763 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 111 transitions, 825 flow [2021-03-25 22:38:42,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 111 transitions, 825 flow [2021-03-25 22:38:42,953 INFO L129 PetriNetUnfolder]: 2005/3758 cut-off events. [2021-03-25 22:38:42,953 INFO L130 PetriNetUnfolder]: For 6530/6726 co-relation queries the response was YES. [2021-03-25 22:38:42,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8908 conditions, 3758 events. 2005/3758 cut-off events. For 6530/6726 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 27211 event pairs, 70 based on Foata normal form. 28/2722 useless extension candidates. Maximal degree in co-relation 6666. Up to 866 conditions per place. [2021-03-25 22:38:43,010 INFO L142 LiptonReduction]: Number of co-enabled transitions 2184 [2021-03-25 22:38:43,014 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:38:43,014 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:38:43,014 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 251 [2021-03-25 22:38:43,015 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 111 transitions, 825 flow [2021-03-25 22:38:43,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 194.33333333333334) internal successors, (1166), 6 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:43,015 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:38:43,016 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 22:38:43,016 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 22:38:43,016 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:38:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:38:43,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1370679130, now seen corresponding path program 1 times [2021-03-25 22:38:43,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:38:43,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139964798] [2021-03-25 22:38:43,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:38:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:38:43,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:43,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:43,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:43,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 22:38:43,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:43,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:38:43,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:43,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:38:43,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:43,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:38:43,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:43,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:43,065 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 22:38:43,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139964798] [2021-03-25 22:38:43,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:38:43,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 22:38:43,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621939271] [2021-03-25 22:38:43,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 22:38:43,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:38:43,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 22:38:43,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 22:38:43,067 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 348 [2021-03-25 22:38:43,069 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 111 transitions, 825 flow. Second operand has 7 states, 7 states have (on average 235.71428571428572) internal successors, (1650), 7 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:43,069 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:38:43,069 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 348 [2021-03-25 22:38:43,069 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:38:43,704 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][53], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 187#(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: 215#(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: 220#(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)), 229#true, 265#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 42#L1156-1true, Black: 287#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 232#|ULTIMATE.start_main_#t~short21|, Black: 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 267#(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|)), 308#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 269#(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|) |ULTIMATE.start_main_#t~short21|), Black: 271#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), 280#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 283#true, 125#L1164-2true, Black: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:38:43,704 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 22:38:43,704 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:43,704 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:43,704 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:43,711 INFO L129 PetriNetUnfolder]: 5666/8727 cut-off events. [2021-03-25 22:38:43,711 INFO L130 PetriNetUnfolder]: For 39576/40215 co-relation queries the response was YES. [2021-03-25 22:38:43,805 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32358 conditions, 8727 events. 5666/8727 cut-off events. For 39576/40215 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 54210 event pairs, 486 based on Foata normal form. 303/7370 useless extension candidates. Maximal degree in co-relation 25357. Up to 2914 conditions per place. [2021-03-25 22:38:43,842 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 64 selfloop transitions, 45 changer transitions 2/154 dead transitions. [2021-03-25 22:38:43,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 154 transitions, 1369 flow [2021-03-25 22:38:43,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 22:38:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 22:38:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1702 transitions. [2021-03-25 22:38:43,846 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6986863711001642 [2021-03-25 22:38:43,846 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1702 transitions. [2021-03-25 22:38:43,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1702 transitions. [2021-03-25 22:38:43,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:38:43,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1702 transitions. [2021-03-25 22:38:43,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 243.14285714285714) internal successors, (1702), 7 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:43,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:43,854 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:43,854 INFO L185 Difference]: Start difference. First operand has 86 places, 111 transitions, 825 flow. Second operand 7 states and 1702 transitions. [2021-03-25 22:38:43,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 154 transitions, 1369 flow [2021-03-25 22:38:43,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 154 transitions, 1338 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-03-25 22:38:43,901 INFO L241 Difference]: Finished difference. Result has 90 places, 127 transitions, 1163 flow [2021-03-25 22:38:43,901 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1163, PETRI_PLACES=90, PETRI_TRANSITIONS=127} [2021-03-25 22:38:43,901 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 26 predicate places. [2021-03-25 22:38:43,901 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:38:43,901 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 127 transitions, 1163 flow [2021-03-25 22:38:43,901 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 127 transitions, 1163 flow [2021-03-25 22:38:43,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 127 transitions, 1163 flow [2021-03-25 22:38:44,138 INFO L129 PetriNetUnfolder]: 2184/4077 cut-off events. [2021-03-25 22:38:44,138 INFO L130 PetriNetUnfolder]: For 12887/13116 co-relation queries the response was YES. [2021-03-25 22:38:44,155 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11657 conditions, 4077 events. 2184/4077 cut-off events. For 12887/13116 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 29666 event pairs, 48 based on Foata normal form. 91/3052 useless extension candidates. Maximal degree in co-relation 8328. Up to 926 conditions per place. [2021-03-25 22:38:44,185 INFO L142 LiptonReduction]: Number of co-enabled transitions 2450 [2021-03-25 22:38:44,192 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:38:44,192 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:38:44,192 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 291 [2021-03-25 22:38:44,193 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 127 transitions, 1163 flow [2021-03-25 22:38:44,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 235.71428571428572) internal successors, (1650), 7 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:44,193 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:38:44,194 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 22:38:44,194 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 22:38:44,194 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:38:44,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:38:44,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1940269459, now seen corresponding path program 1 times [2021-03-25 22:38:44,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:38:44,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108103598] [2021-03-25 22:38:44,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:38:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:38:44,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:44,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 22:38:44,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:44,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 22:38:44,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:44,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 22:38:44,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:44,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:38:44,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:44,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:38:44,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:44,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:38:44,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:44,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:38:44,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:44,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 22:38:44,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:44,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:38:44,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:44,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:44,395 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 22:38:44,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108103598] [2021-03-25 22:38:44,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:38:44,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 22:38:44,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192933465] [2021-03-25 22:38:44,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 22:38:44,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:38:44,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 22:38:44,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-25 22:38:44,399 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 348 [2021-03-25 22:38:44,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 127 transitions, 1163 flow. Second operand has 11 states, 11 states have (on average 189.27272727272728) internal successors, (2082), 11 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:44,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:38:44,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 348 [2021-03-25 22:38:44,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:38:45,884 INFO L129 PetriNetUnfolder]: 10508/14765 cut-off events. [2021-03-25 22:38:45,884 INFO L130 PetriNetUnfolder]: For 100457/101087 co-relation queries the response was YES. [2021-03-25 22:38:45,930 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61496 conditions, 14765 events. 10508/14765 cut-off events. For 100457/101087 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 81750 event pairs, 1884 based on Foata normal form. 94/11556 useless extension candidates. Maximal degree in co-relation 50938. Up to 10568 conditions per place. [2021-03-25 22:38:45,963 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 147 selfloop transitions, 42 changer transitions 3/219 dead transitions. [2021-03-25 22:38:45,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 219 transitions, 2485 flow [2021-03-25 22:38:45,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 22:38:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 22:38:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2173 transitions. [2021-03-25 22:38:45,972 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5676593521421107 [2021-03-25 22:38:45,972 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2173 transitions. [2021-03-25 22:38:45,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2173 transitions. [2021-03-25 22:38:45,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:38:45,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2173 transitions. [2021-03-25 22:38:45,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 197.54545454545453) internal successors, (2173), 11 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:45,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:45,981 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:45,981 INFO L185 Difference]: Start difference. First operand has 90 places, 127 transitions, 1163 flow. Second operand 11 states and 2173 transitions. [2021-03-25 22:38:45,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 219 transitions, 2485 flow [2021-03-25 22:38:46,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 219 transitions, 2480 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 22:38:46,074 INFO L241 Difference]: Finished difference. Result has 104 places, 162 transitions, 1775 flow [2021-03-25 22:38:46,075 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1158, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1775, PETRI_PLACES=104, PETRI_TRANSITIONS=162} [2021-03-25 22:38:46,075 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 40 predicate places. [2021-03-25 22:38:46,075 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:38:46,075 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 162 transitions, 1775 flow [2021-03-25 22:38:46,075 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 162 transitions, 1775 flow [2021-03-25 22:38:46,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 162 transitions, 1775 flow [2021-03-25 22:38:46,378 INFO L129 PetriNetUnfolder]: 2596/4808 cut-off events. [2021-03-25 22:38:46,379 INFO L130 PetriNetUnfolder]: For 19283/19778 co-relation queries the response was YES. [2021-03-25 22:38:46,397 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14724 conditions, 4808 events. 2596/4808 cut-off events. For 19283/19778 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 35391 event pairs, 45 based on Foata normal form. 94/3568 useless extension candidates. Maximal degree in co-relation 11081. Up to 1070 conditions per place. [2021-03-25 22:38:46,429 INFO L142 LiptonReduction]: Number of co-enabled transitions 2610 [2021-03-25 22:38:46,441 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:38:46,441 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:38:46,441 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 366 [2021-03-25 22:38:46,443 INFO L480 AbstractCegarLoop]: Abstraction has has 104 places, 162 transitions, 1775 flow [2021-03-25 22:38:46,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 189.27272727272728) internal successors, (2082), 11 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:46,443 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:38:46,443 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 22:38:46,444 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 22:38:46,444 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:38:46,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:38:46,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2068052205, now seen corresponding path program 2 times [2021-03-25 22:38:46,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:38:46,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203019696] [2021-03-25 22:38:46,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:38:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:38:46,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:46,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 22:38:46,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:46,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:38:46,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:46,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:38:46,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:46,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:38:46,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:46,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:38:46,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:46,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:38:46,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:46,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:38:46,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:46,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:46,549 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 22:38:46,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203019696] [2021-03-25 22:38:46,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:38:46,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 22:38:46,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806514708] [2021-03-25 22:38:46,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 22:38:46,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:38:46,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 22:38:46,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 22:38:46,552 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 348 [2021-03-25 22:38:46,553 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 162 transitions, 1775 flow. Second operand has 9 states, 9 states have (on average 191.55555555555554) internal successors, (1724), 9 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:46,553 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:38:46,553 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 348 [2021-03-25 22:38:46,553 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:38:48,102 INFO L129 PetriNetUnfolder]: 13680/18969 cut-off events. [2021-03-25 22:38:48,102 INFO L130 PetriNetUnfolder]: For 155048/155900 co-relation queries the response was YES. [2021-03-25 22:38:48,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 82256 conditions, 18969 events. 13680/18969 cut-off events. For 155048/155900 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 105364 event pairs, 2686 based on Foata normal form. 96/14563 useless extension candidates. Maximal degree in co-relation 70998. Up to 8428 conditions per place. [2021-03-25 22:38:48,211 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 150 selfloop transitions, 34 changer transitions 47/258 dead transitions. [2021-03-25 22:38:48,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 258 transitions, 3224 flow [2021-03-25 22:38:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 22:38:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 22:38:48,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1815 transitions. [2021-03-25 22:38:48,217 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5795019157088123 [2021-03-25 22:38:48,217 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1815 transitions. [2021-03-25 22:38:48,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1815 transitions. [2021-03-25 22:38:48,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:38:48,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1815 transitions. [2021-03-25 22:38:48,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 201.66666666666666) internal successors, (1815), 9 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:48,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:48,225 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:48,225 INFO L185 Difference]: Start difference. First operand has 104 places, 162 transitions, 1775 flow. Second operand 9 states and 1815 transitions. [2021-03-25 22:38:48,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 258 transitions, 3224 flow [2021-03-25 22:38:48,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 258 transitions, 3067 flow, removed 77 selfloop flow, removed 1 redundant places. [2021-03-25 22:38:48,420 INFO L241 Difference]: Finished difference. Result has 115 places, 139 transitions, 1466 flow [2021-03-25 22:38:48,420 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1678, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1466, PETRI_PLACES=115, PETRI_TRANSITIONS=139} [2021-03-25 22:38:48,420 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 51 predicate places. [2021-03-25 22:38:48,421 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:38:48,421 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 139 transitions, 1466 flow [2021-03-25 22:38:48,421 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 139 transitions, 1466 flow [2021-03-25 22:38:48,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 115 places, 139 transitions, 1466 flow [2021-03-25 22:38:48,763 INFO L129 PetriNetUnfolder]: 2985/5504 cut-off events. [2021-03-25 22:38:48,763 INFO L130 PetriNetUnfolder]: For 23727/24209 co-relation queries the response was YES. [2021-03-25 22:38:48,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16645 conditions, 5504 events. 2985/5504 cut-off events. For 23727/24209 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 41339 event pairs, 46 based on Foata normal form. 71/3984 useless extension candidates. Maximal degree in co-relation 14411. Up to 1252 conditions per place. [2021-03-25 22:38:48,839 INFO L142 LiptonReduction]: Number of co-enabled transitions 2490 [2021-03-25 22:38:48,843 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:38:48,843 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:38:48,843 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 422 [2021-03-25 22:38:48,844 INFO L480 AbstractCegarLoop]: Abstraction has has 115 places, 139 transitions, 1466 flow [2021-03-25 22:38:48,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 191.55555555555554) internal successors, (1724), 9 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:48,845 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:38:48,845 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 22:38:48,845 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 22:38:48,845 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:38:48,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:38:48,845 INFO L82 PathProgramCache]: Analyzing trace with hash 277775758, now seen corresponding path program 2 times [2021-03-25 22:38:48,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:38:48,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503537596] [2021-03-25 22:38:48,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:38:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:38:48,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:48,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:48,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:48,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 22:38:48,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:48,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 22:38:48,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:48,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:38:48,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:48,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:38:48,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:48,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:38:48,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:48,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:48,915 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 22:38:48,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503537596] [2021-03-25 22:38:48,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:38:48,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 22:38:48,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51622490] [2021-03-25 22:38:48,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 22:38:48,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:38:48,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 22:38:48,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 22:38:48,918 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 348 [2021-03-25 22:38:48,919 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 139 transitions, 1466 flow. Second operand has 8 states, 8 states have (on average 232.5) internal successors, (1860), 8 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:48,920 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:38:48,920 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 348 [2021-03-25 22:38:48,920 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:38:49,938 INFO L129 PetriNetUnfolder]: 7613/11620 cut-off events. [2021-03-25 22:38:49,939 INFO L130 PetriNetUnfolder]: For 116729/117692 co-relation queries the response was YES. [2021-03-25 22:38:49,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54927 conditions, 11620 events. 7613/11620 cut-off events. For 116729/117692 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 73755 event pairs, 431 based on Foata normal form. 329/9543 useless extension candidates. Maximal degree in co-relation 47480. Up to 3690 conditions per place. [2021-03-25 22:38:50,040 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 75 selfloop transitions, 55 changer transitions 2/179 dead transitions. [2021-03-25 22:38:50,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 179 transitions, 2137 flow [2021-03-25 22:38:50,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 22:38:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 22:38:50,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1678 transitions. [2021-03-25 22:38:50,044 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6888341543513957 [2021-03-25 22:38:50,044 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1678 transitions. [2021-03-25 22:38:50,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1678 transitions. [2021-03-25 22:38:50,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:38:50,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1678 transitions. [2021-03-25 22:38:50,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 239.71428571428572) internal successors, (1678), 7 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:50,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:50,051 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:50,051 INFO L185 Difference]: Start difference. First operand has 115 places, 139 transitions, 1466 flow. Second operand 7 states and 1678 transitions. [2021-03-25 22:38:50,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 179 transitions, 2137 flow [2021-03-25 22:38:50,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 179 transitions, 2011 flow, removed 35 selfloop flow, removed 7 redundant places. [2021-03-25 22:38:50,218 INFO L241 Difference]: Finished difference. Result has 118 places, 154 transitions, 1829 flow [2021-03-25 22:38:50,219 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1367, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1829, PETRI_PLACES=118, PETRI_TRANSITIONS=154} [2021-03-25 22:38:50,219 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 54 predicate places. [2021-03-25 22:38:50,219 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:38:50,219 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 154 transitions, 1829 flow [2021-03-25 22:38:50,219 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 154 transitions, 1829 flow [2021-03-25 22:38:50,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 118 places, 154 transitions, 1829 flow [2021-03-25 22:38:50,522 INFO L129 PetriNetUnfolder]: 2964/5507 cut-off events. [2021-03-25 22:38:50,523 INFO L130 PetriNetUnfolder]: For 29890/30580 co-relation queries the response was YES. [2021-03-25 22:38:50,548 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18048 conditions, 5507 events. 2964/5507 cut-off events. For 29890/30580 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 41932 event pairs, 63 based on Foata normal form. 136/4059 useless extension candidates. Maximal degree in co-relation 15066. Up to 1238 conditions per place. [2021-03-25 22:38:50,589 INFO L142 LiptonReduction]: Number of co-enabled transitions 2714 [2021-03-25 22:38:50,595 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:38:50,595 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:38:50,595 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 376 [2021-03-25 22:38:50,596 INFO L480 AbstractCegarLoop]: Abstraction has has 118 places, 154 transitions, 1829 flow [2021-03-25 22:38:50,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 232.5) internal successors, (1860), 8 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:50,596 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:38:50,596 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 22:38:50,597 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 22:38:50,597 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:38:50,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:38:50,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1929217835, now seen corresponding path program 1 times [2021-03-25 22:38:50,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:38:50,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287882650] [2021-03-25 22:38:50,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:38:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:38:50,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:50,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:50,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:50,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 22:38:50,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:50,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:38:50,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:50,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:38:50,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:50,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:38:50,635 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 22:38:50,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287882650] [2021-03-25 22:38:50,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:38:50,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 22:38:50,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529752971] [2021-03-25 22:38:50,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 22:38:50,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:38:50,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 22:38:50,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 22:38:50,637 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 348 [2021-03-25 22:38:50,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 154 transitions, 1829 flow. Second operand has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:50,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:38:50,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 348 [2021-03-25 22:38:50,639 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:38:51,537 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][75], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 320#true, 385#(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: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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)), 265#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 387#(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: 389#(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|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 391#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 267#(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: 203#(= |ULTIMATE.start_main_#t~mem18| 5), 406#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (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) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 280#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 336#(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|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 338#(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_~#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: 340#(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_~#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: 342#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 344#(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 (= |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|)))), Black: 330#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 220#(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)), 229#true, Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 42#L1156-1true, Black: 287#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 232#|ULTIMATE.start_main_#t~short21|, Black: 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 308#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 370#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 359#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 362#(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: 366#(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)), 125#L1164-2true, Black: 310#(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))), Black: 312#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 314#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:38:51,537 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 22:38:51,537 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:51,537 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:51,538 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:38:51,540 INFO L129 PetriNetUnfolder]: 7351/11238 cut-off events. [2021-03-25 22:38:51,540 INFO L130 PetriNetUnfolder]: For 146087/147330 co-relation queries the response was YES. [2021-03-25 22:38:51,600 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58569 conditions, 11238 events. 7351/11238 cut-off events. For 146087/147330 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 71379 event pairs, 846 based on Foata normal form. 380/9317 useless extension candidates. Maximal degree in co-relation 48874. Up to 5597 conditions per place. [2021-03-25 22:38:51,638 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 106 selfloop transitions, 24 changer transitions 0/177 dead transitions. [2021-03-25 22:38:51,638 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 177 transitions, 2369 flow [2021-03-25 22:38:51,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 22:38:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 22:38:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1272 transitions. [2021-03-25 22:38:51,641 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7310344827586207 [2021-03-25 22:38:51,641 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1272 transitions. [2021-03-25 22:38:51,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1272 transitions. [2021-03-25 22:38:51,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:38:51,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1272 transitions. [2021-03-25 22:38:51,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 254.4) internal successors, (1272), 5 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:51,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:51,646 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:51,646 INFO L185 Difference]: Start difference. First operand has 118 places, 154 transitions, 1829 flow. Second operand 5 states and 1272 transitions. [2021-03-25 22:38:51,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 177 transitions, 2369 flow [2021-03-25 22:38:51,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 177 transitions, 2354 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-03-25 22:38:51,814 INFO L241 Difference]: Finished difference. Result has 121 places, 158 transitions, 1970 flow [2021-03-25 22:38:51,815 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1816, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1970, PETRI_PLACES=121, PETRI_TRANSITIONS=158} [2021-03-25 22:38:51,815 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 57 predicate places. [2021-03-25 22:38:51,815 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:38:51,815 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 158 transitions, 1970 flow [2021-03-25 22:38:51,815 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 158 transitions, 1970 flow [2021-03-25 22:38:51,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 158 transitions, 1970 flow [2021-03-25 22:38:52,136 INFO L129 PetriNetUnfolder]: 3000/5567 cut-off events. [2021-03-25 22:38:52,137 INFO L130 PetriNetUnfolder]: For 32241/32754 co-relation queries the response was YES. [2021-03-25 22:38:52,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18998 conditions, 5567 events. 3000/5567 cut-off events. For 32241/32754 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 42389 event pairs, 52 based on Foata normal form. 72/4026 useless extension candidates. Maximal degree in co-relation 16033. Up to 1258 conditions per place. [2021-03-25 22:38:52,206 INFO L142 LiptonReduction]: Number of co-enabled transitions 2740 [2021-03-25 22:38:52,212 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:38:52,212 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:38:52,212 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 397 [2021-03-25 22:38:52,212 INFO L480 AbstractCegarLoop]: Abstraction has has 121 places, 158 transitions, 1970 flow [2021-03-25 22:38:52,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:52,213 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:38:52,213 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 22:38:52,213 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 22:38:52,213 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:38:52,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:38:52,213 INFO L82 PathProgramCache]: Analyzing trace with hash 440558243, now seen corresponding path program 1 times [2021-03-25 22:38:52,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:38:52,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626241229] [2021-03-25 22:38:52,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:38:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:38:52,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:52,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 22:38:52,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:52,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 22:38:52,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:52,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:38:52,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:52,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:38:52,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:52,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:38:52,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:52,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:38:52,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:52,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 22:38:52,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:52,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:38:52,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:52,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:52,358 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 22:38:52,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626241229] [2021-03-25 22:38:52,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:38:52,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 22:38:52,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529157391] [2021-03-25 22:38:52,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 22:38:52,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:38:52,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 22:38:52,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-03-25 22:38:52,361 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 348 [2021-03-25 22:38:52,362 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 158 transitions, 1970 flow. Second operand has 10 states, 10 states have (on average 190.5) internal successors, (1905), 10 states have internal predecessors, (1905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:52,362 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:38:52,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 348 [2021-03-25 22:38:52,362 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:38:54,554 INFO L129 PetriNetUnfolder]: 15063/20953 cut-off events. [2021-03-25 22:38:54,554 INFO L130 PetriNetUnfolder]: For 260038/260561 co-relation queries the response was YES. [2021-03-25 22:38:54,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101265 conditions, 20953 events. 15063/20953 cut-off events. For 260038/260561 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 118319 event pairs, 3116 based on Foata normal form. 88/15968 useless extension candidates. Maximal degree in co-relation 90402. Up to 15280 conditions per place. [2021-03-25 22:38:54,732 INFO L132 encePairwiseOnDemand]: 335/348 looper letters, 134 selfloop transitions, 32 changer transitions 5/198 dead transitions. [2021-03-25 22:38:54,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 198 transitions, 2825 flow [2021-03-25 22:38:54,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 22:38:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 22:38:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1780 transitions. [2021-03-25 22:38:54,736 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5683269476372924 [2021-03-25 22:38:54,736 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1780 transitions. [2021-03-25 22:38:54,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1780 transitions. [2021-03-25 22:38:54,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:38:54,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1780 transitions. [2021-03-25 22:38:54,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 197.77777777777777) internal successors, (1780), 9 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:54,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:54,744 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:54,744 INFO L185 Difference]: Start difference. First operand has 121 places, 158 transitions, 1970 flow. Second operand 9 states and 1780 transitions. [2021-03-25 22:38:54,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 198 transitions, 2825 flow [2021-03-25 22:38:54,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 198 transitions, 2790 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 22:38:54,991 INFO L241 Difference]: Finished difference. Result has 129 places, 167 transitions, 2249 flow [2021-03-25 22:38:54,991 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2249, PETRI_PLACES=129, PETRI_TRANSITIONS=167} [2021-03-25 22:38:54,991 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 65 predicate places. [2021-03-25 22:38:54,991 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:38:54,991 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 167 transitions, 2249 flow [2021-03-25 22:38:54,991 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 167 transitions, 2249 flow [2021-03-25 22:38:54,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 167 transitions, 2249 flow [2021-03-25 22:38:55,470 INFO L129 PetriNetUnfolder]: 3398/6255 cut-off events. [2021-03-25 22:38:55,470 INFO L130 PetriNetUnfolder]: For 39132/39637 co-relation queries the response was YES. [2021-03-25 22:38:55,503 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21413 conditions, 6255 events. 3398/6255 cut-off events. For 39132/39637 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 48158 event pairs, 44 based on Foata normal form. 109/4485 useless extension candidates. Maximal degree in co-relation 18642. Up to 1436 conditions per place. [2021-03-25 22:38:55,557 INFO L142 LiptonReduction]: Number of co-enabled transitions 2832 [2021-03-25 22:38:55,563 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:38:55,563 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:38:55,564 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 573 [2021-03-25 22:38:55,564 INFO L480 AbstractCegarLoop]: Abstraction has has 129 places, 167 transitions, 2249 flow [2021-03-25 22:38:55,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 190.5) internal successors, (1905), 10 states have internal predecessors, (1905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:55,565 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:38:55,565 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 22:38:55,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 22:38:55,565 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:38:55,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:38:55,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1217890873, now seen corresponding path program 2 times [2021-03-25 22:38:55,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:38:55,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964082771] [2021-03-25 22:38:55,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:38:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:38:55,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:55,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 22:38:55,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:55,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 22:38:55,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:55,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 22:38:55,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:55,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 22:38:55,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:55,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:38:55,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:55,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:38:55,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:55,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 22:38:55,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:55,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 22:38:55,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:55,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 22:38:55,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:55,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:38:55,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:55,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:55,775 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 22:38:55,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964082771] [2021-03-25 22:38:55,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:38:55,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 22:38:55,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532652724] [2021-03-25 22:38:55,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 22:38:55,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:38:55,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 22:38:55,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-03-25 22:38:55,779 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 348 [2021-03-25 22:38:55,780 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 167 transitions, 2249 flow. Second operand has 11 states, 11 states have (on average 187.36363636363637) internal successors, (2061), 11 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:55,780 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:38:55,780 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 348 [2021-03-25 22:38:55,780 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:38:58,611 INFO L129 PetriNetUnfolder]: 16331/22577 cut-off events. [2021-03-25 22:38:58,611 INFO L130 PetriNetUnfolder]: For 297074/297108 co-relation queries the response was YES. [2021-03-25 22:38:58,704 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111047 conditions, 22577 events. 16331/22577 cut-off events. For 297074/297108 co-relation queries the response was YES. Maximal size of possible extension queue 1038. Compared 127214 event pairs, 2596 based on Foata normal form. 86/17187 useless extension candidates. Maximal degree in co-relation 100053. Up to 14696 conditions per place. [2021-03-25 22:38:58,748 INFO L132 encePairwiseOnDemand]: 335/348 looper letters, 195 selfloop transitions, 57 changer transitions 6/285 dead transitions. [2021-03-25 22:38:58,748 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 285 transitions, 4545 flow [2021-03-25 22:38:58,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 22:38:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 22:38:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1965 transitions. [2021-03-25 22:38:58,751 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5646551724137931 [2021-03-25 22:38:58,751 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1965 transitions. [2021-03-25 22:38:58,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1965 transitions. [2021-03-25 22:38:58,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:38:58,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1965 transitions. [2021-03-25 22:38:58,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 196.5) internal successors, (1965), 10 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:58,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:58,759 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:58,759 INFO L185 Difference]: Start difference. First operand has 129 places, 167 transitions, 2249 flow. Second operand 10 states and 1965 transitions. [2021-03-25 22:38:58,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 285 transitions, 4545 flow [2021-03-25 22:38:59,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 285 transitions, 4348 flow, removed 74 selfloop flow, removed 5 redundant places. [2021-03-25 22:38:59,004 INFO L241 Difference]: Finished difference. Result has 137 places, 193 transitions, 2781 flow [2021-03-25 22:38:59,004 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2781, PETRI_PLACES=137, PETRI_TRANSITIONS=193} [2021-03-25 22:38:59,004 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 73 predicate places. [2021-03-25 22:38:59,004 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:38:59,005 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 193 transitions, 2781 flow [2021-03-25 22:38:59,005 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 193 transitions, 2781 flow [2021-03-25 22:38:59,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 137 places, 193 transitions, 2781 flow [2021-03-25 22:38:59,160 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([464] L1151-2-->L1152-1: Formula: (= (store |v_#memory_int_76| |v_thread0Thread1of1ForFork4_~#t5~0.base_23| (store (select |v_#memory_int_76| |v_thread0Thread1of1ForFork4_~#t5~0.base_23|) |v_thread0Thread1of1ForFork4_~#t5~0.offset_19| 4)) |v_#memory_int_75|) InVars {#memory_int=|v_#memory_int_76|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_23|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_19|} OutVars{#memory_int=|v_#memory_int_75|, thread0Thread1of1ForFork4_#t~nondet11=|v_thread0Thread1of1ForFork4_#t~nondet11_5|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_23|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_19|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork4_#t~nondet11][157], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 385#(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|)), 265#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 387#(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: 389#(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|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 391#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 267#(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: 406#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (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) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 280#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 33#thread2EXITtrue, Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 287#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 418#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 424#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 426#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), 431#true, 308#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 310#(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))), Black: 312#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 314#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 320#true, Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 451#(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: 453#(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|))), 73#ULTIMATE.startEXITtrue, Black: 441#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 445#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(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|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 338#(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_~#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: 340#(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_~#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: 342#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 344#(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 (= |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|)))), Black: 330#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 220#(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)), 229#true, Black: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 232#|ULTIMATE.start_main_#t~short21|, Black: 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 370#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 359#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 362#(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: 366#(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)), 121#L1152-1true, 124#thread3ENTRYtrue, Black: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:38:59,160 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 22:38:59,160 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:38:59,160 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:38:59,160 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:38:59,160 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] thread3ENTRY-->thread3EXIT: Formula: (and (= (store |v_#memory_int_142| v_~v~0.base_49 (store (select |v_#memory_int_142| v_~v~0.base_49) v_~v~0.offset_49 89)) |v_#memory_int_141|) (= |v_thread3Thread1of1ForFork0_#res.base_9| 0) (= v_thread3Thread1of1ForFork0_~arg.offset_11 |v_thread3Thread1of1ForFork0_#in~arg.offset_11|) (= v_thread3Thread1of1ForFork0_~arg.base_11 |v_thread3Thread1of1ForFork0_#in~arg.base_11|) (= |v_thread3Thread1of1ForFork0_#res.offset_9| 0)) InVars {thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, #memory_int=|v_#memory_int_142|, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} OutVars{thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_9|, #memory_int=|v_#memory_int_141|, thread3Thread1of1ForFork0_~arg.offset=v_thread3Thread1of1ForFork0_~arg.offset_11, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_9|, thread3Thread1of1ForFork0_~arg.base=v_thread3Thread1of1ForFork0_~arg.base_11, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, #memory_int, thread3Thread1of1ForFork0_~arg.offset, thread3Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork0_~arg.base][154], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 385#(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|)), 265#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 387#(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: 389#(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|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 391#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 267#(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|)), 406#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (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) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 280#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 153#thread3EXITtrue, 33#thread2EXITtrue, Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 287#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 418#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 424#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 426#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), 431#true, 308#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 53#L1151-2true, Black: 310#(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))), Black: 312#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 314#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 320#true, Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 451#(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: 453#(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: 441#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 73#ULTIMATE.startEXITtrue, Black: 445#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(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|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 338#(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_~#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: 340#(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_~#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: 342#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 344#(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 (= |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|)))), Black: 330#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 220#(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)), 229#true, Black: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 232#|ULTIMATE.start_main_#t~short21|, Black: 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 370#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 359#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 362#(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: 366#(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: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:38:59,160 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 22:38:59,160 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:38:59,161 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:38:59,161 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:38:59,471 INFO L129 PetriNetUnfolder]: 3638/6683 cut-off events. [2021-03-25 22:38:59,471 INFO L130 PetriNetUnfolder]: For 47882/48519 co-relation queries the response was YES. [2021-03-25 22:38:59,509 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22607 conditions, 6683 events. 3638/6683 cut-off events. For 47882/48519 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 51641 event pairs, 44 based on Foata normal form. 233/4877 useless extension candidates. Maximal degree in co-relation 18895. Up to 1588 conditions per place. [2021-03-25 22:38:59,562 INFO L142 LiptonReduction]: Number of co-enabled transitions 2942 [2021-03-25 22:38:59,569 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:38:59,569 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:38:59,569 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 565 [2021-03-25 22:38:59,570 INFO L480 AbstractCegarLoop]: Abstraction has has 137 places, 193 transitions, 2781 flow [2021-03-25 22:38:59,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 187.36363636363637) internal successors, (2061), 11 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:59,570 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:38:59,571 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 22:38:59,571 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 22:38:59,571 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:38:59,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:38:59,571 INFO L82 PathProgramCache]: Analyzing trace with hash 262268005, now seen corresponding path program 1 times [2021-03-25 22:38:59,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:38:59,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645527176] [2021-03-25 22:38:59,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:38:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:38:59,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:59,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 22:38:59,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:59,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 22:38:59,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:59,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:38:59,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:59,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:38:59,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:59,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:38:59,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:38:59,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:38:59,622 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 22:38:59,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645527176] [2021-03-25 22:38:59,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:38:59,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 22:38:59,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804300420] [2021-03-25 22:38:59,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 22:38:59,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:38:59,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 22:38:59,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 22:38:59,626 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 348 [2021-03-25 22:38:59,627 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 193 transitions, 2781 flow. Second operand has 7 states, 7 states have (on average 194.14285714285714) internal successors, (1359), 7 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:38:59,627 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:38:59,627 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 348 [2021-03-25 22:38:59,627 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:39:01,871 INFO L129 PetriNetUnfolder]: 15022/21098 cut-off events. [2021-03-25 22:39:01,871 INFO L130 PetriNetUnfolder]: For 288114/288148 co-relation queries the response was YES. [2021-03-25 22:39:01,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104992 conditions, 21098 events. 15022/21098 cut-off events. For 288114/288148 co-relation queries the response was YES. Maximal size of possible extension queue 977. Compared 121599 event pairs, 3109 based on Foata normal form. 231/16260 useless extension candidates. Maximal degree in co-relation 90970. Up to 13867 conditions per place. [2021-03-25 22:39:01,999 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 178 selfloop transitions, 16 changer transitions 28/254 dead transitions. [2021-03-25 22:39:01,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 254 transitions, 4103 flow [2021-03-25 22:39:02,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 22:39:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 22:39:02,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1603 transitions. [2021-03-25 22:39:02,001 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5757902298850575 [2021-03-25 22:39:02,001 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1603 transitions. [2021-03-25 22:39:02,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1603 transitions. [2021-03-25 22:39:02,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:39:02,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1603 transitions. [2021-03-25 22:39:02,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 200.375) internal successors, (1603), 8 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:02,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:02,006 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:02,006 INFO L185 Difference]: Start difference. First operand has 137 places, 193 transitions, 2781 flow. Second operand 8 states and 1603 transitions. [2021-03-25 22:39:02,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 254 transitions, 4103 flow [2021-03-25 22:39:02,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 254 transitions, 3974 flow, removed 45 selfloop flow, removed 4 redundant places. [2021-03-25 22:39:02,296 INFO L241 Difference]: Finished difference. Result has 142 places, 188 transitions, 2595 flow [2021-03-25 22:39:02,296 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2662, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2595, PETRI_PLACES=142, PETRI_TRANSITIONS=188} [2021-03-25 22:39:02,296 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 78 predicate places. [2021-03-25 22:39:02,297 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:39:02,297 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 188 transitions, 2595 flow [2021-03-25 22:39:02,297 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 188 transitions, 2595 flow [2021-03-25 22:39:02,298 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 142 places, 188 transitions, 2595 flow [2021-03-25 22:39:02,560 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] thread3ENTRY-->thread3EXIT: Formula: (and (= (store |v_#memory_int_142| v_~v~0.base_49 (store (select |v_#memory_int_142| v_~v~0.base_49) v_~v~0.offset_49 89)) |v_#memory_int_141|) (= |v_thread3Thread1of1ForFork0_#res.base_9| 0) (= v_thread3Thread1of1ForFork0_~arg.offset_11 |v_thread3Thread1of1ForFork0_#in~arg.offset_11|) (= v_thread3Thread1of1ForFork0_~arg.base_11 |v_thread3Thread1of1ForFork0_#in~arg.base_11|) (= |v_thread3Thread1of1ForFork0_#res.offset_9| 0)) InVars {thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, #memory_int=|v_#memory_int_142|, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} OutVars{thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_9|, #memory_int=|v_#memory_int_141|, thread3Thread1of1ForFork0_~arg.offset=v_thread3Thread1of1ForFork0_~arg.offset_11, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_9|, thread3Thread1of1ForFork0_~arg.base=v_thread3Thread1of1ForFork0_~arg.base_11, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, #memory_int, thread3Thread1of1ForFork0_~arg.offset, thread3Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork0_~arg.base][126], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 385#(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|)), 265#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 387#(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: 389#(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|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 391#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 267#(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|)), 406#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (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) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 280#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 153#thread3EXITtrue, 33#thread2EXITtrue, Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 287#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 418#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 424#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 426#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), 431#true, 308#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 53#L1151-2true, Black: 310#(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))), Black: 312#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 314#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 320#true, Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 451#(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: 453#(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: 441#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 73#ULTIMATE.startEXITtrue, Black: 445#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), 459#true, Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(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|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 338#(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_~#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: 464#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 473#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 340#(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_~#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: 342#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 344#(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 (= |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|)))), Black: 330#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 220#(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)), 229#true, Black: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 232#|ULTIMATE.start_main_#t~short21|, Black: 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 370#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 359#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 362#(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: 366#(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: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:39:02,560 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 22:39:02,560 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:39:02,560 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:39:02,560 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:39:02,561 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([464] L1151-2-->L1152-1: Formula: (= (store |v_#memory_int_76| |v_thread0Thread1of1ForFork4_~#t5~0.base_23| (store (select |v_#memory_int_76| |v_thread0Thread1of1ForFork4_~#t5~0.base_23|) |v_thread0Thread1of1ForFork4_~#t5~0.offset_19| 4)) |v_#memory_int_75|) InVars {#memory_int=|v_#memory_int_76|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_23|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_19|} OutVars{#memory_int=|v_#memory_int_75|, thread0Thread1of1ForFork4_#t~nondet11=|v_thread0Thread1of1ForFork4_#t~nondet11_5|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_23|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_19|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork4_#t~nondet11][131], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 385#(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|)), 265#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 387#(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: 389#(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|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 391#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 267#(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: 406#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (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) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 280#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 33#thread2EXITtrue, Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 287#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 418#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 424#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 426#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), 431#true, 308#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 310#(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))), Black: 312#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 314#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 320#true, Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 451#(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: 453#(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: 441#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 73#ULTIMATE.startEXITtrue, Black: 445#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), 459#true, Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(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|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 464#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 338#(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_~#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: 473#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 340#(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_~#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: 342#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 344#(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 (= |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|)))), Black: 330#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 220#(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)), 229#true, Black: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 232#|ULTIMATE.start_main_#t~short21|, Black: 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 370#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 359#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 362#(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: 366#(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)), 121#L1152-1true, 124#thread3ENTRYtrue, Black: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:39:02,561 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 22:39:02,561 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:39:02,561 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:39:02,561 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:39:02,788 INFO L129 PetriNetUnfolder]: 3497/6450 cut-off events. [2021-03-25 22:39:02,788 INFO L130 PetriNetUnfolder]: For 39554/40038 co-relation queries the response was YES. [2021-03-25 22:39:02,830 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21551 conditions, 6450 events. 3497/6450 cut-off events. For 39554/40038 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 49830 event pairs, 40 based on Foata normal form. 121/4594 useless extension candidates. Maximal degree in co-relation 18588. Up to 1550 conditions per place. [2021-03-25 22:39:02,885 INFO L142 LiptonReduction]: Number of co-enabled transitions 2736 [2021-03-25 22:39:02,892 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:39:02,892 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:39:02,892 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 595 [2021-03-25 22:39:02,893 INFO L480 AbstractCegarLoop]: Abstraction has has 142 places, 188 transitions, 2595 flow [2021-03-25 22:39:02,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 194.14285714285714) internal successors, (1359), 7 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:02,893 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:39:02,893 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 22:39:02,893 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 22:39:02,894 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:39:02,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:39:02,894 INFO L82 PathProgramCache]: Analyzing trace with hash -751820630, now seen corresponding path program 1 times [2021-03-25 22:39:02,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:39:02,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654706950] [2021-03-25 22:39:02,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:39:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:39:02,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:02,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:39:02,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:02,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 22:39:02,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:02,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 22:39:02,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:02,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:39:02,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:02,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:39:02,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:02,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:39:02,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:02,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:39:02,966 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 22:39:02,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654706950] [2021-03-25 22:39:02,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:39:02,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 22:39:02,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935583064] [2021-03-25 22:39:02,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 22:39:02,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:39:02,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 22:39:02,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 22:39:02,968 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 348 [2021-03-25 22:39:02,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 188 transitions, 2595 flow. Second operand has 8 states, 8 states have (on average 214.625) internal successors, (1717), 8 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:02,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:39:02,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 348 [2021-03-25 22:39:02,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:39:04,697 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][85], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 385#(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|)), 265#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 387#(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: 389#(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|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 391#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 267#(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|)), 406#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (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) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 280#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 42#L1156-1true, Black: 287#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 418#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 424#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 426#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), 431#true, 308#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 310#(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))), Black: 312#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 314#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 320#true, Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 451#(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: 453#(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: 441#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 445#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), 459#true, Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(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|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 464#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 338#(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_~#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: 473#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 340#(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_~#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: 342#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 344#(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 (= |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|)))), Black: 330#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 220#(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)), 229#true, 486#(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: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 232#|ULTIMATE.start_main_#t~short21|, Black: 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 370#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 359#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 362#(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: 366#(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)), 125#L1164-2true, Black: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:39:04,697 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 22:39:04,697 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:39:04,697 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:39:04,698 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:39:04,713 INFO L129 PetriNetUnfolder]: 9472/14479 cut-off events. [2021-03-25 22:39:04,713 INFO L130 PetriNetUnfolder]: For 230144/231503 co-relation queries the response was YES. [2021-03-25 22:39:04,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78364 conditions, 14479 events. 9472/14479 cut-off events. For 230144/231503 co-relation queries the response was YES. Maximal size of possible extension queue 829. Compared 95118 event pairs, 492 based on Foata normal form. 527/11866 useless extension candidates. Maximal degree in co-relation 68934. Up to 4292 conditions per place. [2021-03-25 22:39:04,838 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 126 selfloop transitions, 86 changer transitions 4/264 dead transitions. [2021-03-25 22:39:04,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 264 transitions, 4094 flow [2021-03-25 22:39:04,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 22:39:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 22:39:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1994 transitions. [2021-03-25 22:39:04,840 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6366538952745849 [2021-03-25 22:39:04,840 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1994 transitions. [2021-03-25 22:39:04,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1994 transitions. [2021-03-25 22:39:04,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:39:04,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1994 transitions. [2021-03-25 22:39:04,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 221.55555555555554) internal successors, (1994), 9 states have internal predecessors, (1994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:04,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:04,845 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:04,846 INFO L185 Difference]: Start difference. First operand has 142 places, 188 transitions, 2595 flow. Second operand 9 states and 1994 transitions. [2021-03-25 22:39:04,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 264 transitions, 4094 flow [2021-03-25 22:39:05,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 264 transitions, 3997 flow, removed 1 selfloop flow, removed 7 redundant places. [2021-03-25 22:39:05,091 INFO L241 Difference]: Finished difference. Result has 147 places, 223 transitions, 3579 flow [2021-03-25 22:39:05,092 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2526, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3579, PETRI_PLACES=147, PETRI_TRANSITIONS=223} [2021-03-25 22:39:05,092 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 83 predicate places. [2021-03-25 22:39:05,092 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:39:05,092 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 223 transitions, 3579 flow [2021-03-25 22:39:05,092 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 223 transitions, 3579 flow [2021-03-25 22:39:05,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 223 transitions, 3579 flow [2021-03-25 22:39:05,672 INFO L129 PetriNetUnfolder]: 3953/7343 cut-off events. [2021-03-25 22:39:05,672 INFO L130 PetriNetUnfolder]: For 59432/60233 co-relation queries the response was YES. [2021-03-25 22:39:05,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26504 conditions, 7343 events. 3953/7343 cut-off events. For 59432/60233 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 58341 event pairs, 36 based on Foata normal form. 243/5445 useless extension candidates. Maximal degree in co-relation 23282. Up to 1770 conditions per place. [2021-03-25 22:39:05,776 INFO L142 LiptonReduction]: Number of co-enabled transitions 3622 [2021-03-25 22:39:05,785 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:39:05,785 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:39:05,785 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 693 [2021-03-25 22:39:05,786 INFO L480 AbstractCegarLoop]: Abstraction has has 147 places, 223 transitions, 3579 flow [2021-03-25 22:39:05,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 214.625) internal successors, (1717), 8 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:05,786 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:39:05,787 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 22:39:05,787 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 22:39:05,787 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:39:05,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:39:05,787 INFO L82 PathProgramCache]: Analyzing trace with hash 837646318, now seen corresponding path program 2 times [2021-03-25 22:39:05,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:39:05,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032162660] [2021-03-25 22:39:05,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:39:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:39:05,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:05,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 22:39:05,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:05,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:39:05,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:05,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:39:05,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:05,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:39:05,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:05,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 22:39:05,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:05,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:39:05,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:05,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:39:05,843 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 22:39:05,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032162660] [2021-03-25 22:39:05,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:39:05,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 22:39:05,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349483944] [2021-03-25 22:39:05,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 22:39:05,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:39:05,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 22:39:05,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 22:39:05,845 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 348 [2021-03-25 22:39:05,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 223 transitions, 3579 flow. Second operand has 8 states, 8 states have (on average 192.875) internal successors, (1543), 8 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:05,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:39:05,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 348 [2021-03-25 22:39:05,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:39:08,536 INFO L129 PetriNetUnfolder]: 16760/23801 cut-off events. [2021-03-25 22:39:08,536 INFO L130 PetriNetUnfolder]: For 390353/390846 co-relation queries the response was YES. [2021-03-25 22:39:08,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129798 conditions, 23801 events. 16760/23801 cut-off events. For 390353/390846 co-relation queries the response was YES. Maximal size of possible extension queue 1181. Compared 144949 event pairs, 3324 based on Foata normal form. 157/18176 useless extension candidates. Maximal degree in co-relation 115252. Up to 17490 conditions per place. [2021-03-25 22:39:08,918 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 234 selfloop transitions, 14 changer transitions 5/285 dead transitions. [2021-03-25 22:39:08,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 285 transitions, 5070 flow [2021-03-25 22:39:08,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 22:39:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 22:39:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1404 transitions. [2021-03-25 22:39:08,920 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5763546798029556 [2021-03-25 22:39:08,920 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1404 transitions. [2021-03-25 22:39:08,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1404 transitions. [2021-03-25 22:39:08,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:39:08,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1404 transitions. [2021-03-25 22:39:08,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 200.57142857142858) internal successors, (1404), 7 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:08,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:08,923 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:08,923 INFO L185 Difference]: Start difference. First operand has 147 places, 223 transitions, 3579 flow. Second operand 7 states and 1404 transitions. [2021-03-25 22:39:08,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 285 transitions, 5070 flow [2021-03-25 22:39:09,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 285 transitions, 4937 flow, removed 24 selfloop flow, removed 3 redundant places. [2021-03-25 22:39:09,700 INFO L241 Difference]: Finished difference. Result has 152 places, 227 transitions, 3593 flow [2021-03-25 22:39:09,701 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3471, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3593, PETRI_PLACES=152, PETRI_TRANSITIONS=227} [2021-03-25 22:39:09,701 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 88 predicate places. [2021-03-25 22:39:09,701 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:39:09,701 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 227 transitions, 3593 flow [2021-03-25 22:39:09,701 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 227 transitions, 3593 flow [2021-03-25 22:39:09,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 152 places, 227 transitions, 3593 flow [2021-03-25 22:39:10,162 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] thread3ENTRY-->thread3EXIT: Formula: (and (= (store |v_#memory_int_142| v_~v~0.base_49 (store (select |v_#memory_int_142| v_~v~0.base_49) v_~v~0.offset_49 89)) |v_#memory_int_141|) (= |v_thread3Thread1of1ForFork0_#res.base_9| 0) (= v_thread3Thread1of1ForFork0_~arg.offset_11 |v_thread3Thread1of1ForFork0_#in~arg.offset_11|) (= v_thread3Thread1of1ForFork0_~arg.base_11 |v_thread3Thread1of1ForFork0_#in~arg.base_11|) (= |v_thread3Thread1of1ForFork0_#res.offset_9| 0)) InVars {thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, #memory_int=|v_#memory_int_142|, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} OutVars{thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_9|, #memory_int=|v_#memory_int_141|, thread3Thread1of1ForFork0_~arg.offset=v_thread3Thread1of1ForFork0_~arg.offset_11, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_9|, thread3Thread1of1ForFork0_~arg.base=v_thread3Thread1of1ForFork0_~arg.base_11, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, #memory_int, thread3Thread1of1ForFork0_~arg.offset, thread3Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork0_~arg.base][46], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 505#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), 385#(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: 509#(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))), 265#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 387#(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: 389#(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|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 391#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 267#(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|)), 406#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (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) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 280#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 153#thread3EXITtrue, 35#thread2EXITtrue, Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 43#thread2EXITtrue, Black: 287#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 418#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 424#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 426#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), 431#true, Black: 310#(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))), Black: 312#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 314#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 320#true, Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 451#(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: 453#(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|))), 73#ULTIMATE.startEXITtrue, Black: 441#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 445#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(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|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 338#(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_~#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: 464#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 340#(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_~#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: 473#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 342#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 344#(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 (= |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|)))), Black: 330#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 480#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|))), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 220#(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: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 232#|ULTIMATE.start_main_#t~short21|, Black: 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 486#(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: 488#(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: 490#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) |ULTIMATE.start_main_#t~short21| (<= (+ |#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))), 498#true, Black: 370#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 359#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 362#(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: 366#(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)), 123#L1152-2true, Black: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:39:10,162 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-25 22:39:10,163 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 22:39:10,163 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 22:39:10,163 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 22:39:10,305 INFO L129 PetriNetUnfolder]: 4338/8050 cut-off events. [2021-03-25 22:39:10,305 INFO L130 PetriNetUnfolder]: For 61058/62137 co-relation queries the response was YES. [2021-03-25 22:39:10,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28500 conditions, 8050 events. 4338/8050 cut-off events. For 61058/62137 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 64910 event pairs, 38 based on Foata normal form. 250/5900 useless extension candidates. Maximal degree in co-relation 25354. Up to 1942 conditions per place. [2021-03-25 22:39:10,426 INFO L142 LiptonReduction]: Number of co-enabled transitions 3764 [2021-03-25 22:39:10,435 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:39:10,435 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:39:10,435 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 734 [2021-03-25 22:39:10,436 INFO L480 AbstractCegarLoop]: Abstraction has has 152 places, 227 transitions, 3593 flow [2021-03-25 22:39:10,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 192.875) internal successors, (1543), 8 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:10,436 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:39:10,436 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 22:39:10,436 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 22:39:10,436 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:39:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:39:10,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2018694054, now seen corresponding path program 3 times [2021-03-25 22:39:10,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:39:10,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805169783] [2021-03-25 22:39:10,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:39:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:39:10,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:10,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 22:39:10,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:10,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:39:10,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:10,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:39:10,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:10,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:39:10,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:10,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:39:10,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:10,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:39:10,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:10,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:39:10,492 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 22:39:10,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805169783] [2021-03-25 22:39:10,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:39:10,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 22:39:10,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182859757] [2021-03-25 22:39:10,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 22:39:10,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:39:10,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 22:39:10,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 22:39:10,494 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 348 [2021-03-25 22:39:10,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 227 transitions, 3593 flow. Second operand has 8 states, 8 states have (on average 192.875) internal successors, (1543), 8 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:10,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:39:10,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 348 [2021-03-25 22:39:10,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:39:13,552 INFO L129 PetriNetUnfolder]: 18341/25922 cut-off events. [2021-03-25 22:39:13,552 INFO L130 PetriNetUnfolder]: For 402517/402751 co-relation queries the response was YES. [2021-03-25 22:39:13,675 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141456 conditions, 25922 events. 18341/25922 cut-off events. For 402517/402751 co-relation queries the response was YES. Maximal size of possible extension queue 1261. Compared 157967 event pairs, 3558 based on Foata normal form. 125/19742 useless extension candidates. Maximal degree in co-relation 126135. Up to 14755 conditions per place. [2021-03-25 22:39:13,761 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 282 selfloop transitions, 28 changer transitions 2/344 dead transitions. [2021-03-25 22:39:13,761 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 344 transitions, 5984 flow [2021-03-25 22:39:13,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 22:39:13,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 22:39:13,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1814 transitions. [2021-03-25 22:39:13,763 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5791826309067688 [2021-03-25 22:39:13,763 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1814 transitions. [2021-03-25 22:39:13,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1814 transitions. [2021-03-25 22:39:13,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:39:13,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1814 transitions. [2021-03-25 22:39:13,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 201.55555555555554) internal successors, (1814), 9 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:13,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:13,766 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:13,766 INFO L185 Difference]: Start difference. First operand has 152 places, 227 transitions, 3593 flow. Second operand 9 states and 1814 transitions. [2021-03-25 22:39:13,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 344 transitions, 5984 flow [2021-03-25 22:39:14,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 344 transitions, 5936 flow, removed 12 selfloop flow, removed 4 redundant places. [2021-03-25 22:39:14,497 INFO L241 Difference]: Finished difference. Result has 159 places, 232 transitions, 3728 flow [2021-03-25 22:39:14,498 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3529, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3728, PETRI_PLACES=159, PETRI_TRANSITIONS=232} [2021-03-25 22:39:14,498 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 95 predicate places. [2021-03-25 22:39:14,498 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:39:14,498 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 232 transitions, 3728 flow [2021-03-25 22:39:14,498 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 232 transitions, 3728 flow [2021-03-25 22:39:14,500 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 159 places, 232 transitions, 3728 flow [2021-03-25 22:39:15,070 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] thread3ENTRY-->thread3EXIT: Formula: (and (= (store |v_#memory_int_142| v_~v~0.base_49 (store (select |v_#memory_int_142| v_~v~0.base_49) v_~v~0.offset_49 89)) |v_#memory_int_141|) (= |v_thread3Thread1of1ForFork0_#res.base_9| 0) (= v_thread3Thread1of1ForFork0_~arg.offset_11 |v_thread3Thread1of1ForFork0_#in~arg.offset_11|) (= v_thread3Thread1of1ForFork0_~arg.base_11 |v_thread3Thread1of1ForFork0_#in~arg.base_11|) (= |v_thread3Thread1of1ForFork0_#res.offset_9| 0)) InVars {thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, #memory_int=|v_#memory_int_142|, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} OutVars{thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_9|, #memory_int=|v_#memory_int_141|, thread3Thread1of1ForFork0_~arg.offset=v_thread3Thread1of1ForFork0_~arg.offset_11, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_9|, thread3Thread1of1ForFork0_~arg.base=v_thread3Thread1of1ForFork0_~arg.base_11, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, #memory_int, thread3Thread1of1ForFork0_~arg.offset, thread3Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork0_~arg.base][45], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 385#(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: 505#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 509#(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))), 515#true, 265#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 387#(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: 389#(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|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 391#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 267#(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|)), 406#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (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) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 528#(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: 532#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 280#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 526#(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)), 153#thread3EXITtrue, 35#thread2EXITtrue, Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 43#thread2EXITtrue, Black: 287#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 418#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 424#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 426#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), 431#true, Black: 310#(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))), Black: 312#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 314#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 320#true, Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 451#(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: 453#(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: 441#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 73#ULTIMATE.startEXITtrue, Black: 445#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(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|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 464#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 338#(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_~#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: 473#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 340#(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_~#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: 342#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 344#(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 (= |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|)))), Black: 330#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 480#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|))), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 220#(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: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 232#|ULTIMATE.start_main_#t~short21|, Black: 486#(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: 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 488#(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: 490#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 370#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 359#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 362#(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: 366#(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)), 123#L1152-2true, Black: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:39:15,071 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2021-03-25 22:39:15,071 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-25 22:39:15,071 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-25 22:39:15,071 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-25 22:39:15,190 INFO L129 PetriNetUnfolder]: 4719/8739 cut-off events. [2021-03-25 22:39:15,190 INFO L130 PetriNetUnfolder]: For 65802/66953 co-relation queries the response was YES. [2021-03-25 22:39:15,249 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30774 conditions, 8739 events. 4719/8739 cut-off events. For 65802/66953 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 71339 event pairs, 33 based on Foata normal form. 255/6370 useless extension candidates. Maximal degree in co-relation 27558. Up to 2138 conditions per place. [2021-03-25 22:39:15,332 INFO L142 LiptonReduction]: Number of co-enabled transitions 3908 [2021-03-25 22:39:15,341 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:39:15,341 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:39:15,341 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 843 [2021-03-25 22:39:15,342 INFO L480 AbstractCegarLoop]: Abstraction has has 159 places, 232 transitions, 3728 flow [2021-03-25 22:39:15,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 192.875) internal successors, (1543), 8 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:15,342 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:39:15,342 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 22:39:15,342 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-25 22:39:15,343 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:39:15,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:39:15,343 INFO L82 PathProgramCache]: Analyzing trace with hash -778119073, now seen corresponding path program 1 times [2021-03-25 22:39:15,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:39:15,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679423264] [2021-03-25 22:39:15,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:39:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:39:15,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:15,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:39:15,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:15,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 22:39:15,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:15,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:39:15,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:15,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:39:15,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:15,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:39:15,380 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 22:39:15,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679423264] [2021-03-25 22:39:15,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:39:15,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 22:39:15,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413172980] [2021-03-25 22:39:15,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 22:39:15,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:39:15,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 22:39:15,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 22:39:15,382 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 348 [2021-03-25 22:39:15,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 232 transitions, 3728 flow. Second operand has 6 states, 6 states have (on average 229.16666666666666) internal successors, (1375), 6 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:15,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:39:15,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 348 [2021-03-25 22:39:15,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:39:17,249 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][67], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 505#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 509#(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))), 515#true, 389#(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|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 385#(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: 387#(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: 391#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 269#(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|) |ULTIMATE.start_main_#t~short21|), Black: 267#(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: 528#(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: 532#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 406#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (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) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 526#(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)), Black: 280#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 544#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1)), Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 42#L1156-1true, Black: 287#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 418#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 424#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 426#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), 431#true, 312#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 308#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 310#(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))), Black: 314#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 320#true, Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 451#(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: 453#(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: 441#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 445#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(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|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 338#(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_~#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: 464#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 473#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 340#(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_~#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: 342#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 344#(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 (= |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|)))), Black: 330#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 220#(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)), 490#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 229#true, Black: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 480#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|))), Black: 232#|ULTIMATE.start_main_#t~short21|, Black: 486#(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: 488#(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: 370#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 359#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 362#(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: 366#(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)), 125#L1164-2true, Black: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:39:17,249 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 22:39:17,249 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:39:17,249 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:39:17,249 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:39:17,274 INFO L129 PetriNetUnfolder]: 11061/16899 cut-off events. [2021-03-25 22:39:17,274 INFO L130 PetriNetUnfolder]: For 323837/326281 co-relation queries the response was YES. [2021-03-25 22:39:17,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102772 conditions, 16899 events. 11061/16899 cut-off events. For 323837/326281 co-relation queries the response was YES. Maximal size of possible extension queue 949. Compared 113294 event pairs, 677 based on Foata normal form. 943/14308 useless extension candidates. Maximal degree in co-relation 92170. Up to 7101 conditions per place. [2021-03-25 22:39:17,666 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 157 selfloop transitions, 63 changer transitions 4/273 dead transitions. [2021-03-25 22:39:17,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 273 transitions, 4730 flow [2021-03-25 22:39:17,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 22:39:17,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 22:39:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1644 transitions. [2021-03-25 22:39:17,668 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6748768472906403 [2021-03-25 22:39:17,668 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1644 transitions. [2021-03-25 22:39:17,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1644 transitions. [2021-03-25 22:39:17,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:39:17,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1644 transitions. [2021-03-25 22:39:17,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 234.85714285714286) internal successors, (1644), 7 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:17,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:17,671 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:17,671 INFO L185 Difference]: Start difference. First operand has 159 places, 232 transitions, 3728 flow. Second operand 7 states and 1644 transitions. [2021-03-25 22:39:17,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 273 transitions, 4730 flow [2021-03-25 22:39:18,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 273 transitions, 4695 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-03-25 22:39:18,313 INFO L241 Difference]: Finished difference. Result has 163 places, 242 transitions, 4115 flow [2021-03-25 22:39:18,313 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3693, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4115, PETRI_PLACES=163, PETRI_TRANSITIONS=242} [2021-03-25 22:39:18,313 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 99 predicate places. [2021-03-25 22:39:18,313 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:39:18,314 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 242 transitions, 4115 flow [2021-03-25 22:39:18,314 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 242 transitions, 4115 flow [2021-03-25 22:39:18,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 163 places, 242 transitions, 4115 flow [2021-03-25 22:39:19,150 INFO L129 PetriNetUnfolder]: 4799/8944 cut-off events. [2021-03-25 22:39:19,150 INFO L130 PetriNetUnfolder]: For 77165/78409 co-relation queries the response was YES. [2021-03-25 22:39:19,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33088 conditions, 8944 events. 4799/8944 cut-off events. For 77165/78409 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 74067 event pairs, 24 based on Foata normal form. 358/6628 useless extension candidates. Maximal degree in co-relation 31032. Up to 2158 conditions per place. [2021-03-25 22:39:19,282 INFO L142 LiptonReduction]: Number of co-enabled transitions 4044 [2021-03-25 22:39:19,292 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:39:19,292 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:39:19,292 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 979 [2021-03-25 22:39:19,292 INFO L480 AbstractCegarLoop]: Abstraction has has 163 places, 242 transitions, 4115 flow [2021-03-25 22:39:19,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 229.16666666666666) internal successors, (1375), 6 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:19,293 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:39:19,293 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 22:39:19,293 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-25 22:39:19,293 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:39:19,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:39:19,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2125628681, now seen corresponding path program 2 times [2021-03-25 22:39:19,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:39:19,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006816722] [2021-03-25 22:39:19,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:39:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:39:19,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:19,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:39:19,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:19,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 22:39:19,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:19,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 22:39:19,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:19,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:39:19,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:19,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:39:19,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:19,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:39:19,347 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 22:39:19,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006816722] [2021-03-25 22:39:19,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:39:19,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 22:39:19,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322218098] [2021-03-25 22:39:19,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 22:39:19,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:39:19,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 22:39:19,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 22:39:19,350 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 348 [2021-03-25 22:39:19,350 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 242 transitions, 4115 flow. Second operand has 7 states, 7 states have (on average 226.85714285714286) internal successors, (1588), 7 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:19,350 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:39:19,350 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 348 [2021-03-25 22:39:19,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:39:21,295 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][89], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 385#(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: 505#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 509#(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))), 265#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 387#(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: 389#(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|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 391#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 267#(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: 528#(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)), 406#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (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) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 532#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 526#(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)), 280#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 546#(and (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t5~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t5~0.base|) |thread0Thread1of1ForFork4_~#t5~0.offset| 4)) ~v~0.base) ~v~0.offset) 89) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1)), Black: 541#(and (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t5~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t5~0.base|) |thread0Thread1of1ForFork4_~#t5~0.offset| 4)) ~v~0.base) ~v~0.offset) 89) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base))), Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 42#L1156-1true, Black: 287#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 418#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 424#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 426#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), 431#true, 560#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (= (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) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 310#(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))), Black: 312#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 314#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 320#true, Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 451#(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: 453#(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: 441#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 445#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(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|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 338#(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_~#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: 464#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 473#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 340#(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_~#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: 342#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 344#(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 (= |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|)))), Black: 330#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 220#(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)), 486#(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: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 232#|ULTIMATE.start_main_#t~short21|, Black: 480#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|))), Black: 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 488#(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: 490#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 370#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 359#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 362#(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: 366#(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)), 125#L1164-2true, Black: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:39:21,295 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 22:39:21,295 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:39:21,295 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:39:21,295 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:39:21,318 INFO L129 PetriNetUnfolder]: 11147/17030 cut-off events. [2021-03-25 22:39:21,318 INFO L130 PetriNetUnfolder]: For 358515/360675 co-relation queries the response was YES. [2021-03-25 22:39:21,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106556 conditions, 17030 events. 11147/17030 cut-off events. For 358515/360675 co-relation queries the response was YES. Maximal size of possible extension queue 950. Compared 113844 event pairs, 711 based on Foata normal form. 713/14081 useless extension candidates. Maximal degree in co-relation 102016. Up to 6931 conditions per place. [2021-03-25 22:39:21,484 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 153 selfloop transitions, 70 changer transitions 3/275 dead transitions. [2021-03-25 22:39:21,486 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 275 transitions, 4980 flow [2021-03-25 22:39:21,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 22:39:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 22:39:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1630 transitions. [2021-03-25 22:39:21,488 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6691297208538588 [2021-03-25 22:39:21,488 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1630 transitions. [2021-03-25 22:39:21,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1630 transitions. [2021-03-25 22:39:21,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:39:21,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1630 transitions. [2021-03-25 22:39:21,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 232.85714285714286) internal successors, (1630), 7 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:21,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:21,492 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:21,493 INFO L185 Difference]: Start difference. First operand has 163 places, 242 transitions, 4115 flow. Second operand 7 states and 1630 transitions. [2021-03-25 22:39:21,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 275 transitions, 4980 flow [2021-03-25 22:39:22,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 275 transitions, 4949 flow, removed 13 selfloop flow, removed 2 redundant places. [2021-03-25 22:39:22,457 INFO L241 Difference]: Finished difference. Result has 169 places, 249 transitions, 4483 flow [2021-03-25 22:39:22,457 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4084, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4483, PETRI_PLACES=169, PETRI_TRANSITIONS=249} [2021-03-25 22:39:22,457 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 105 predicate places. [2021-03-25 22:39:22,457 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:39:22,458 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 249 transitions, 4483 flow [2021-03-25 22:39:22,458 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 249 transitions, 4483 flow [2021-03-25 22:39:22,459 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 169 places, 249 transitions, 4483 flow [2021-03-25 22:39:23,279 INFO L129 PetriNetUnfolder]: 4754/8865 cut-off events. [2021-03-25 22:39:23,280 INFO L130 PetriNetUnfolder]: For 83151/84135 co-relation queries the response was YES. [2021-03-25 22:39:23,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34244 conditions, 8865 events. 4754/8865 cut-off events. For 83151/84135 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 73246 event pairs, 24 based on Foata normal form. 387/6622 useless extension candidates. Maximal degree in co-relation 32078. Up to 2138 conditions per place. [2021-03-25 22:39:23,423 INFO L142 LiptonReduction]: Number of co-enabled transitions 4090 [2021-03-25 22:39:23,434 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:39:23,434 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:39:23,434 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 977 [2021-03-25 22:39:23,435 INFO L480 AbstractCegarLoop]: Abstraction has has 169 places, 249 transitions, 4483 flow [2021-03-25 22:39:23,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 226.85714285714286) internal successors, (1588), 7 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:23,435 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:39:23,435 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 22:39:23,436 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-25 22:39:23,436 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:39:23,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:39:23,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1926603186, now seen corresponding path program 4 times [2021-03-25 22:39:23,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:39:23,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756691067] [2021-03-25 22:39:23,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:39:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:39:23,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:23,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:39:23,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:23,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 22:39:23,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:23,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 22:39:23,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:23,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:39:23,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:23,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:39:23,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:23,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:39:23,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:23,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:39:23,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:23,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:39:23,526 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 22:39:23,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756691067] [2021-03-25 22:39:23,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:39:23,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 22:39:23,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430478651] [2021-03-25 22:39:23,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 22:39:23,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:39:23,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 22:39:23,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 22:39:23,529 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 348 [2021-03-25 22:39:23,530 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 249 transitions, 4483 flow. Second operand has 9 states, 9 states have (on average 213.44444444444446) internal successors, (1921), 9 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:23,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:39:23,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 348 [2021-03-25 22:39:23,530 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:39:25,955 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_17| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_17|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_32|) (and (not |v_ULTIMATE.start_main_#t~short21_32|) (not .cse0))))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_17|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_32|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][89], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 385#(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: 505#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 509#(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))), 265#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 387#(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: 389#(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|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 391#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 267#(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|)), 406#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (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) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 528#(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: 532#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 280#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 526#(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)), 546#(and (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t5~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t5~0.base|) |thread0Thread1of1ForFork4_~#t5~0.offset| 4)) ~v~0.base) ~v~0.offset) 89) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1)), Black: 541#(and (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t5~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t5~0.base|) |thread0Thread1of1ForFork4_~#t5~0.offset| 4)) ~v~0.base) ~v~0.offset) 89) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base))), Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 42#L1156-1true, Black: 287#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 418#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 424#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 426#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), 431#true, 560#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (= (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) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 554#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (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) 89)), Black: 310#(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))), 574#(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: 312#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 314#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 320#true, Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 451#(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: 453#(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: 441#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 445#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(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|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 464#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 338#(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_~#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: 473#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 340#(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_~#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: 342#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 344#(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 (= |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|)))), Black: 330#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 220#(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)), 486#(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: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 232#|ULTIMATE.start_main_#t~short21|, Black: 480#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|))), Black: 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 488#(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: 490#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 370#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 359#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 362#(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: 366#(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)), 125#L1164-2true, Black: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:39:25,955 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 22:39:25,955 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:39:25,955 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:39:25,955 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 22:39:25,980 INFO L129 PetriNetUnfolder]: 11215/17189 cut-off events. [2021-03-25 22:39:25,980 INFO L130 PetriNetUnfolder]: For 392760/394636 co-relation queries the response was YES. [2021-03-25 22:39:26,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111891 conditions, 17189 events. 11215/17189 cut-off events. For 392760/394636 co-relation queries the response was YES. Maximal size of possible extension queue 972. Compared 115901 event pairs, 574 based on Foata normal form. 581/14019 useless extension candidates. Maximal degree in co-relation 106658. Up to 5180 conditions per place. [2021-03-25 22:39:26,146 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 133 selfloop transitions, 115 changer transitions 5/302 dead transitions. [2021-03-25 22:39:26,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 302 transitions, 5690 flow [2021-03-25 22:39:26,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 22:39:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 22:39:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1983 transitions. [2021-03-25 22:39:26,148 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6331417624521073 [2021-03-25 22:39:26,149 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1983 transitions. [2021-03-25 22:39:26,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1983 transitions. [2021-03-25 22:39:26,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:39:26,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1983 transitions. [2021-03-25 22:39:26,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 220.33333333333334) internal successors, (1983), 9 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:26,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:26,152 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:26,152 INFO L185 Difference]: Start difference. First operand has 169 places, 249 transitions, 4483 flow. Second operand 9 states and 1983 transitions. [2021-03-25 22:39:26,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 302 transitions, 5690 flow [2021-03-25 22:39:27,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 302 transitions, 5591 flow, removed 33 selfloop flow, removed 3 redundant places. [2021-03-25 22:39:27,415 INFO L241 Difference]: Finished difference. Result has 177 places, 260 transitions, 5105 flow [2021-03-25 22:39:27,415 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4397, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5105, PETRI_PLACES=177, PETRI_TRANSITIONS=260} [2021-03-25 22:39:27,416 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 113 predicate places. [2021-03-25 22:39:27,416 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:39:27,416 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 260 transitions, 5105 flow [2021-03-25 22:39:27,416 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 260 transitions, 5105 flow [2021-03-25 22:39:27,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 177 places, 260 transitions, 5105 flow [2021-03-25 22:39:27,935 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] thread3ENTRY-->thread3EXIT: Formula: (and (= (store |v_#memory_int_142| v_~v~0.base_49 (store (select |v_#memory_int_142| v_~v~0.base_49) v_~v~0.offset_49 89)) |v_#memory_int_141|) (= |v_thread3Thread1of1ForFork0_#res.base_9| 0) (= v_thread3Thread1of1ForFork0_~arg.offset_11 |v_thread3Thread1of1ForFork0_#in~arg.offset_11|) (= v_thread3Thread1of1ForFork0_~arg.base_11 |v_thread3Thread1of1ForFork0_#in~arg.base_11|) (= |v_thread3Thread1of1ForFork0_#res.offset_9| 0)) InVars {thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, #memory_int=|v_#memory_int_142|, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} OutVars{thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_9|, #memory_int=|v_#memory_int_141|, thread3Thread1of1ForFork0_~arg.offset=v_thread3Thread1of1ForFork0_~arg.offset_11, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_9|, thread3Thread1of1ForFork0_~arg.base=v_thread3Thread1of1ForFork0_~arg.base_11, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, #memory_int, thread3Thread1of1ForFork0_~arg.offset, thread3Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork0_~arg.base][172], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 505#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), 385#(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: 509#(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))), 265#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 387#(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: 389#(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|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 391#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 267#(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|)), 406#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (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) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 528#(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: 532#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 280#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 526#(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)), 153#thread3EXITtrue, 541#(and (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t5~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t5~0.base|) |thread0Thread1of1ForFork4_~#t5~0.offset| 4)) ~v~0.base) ~v~0.offset) 89) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base))), 33#thread2EXITtrue, 35#thread2EXITtrue, Black: 546#(and (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t5~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t5~0.base|) |thread0Thread1of1ForFork4_~#t5~0.offset| 4)) ~v~0.base) ~v~0.offset) 89) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1)), Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 554#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (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) 89)), Black: 287#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 418#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 424#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 426#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), 431#true, Black: 560#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (= (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) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 567#(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|))), Black: 310#(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))), Black: 312#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 314#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 320#true, Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 576#(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: 578#(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) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 451#(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: 574#(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: 453#(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: 441#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 73#ULTIMATE.startEXITtrue, Black: 445#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(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|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 338#(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_~#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: 464#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 340#(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_~#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: 473#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 342#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 344#(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 (= |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|)))), Black: 330#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 480#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|))), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 220#(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: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 232#|ULTIMATE.start_main_#t~short21|, Black: 486#(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: 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 488#(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: 490#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 370#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 359#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 362#(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: 366#(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)), 123#L1152-2true, Black: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:39:27,936 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2021-03-25 22:39:27,936 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-25 22:39:27,936 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-25 22:39:27,936 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-25 22:39:28,093 INFO L129 PetriNetUnfolder]: 4867/9042 cut-off events. [2021-03-25 22:39:28,093 INFO L130 PetriNetUnfolder]: For 103557/104852 co-relation queries the response was YES. [2021-03-25 22:39:28,165 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36661 conditions, 9042 events. 4867/9042 cut-off events. For 103557/104852 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 74513 event pairs, 28 based on Foata normal form. 373/6738 useless extension candidates. Maximal degree in co-relation 34333. Up to 2204 conditions per place. [2021-03-25 22:39:28,451 INFO L142 LiptonReduction]: Number of co-enabled transitions 4276 [2021-03-25 22:39:28,466 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:39:28,467 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:39:28,467 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1051 [2021-03-25 22:39:28,467 INFO L480 AbstractCegarLoop]: Abstraction has has 177 places, 260 transitions, 5105 flow [2021-03-25 22:39:28,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 213.44444444444446) internal successors, (1921), 9 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:28,468 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:39:28,468 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 22:39:28,468 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-25 22:39:28,468 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:39:28,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:39:28,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1017368051, now seen corresponding path program 1 times [2021-03-25 22:39:28,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:39:28,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435976510] [2021-03-25 22:39:28,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:39:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:39:28,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:28,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 22:39:28,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:28,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:39:28,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:28,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:39:28,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:28,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 22:39:28,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:28,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:39:28,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:28,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:39:28,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:28,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:39:28,602 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 22:39:28,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435976510] [2021-03-25 22:39:28,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:39:28,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 22:39:28,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606977555] [2021-03-25 22:39:28,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 22:39:28,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:39:28,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 22:39:28,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-25 22:39:28,604 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 348 [2021-03-25 22:39:28,605 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 260 transitions, 5105 flow. Second operand has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:28,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:39:28,606 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 348 [2021-03-25 22:39:28,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:39:32,429 INFO L129 PetriNetUnfolder]: 18300/25830 cut-off events. [2021-03-25 22:39:32,429 INFO L130 PetriNetUnfolder]: For 649918/650078 co-relation queries the response was YES. [2021-03-25 22:39:32,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 171105 conditions, 25830 events. 18300/25830 cut-off events. For 649918/650078 co-relation queries the response was YES. Maximal size of possible extension queue 1242. Compared 155877 event pairs, 3618 based on Foata normal form. 179/19972 useless extension candidates. Maximal degree in co-relation 164987. Up to 15669 conditions per place. [2021-03-25 22:39:32,632 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 238 selfloop transitions, 29 changer transitions 30/330 dead transitions. [2021-03-25 22:39:32,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 330 transitions, 7161 flow [2021-03-25 22:39:32,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 22:39:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 22:39:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1982 transitions. [2021-03-25 22:39:32,634 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5695402298850575 [2021-03-25 22:39:32,634 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1982 transitions. [2021-03-25 22:39:32,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1982 transitions. [2021-03-25 22:39:32,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:39:32,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1982 transitions. [2021-03-25 22:39:32,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 198.2) internal successors, (1982), 10 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:32,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:32,638 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:32,638 INFO L185 Difference]: Start difference. First operand has 177 places, 260 transitions, 5105 flow. Second operand 10 states and 1982 transitions. [2021-03-25 22:39:32,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 330 transitions, 7161 flow [2021-03-25 22:39:34,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 330 transitions, 7061 flow, removed 17 selfloop flow, removed 4 redundant places. [2021-03-25 22:39:34,443 INFO L241 Difference]: Finished difference. Result has 184 places, 258 transitions, 5030 flow [2021-03-25 22:39:34,443 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4962, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5030, PETRI_PLACES=184, PETRI_TRANSITIONS=258} [2021-03-25 22:39:34,443 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 120 predicate places. [2021-03-25 22:39:34,443 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:39:34,443 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 258 transitions, 5030 flow [2021-03-25 22:39:34,443 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 258 transitions, 5030 flow [2021-03-25 22:39:34,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 184 places, 258 transitions, 5030 flow [2021-03-25 22:39:35,031 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] thread3ENTRY-->thread3EXIT: Formula: (and (= (store |v_#memory_int_142| v_~v~0.base_49 (store (select |v_#memory_int_142| v_~v~0.base_49) v_~v~0.offset_49 89)) |v_#memory_int_141|) (= |v_thread3Thread1of1ForFork0_#res.base_9| 0) (= v_thread3Thread1of1ForFork0_~arg.offset_11 |v_thread3Thread1of1ForFork0_#in~arg.offset_11|) (= v_thread3Thread1of1ForFork0_~arg.base_11 |v_thread3Thread1of1ForFork0_#in~arg.base_11|) (= |v_thread3Thread1of1ForFork0_#res.offset_9| 0)) InVars {thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, #memory_int=|v_#memory_int_142|, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} OutVars{thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_9|, #memory_int=|v_#memory_int_141|, thread3Thread1of1ForFork0_~arg.offset=v_thread3Thread1of1ForFork0_~arg.offset_11, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_9|, thread3Thread1of1ForFork0_~arg.base=v_thread3Thread1of1ForFork0_~arg.base_11, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, #memory_int, thread3Thread1of1ForFork0_~arg.offset, thread3Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork0_~arg.base][146], [Black: 253#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 505#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), 385#(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: 509#(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))), 265#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 387#(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: 389#(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|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 391#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 267#(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: 528#(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)), 406#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (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) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 532#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 526#(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)), 280#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 153#thread3EXITtrue, 541#(and (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t5~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t5~0.base|) |thread0Thread1of1ForFork4_~#t5~0.offset| 4)) ~v~0.base) ~v~0.offset) 89) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base))), 33#thread2EXITtrue, 35#thread2EXITtrue, Black: 546#(and (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t5~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t5~0.base|) |thread0Thread1of1ForFork4_~#t5~0.offset| 4)) ~v~0.base) ~v~0.offset) 89) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1)), Black: 296#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 554#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (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) 89)), Black: 287#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 418#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 424#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 426#(and (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_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (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|) 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 (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), 431#true, Black: 560#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (= (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) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 567#(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|))), Black: 310#(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))), Black: 312#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#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: 314#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 320#true, Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(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: 576#(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: 578#(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) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 451#(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: 574#(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: 453#(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|))), 585#true, Black: 441#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 73#ULTIMATE.startEXITtrue, Black: 445#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= (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|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 208#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 203#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 336#(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|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 338#(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_~#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: 464#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 340#(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_~#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: 473#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 342#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 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) (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: 604#(and (or (= |ULTIMATE.start_main_#t~mem18| 5) (= |ULTIMATE.start_main_#t~mem18| 1)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0))), Black: 344#(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 (= |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|)))), Black: 591#(or (= |ULTIMATE.start_main_#t~mem18| 5) (= |ULTIMATE.start_main_#t~mem18| 1)), Black: 330#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 480#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|))), Black: 224#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 215#(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: 220#(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: 231#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 232#|ULTIMATE.start_main_#t~short21|, Black: 486#(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: 234#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 488#(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: 370#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 359#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 362#(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: 366#(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)), 123#L1152-2true, Black: 244#(= |ULTIMATE.start_main_#t~mem18| 5)]) [2021-03-25 22:39:35,032 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2021-03-25 22:39:35,032 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-25 22:39:35,032 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-25 22:39:35,032 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-25 22:39:35,205 INFO L129 PetriNetUnfolder]: 4754/8840 cut-off events. [2021-03-25 22:39:35,206 INFO L130 PetriNetUnfolder]: For 95844/97064 co-relation queries the response was YES. [2021-03-25 22:39:35,277 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35010 conditions, 8840 events. 4754/8840 cut-off events. For 95844/97064 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 72954 event pairs, 27 based on Foata normal form. 450/6648 useless extension candidates. Maximal degree in co-relation 32802. Up to 2194 conditions per place. [2021-03-25 22:39:35,372 INFO L142 LiptonReduction]: Number of co-enabled transitions 4178 [2021-03-25 22:39:35,384 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:39:35,384 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:39:35,384 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 941 [2021-03-25 22:39:35,384 INFO L480 AbstractCegarLoop]: Abstraction has has 184 places, 258 transitions, 5030 flow [2021-03-25 22:39:35,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:35,385 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:39:35,385 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 22:39:35,385 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-25 22:39:35,385 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:39:35,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:39:35,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1610146341, now seen corresponding path program 1 times [2021-03-25 22:39:35,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:39:35,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766006413] [2021-03-25 22:39:35,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:39:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:39:35,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:35,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 22:39:35,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:35,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 22:39:35,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:35,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 22:39:35,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:35,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:39:35,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:35,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:39:35,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:35,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 22:39:35,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:35,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:39:35,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:35,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:39:35,491 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 22:39:35,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766006413] [2021-03-25 22:39:35,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:39:35,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 22:39:35,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930251433] [2021-03-25 22:39:35,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 22:39:35,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:39:35,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 22:39:35,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-25 22:39:35,494 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 348 [2021-03-25 22:39:35,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 258 transitions, 5030 flow. Second operand has 9 states, 9 states have (on average 191.77777777777777) internal successors, (1726), 9 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:35,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:39:35,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 348 [2021-03-25 22:39:35,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:39:38,738 INFO L129 PetriNetUnfolder]: 16889/24136 cut-off events. [2021-03-25 22:39:38,739 INFO L130 PetriNetUnfolder]: For 578542/579027 co-relation queries the response was YES. [2021-03-25 22:39:38,906 INFO L84 FinitePrefix]: Finished finitePrefix Result has 156106 conditions, 24136 events. 16889/24136 cut-off events. For 578542/579027 co-relation queries the response was YES. Maximal size of possible extension queue 1209. Compared 149835 event pairs, 3336 based on Foata normal form. 258/18672 useless extension candidates. Maximal degree in co-relation 150468. Up to 15395 conditions per place. [2021-03-25 22:39:38,975 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 251 selfloop transitions, 36 changer transitions 3/323 dead transitions. [2021-03-25 22:39:38,975 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 323 transitions, 6926 flow [2021-03-25 22:39:38,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 22:39:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 22:39:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1784 transitions. [2021-03-25 22:39:38,977 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5696040868454662 [2021-03-25 22:39:38,977 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1784 transitions. [2021-03-25 22:39:38,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1784 transitions. [2021-03-25 22:39:38,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:39:38,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1784 transitions. [2021-03-25 22:39:38,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.22222222222223) internal successors, (1784), 9 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:38,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:38,980 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:38,980 INFO L185 Difference]: Start difference. First operand has 184 places, 258 transitions, 5030 flow. Second operand 9 states and 1784 transitions. [2021-03-25 22:39:38,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 323 transitions, 6926 flow [2021-03-25 22:39:40,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 323 transitions, 6851 flow, removed 13 selfloop flow, removed 8 redundant places. [2021-03-25 22:39:40,428 INFO L241 Difference]: Finished difference. Result has 185 places, 260 transitions, 5111 flow [2021-03-25 22:39:40,428 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4947, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5111, PETRI_PLACES=185, PETRI_TRANSITIONS=260} [2021-03-25 22:39:40,428 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 121 predicate places. [2021-03-25 22:39:40,428 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:39:40,428 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 260 transitions, 5111 flow [2021-03-25 22:39:40,429 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 260 transitions, 5111 flow [2021-03-25 22:39:40,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 185 places, 260 transitions, 5111 flow [2021-03-25 22:39:41,271 INFO L129 PetriNetUnfolder]: 4638/8693 cut-off events. [2021-03-25 22:39:41,271 INFO L130 PetriNetUnfolder]: For 92048/92989 co-relation queries the response was YES. [2021-03-25 22:39:41,327 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34130 conditions, 8693 events. 4638/8693 cut-off events. For 92048/92989 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 72338 event pairs, 24 based on Foata normal form. 391/6488 useless extension candidates. Maximal degree in co-relation 31995. Up to 2160 conditions per place. [2021-03-25 22:39:41,412 INFO L142 LiptonReduction]: Number of co-enabled transitions 4146 [2021-03-25 22:39:41,423 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:39:41,423 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:39:41,423 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 995 [2021-03-25 22:39:41,424 INFO L480 AbstractCegarLoop]: Abstraction has has 185 places, 260 transitions, 5111 flow [2021-03-25 22:39:41,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 191.77777777777777) internal successors, (1726), 9 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:41,424 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:39:41,424 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 22:39:41,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-25 22:39:41,425 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:39:41,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:39:41,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1200886229, now seen corresponding path program 2 times [2021-03-25 22:39:41,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:39:41,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535193803] [2021-03-25 22:39:41,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:39:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:39:41,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:41,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 22:39:41,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:41,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 22:39:41,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:41,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 22:39:41,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:41,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:39:41,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:41,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:39:41,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:41,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 22:39:41,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:41,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 22:39:41,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:41,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 22:39:41,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:41,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:39:41,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:41,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:39:41,584 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 22:39:41,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535193803] [2021-03-25 22:39:41,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:39:41,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 22:39:41,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212019595] [2021-03-25 22:39:41,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 22:39:41,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:39:41,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 22:39:41,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-03-25 22:39:41,587 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-25 22:39:41,588 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 260 transitions, 5111 flow. Second operand has 10 states, 10 states have (on average 188.6) internal successors, (1886), 10 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:41,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:39:41,589 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-25 22:39:41,589 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:39:45,264 INFO L129 PetriNetUnfolder]: 17733/25288 cut-off events. [2021-03-25 22:39:45,264 INFO L130 PetriNetUnfolder]: For 630349/630991 co-relation queries the response was YES. [2021-03-25 22:39:45,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163946 conditions, 25288 events. 17733/25288 cut-off events. For 630349/630991 co-relation queries the response was YES. Maximal size of possible extension queue 1275. Compared 157155 event pairs, 3318 based on Foata normal form. 273/19520 useless extension candidates. Maximal degree in co-relation 158269. Up to 15049 conditions per place. [2021-03-25 22:39:45,490 INFO L132 encePairwiseOnDemand]: 336/348 looper letters, 258 selfloop transitions, 47 changer transitions 4/342 dead transitions. [2021-03-25 22:39:45,490 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 342 transitions, 7428 flow [2021-03-25 22:39:45,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 22:39:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 22:39:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1958 transitions. [2021-03-25 22:39:45,492 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5626436781609195 [2021-03-25 22:39:45,492 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1958 transitions. [2021-03-25 22:39:45,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1958 transitions. [2021-03-25 22:39:45,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:39:45,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1958 transitions. [2021-03-25 22:39:45,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 195.8) internal successors, (1958), 10 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:45,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:45,496 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:45,496 INFO L185 Difference]: Start difference. First operand has 185 places, 260 transitions, 5111 flow. Second operand 10 states and 1958 transitions. [2021-03-25 22:39:45,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 342 transitions, 7428 flow [2021-03-25 22:39:47,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 342 transitions, 7178 flow, removed 37 selfloop flow, removed 8 redundant places. [2021-03-25 22:39:47,163 INFO L241 Difference]: Finished difference. Result has 189 places, 268 transitions, 5246 flow [2021-03-25 22:39:47,164 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4869, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5246, PETRI_PLACES=189, PETRI_TRANSITIONS=268} [2021-03-25 22:39:47,164 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 125 predicate places. [2021-03-25 22:39:47,164 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:39:47,164 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 268 transitions, 5246 flow [2021-03-25 22:39:47,164 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 268 transitions, 5246 flow [2021-03-25 22:39:47,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 189 places, 268 transitions, 5246 flow [2021-03-25 22:39:47,960 INFO L129 PetriNetUnfolder]: 4891/9212 cut-off events. [2021-03-25 22:39:47,961 INFO L130 PetriNetUnfolder]: For 88831/89870 co-relation queries the response was YES. [2021-03-25 22:39:48,038 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34338 conditions, 9212 events. 4891/9212 cut-off events. For 88831/89870 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 77810 event pairs, 38 based on Foata normal form. 293/6667 useless extension candidates. Maximal degree in co-relation 32230. Up to 2364 conditions per place. [2021-03-25 22:39:48,136 INFO L142 LiptonReduction]: Number of co-enabled transitions 4268 [2021-03-25 22:39:48,148 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:39:48,149 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:39:48,149 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 985 [2021-03-25 22:39:48,149 INFO L480 AbstractCegarLoop]: Abstraction has has 189 places, 268 transitions, 5246 flow [2021-03-25 22:39:48,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 188.6) internal successors, (1886), 10 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:48,150 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:39:48,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] [2021-03-25 22:39:48,150 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-25 22:39:48,150 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:39:48,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:39:48,150 INFO L82 PathProgramCache]: Analyzing trace with hash 939335227, now seen corresponding path program 3 times [2021-03-25 22:39:48,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:39:48,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585120740] [2021-03-25 22:39:48,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:39:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:39:48,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:48,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 22:39:48,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:48,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 22:39:48,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:48,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 22:39:48,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:48,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:39:48,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:48,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:39:48,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:48,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 22:39:48,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:48,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 22:39:48,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:48,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:39:48,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:48,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:39:48,242 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 22:39:48,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585120740] [2021-03-25 22:39:48,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:39:48,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 22:39:48,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447336259] [2021-03-25 22:39:48,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 22:39:48,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:39:48,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 22:39:48,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-03-25 22:39:48,245 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 348 [2021-03-25 22:39:48,246 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 268 transitions, 5246 flow. Second operand has 10 states, 10 states have (on average 189.6) internal successors, (1896), 10 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:48,246 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:39:48,246 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 348 [2021-03-25 22:39:48,246 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:39:51,725 INFO L129 PetriNetUnfolder]: 18569/26479 cut-off events. [2021-03-25 22:39:51,725 INFO L130 PetriNetUnfolder]: For 650719/651328 co-relation queries the response was YES. [2021-03-25 22:39:51,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 168819 conditions, 26479 events. 18569/26479 cut-off events. For 650719/651328 co-relation queries the response was YES. Maximal size of possible extension queue 1330. Compared 165787 event pairs, 3800 based on Foata normal form. 174/20214 useless extension candidates. Maximal degree in co-relation 163345. Up to 18855 conditions per place. [2021-03-25 22:39:52,007 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 279 selfloop transitions, 18 changer transitions 3/333 dead transitions. [2021-03-25 22:39:52,007 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 333 transitions, 7154 flow [2021-03-25 22:39:52,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 22:39:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 22:39:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1385 transitions. [2021-03-25 22:39:52,008 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5685550082101807 [2021-03-25 22:39:52,008 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1385 transitions. [2021-03-25 22:39:52,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1385 transitions. [2021-03-25 22:39:52,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:39:52,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1385 transitions. [2021-03-25 22:39:52,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 197.85714285714286) internal successors, (1385), 7 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:52,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:52,011 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:52,011 INFO L185 Difference]: Start difference. First operand has 189 places, 268 transitions, 5246 flow. Second operand 7 states and 1385 transitions. [2021-03-25 22:39:52,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 333 transitions, 7154 flow [2021-03-25 22:39:53,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 333 transitions, 7061 flow, removed 22 selfloop flow, removed 6 redundant places. [2021-03-25 22:39:53,741 INFO L241 Difference]: Finished difference. Result has 192 places, 272 transitions, 5344 flow [2021-03-25 22:39:53,741 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=5130, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5344, PETRI_PLACES=192, PETRI_TRANSITIONS=272} [2021-03-25 22:39:53,741 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 128 predicate places. [2021-03-25 22:39:53,741 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:39:53,741 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 272 transitions, 5344 flow [2021-03-25 22:39:53,742 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 272 transitions, 5344 flow [2021-03-25 22:39:53,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 192 places, 272 transitions, 5344 flow [2021-03-25 22:39:54,680 INFO L129 PetriNetUnfolder]: 5060/9487 cut-off events. [2021-03-25 22:39:54,681 INFO L130 PetriNetUnfolder]: For 92226/93305 co-relation queries the response was YES. [2021-03-25 22:39:54,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35316 conditions, 9487 events. 5060/9487 cut-off events. For 92226/93305 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 80125 event pairs, 23 based on Foata normal form. 333/6896 useless extension candidates. Maximal degree in co-relation 33285. Up to 2440 conditions per place. [2021-03-25 22:39:54,851 INFO L142 LiptonReduction]: Number of co-enabled transitions 4382 [2021-03-25 22:39:54,867 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:39:54,867 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:39:54,867 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1126 [2021-03-25 22:39:54,868 INFO L480 AbstractCegarLoop]: Abstraction has has 192 places, 272 transitions, 5344 flow [2021-03-25 22:39:54,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 189.6) internal successors, (1896), 10 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:54,868 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:39:54,868 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 22:39:54,868 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-03-25 22:39:54,868 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:39:54,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:39:54,869 INFO L82 PathProgramCache]: Analyzing trace with hash -2113270616, now seen corresponding path program 1 times [2021-03-25 22:39:54,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:39:54,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401732576] [2021-03-25 22:39:54,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:39:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:39:54,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:54,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 22:39:54,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:54,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:39:54,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:54,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 22:39:54,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:54,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:39:54,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:54,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:39:54,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:54,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:39:54,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:54,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 22:39:54,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:54,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:39:54,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:54,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:39:54,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:39:54,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:39:54,982 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 22:39:54,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401732576] [2021-03-25 22:39:54,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:39:54,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 22:39:54,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704762340] [2021-03-25 22:39:54,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 22:39:54,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:39:54,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 22:39:54,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-03-25 22:39:54,985 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-25 22:39:54,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 272 transitions, 5344 flow. Second operand has 10 states, 10 states have (on average 188.6) internal successors, (1886), 10 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:54,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:39:54,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-25 22:39:54,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:39:58,853 INFO L129 PetriNetUnfolder]: 20001/28118 cut-off events. [2021-03-25 22:39:58,854 INFO L130 PetriNetUnfolder]: For 700536/700925 co-relation queries the response was YES. [2021-03-25 22:39:59,062 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183696 conditions, 28118 events. 20001/28118 cut-off events. For 700536/700925 co-relation queries the response was YES. Maximal size of possible extension queue 1391. Compared 172193 event pairs, 3826 based on Foata normal form. 201/21665 useless extension candidates. Maximal degree in co-relation 178055. Up to 11184 conditions per place. [2021-03-25 22:39:59,169 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 293 selfloop transitions, 70 changer transitions 4/397 dead transitions. [2021-03-25 22:39:59,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 397 transitions, 8494 flow [2021-03-25 22:39:59,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 22:39:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 22:39:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1786 transitions. [2021-03-25 22:39:59,171 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.570242656449553 [2021-03-25 22:39:59,171 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1786 transitions. [2021-03-25 22:39:59,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1786 transitions. [2021-03-25 22:39:59,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:39:59,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1786 transitions. [2021-03-25 22:39:59,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.44444444444446) internal successors, (1786), 9 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:59,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:59,175 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:39:59,175 INFO L185 Difference]: Start difference. First operand has 192 places, 272 transitions, 5344 flow. Second operand 9 states and 1786 transitions. [2021-03-25 22:39:59,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 397 transitions, 8494 flow [2021-03-25 22:40:00,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 397 transitions, 8403 flow, removed 32 selfloop flow, removed 4 redundant places. [2021-03-25 22:40:01,001 INFO L241 Difference]: Finished difference. Result has 199 places, 283 transitions, 5684 flow [2021-03-25 22:40:01,001 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=5255, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5684, PETRI_PLACES=199, PETRI_TRANSITIONS=283} [2021-03-25 22:40:01,001 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 135 predicate places. [2021-03-25 22:40:01,001 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:40:01,001 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 283 transitions, 5684 flow [2021-03-25 22:40:01,001 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 283 transitions, 5684 flow [2021-03-25 22:40:01,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 199 places, 283 transitions, 5684 flow [2021-03-25 22:40:01,957 INFO L129 PetriNetUnfolder]: 5207/9783 cut-off events. [2021-03-25 22:40:01,958 INFO L130 PetriNetUnfolder]: For 94858/95793 co-relation queries the response was YES. [2021-03-25 22:40:02,038 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36376 conditions, 9783 events. 5207/9783 cut-off events. For 94858/95793 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 83251 event pairs, 27 based on Foata normal form. 290/7068 useless extension candidates. Maximal degree in co-relation 34328. Up to 2516 conditions per place. [2021-03-25 22:40:02,144 INFO L142 LiptonReduction]: Number of co-enabled transitions 4510 [2021-03-25 22:40:02,157 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:40:02,157 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:40:02,157 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1156 [2021-03-25 22:40:02,158 INFO L480 AbstractCegarLoop]: Abstraction has has 199 places, 283 transitions, 5684 flow [2021-03-25 22:40:02,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 188.6) internal successors, (1886), 10 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:02,158 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:40:02,158 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 22:40:02,158 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-03-25 22:40:02,158 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:40:02,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:40:02,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1677338276, now seen corresponding path program 2 times [2021-03-25 22:40:02,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:40:02,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798887953] [2021-03-25 22:40:02,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:40:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:40:02,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:02,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 22:40:02,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:02,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:40:02,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:02,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 22:40:02,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:02,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:40:02,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:02,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:40:02,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:02,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:40:02,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:02,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:40:02,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:02,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 22:40:02,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:02,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:40:02,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:02,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:40:02,271 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 22:40:02,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798887953] [2021-03-25 22:40:02,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:40:02,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 22:40:02,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212988123] [2021-03-25 22:40:02,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 22:40:02,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:40:02,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 22:40:02,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-25 22:40:02,274 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-25 22:40:02,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 283 transitions, 5684 flow. Second operand has 10 states, 10 states have (on average 188.6) internal successors, (1886), 10 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:02,275 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:40:02,275 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-25 22:40:02,275 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:40:06,183 INFO L129 PetriNetUnfolder]: 19404/27437 cut-off events. [2021-03-25 22:40:06,183 INFO L130 PetriNetUnfolder]: For 676884/677498 co-relation queries the response was YES. [2021-03-25 22:40:06,389 INFO L84 FinitePrefix]: Finished finitePrefix Result has 179449 conditions, 27437 events. 19404/27437 cut-off events. For 676884/677498 co-relation queries the response was YES. Maximal size of possible extension queue 1374. Compared 169746 event pairs, 3859 based on Foata normal form. 160/21107 useless extension candidates. Maximal degree in co-relation 173750. Up to 19132 conditions per place. [2021-03-25 22:40:06,460 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 244 selfloop transitions, 42 changer transitions 20/336 dead transitions. [2021-03-25 22:40:06,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 336 transitions, 7307 flow [2021-03-25 22:40:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 22:40:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 22:40:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1567 transitions. [2021-03-25 22:40:06,462 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5628591954022989 [2021-03-25 22:40:06,462 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1567 transitions. [2021-03-25 22:40:06,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1567 transitions. [2021-03-25 22:40:06,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:40:06,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1567 transitions. [2021-03-25 22:40:06,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 195.875) internal successors, (1567), 8 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:06,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:06,466 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:06,466 INFO L185 Difference]: Start difference. First operand has 199 places, 283 transitions, 5684 flow. Second operand 8 states and 1567 transitions. [2021-03-25 22:40:06,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 336 transitions, 7307 flow [2021-03-25 22:40:08,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 336 transitions, 7179 flow, removed 30 selfloop flow, removed 4 redundant places. [2021-03-25 22:40:08,343 INFO L241 Difference]: Finished difference. Result has 205 places, 275 transitions, 5479 flow [2021-03-25 22:40:08,343 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=5492, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5479, PETRI_PLACES=205, PETRI_TRANSITIONS=275} [2021-03-25 22:40:08,343 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 141 predicate places. [2021-03-25 22:40:08,343 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:40:08,344 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 275 transitions, 5479 flow [2021-03-25 22:40:08,344 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 275 transitions, 5479 flow [2021-03-25 22:40:08,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 205 places, 275 transitions, 5479 flow [2021-03-25 22:40:09,304 INFO L129 PetriNetUnfolder]: 5069/9492 cut-off events. [2021-03-25 22:40:09,304 INFO L130 PetriNetUnfolder]: For 89769/90641 co-relation queries the response was YES. [2021-03-25 22:40:09,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34955 conditions, 9492 events. 5069/9492 cut-off events. For 89769/90641 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 80123 event pairs, 24 based on Foata normal form. 290/6814 useless extension candidates. Maximal degree in co-relation 33104. Up to 2466 conditions per place. [2021-03-25 22:40:09,444 INFO L142 LiptonReduction]: Number of co-enabled transitions 4436 [2021-03-25 22:40:09,456 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:40:09,456 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:40:09,456 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1113 [2021-03-25 22:40:09,457 INFO L480 AbstractCegarLoop]: Abstraction has has 205 places, 275 transitions, 5479 flow [2021-03-25 22:40:09,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 188.6) internal successors, (1886), 10 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:09,457 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:40:09,457 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 22:40:09,457 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-03-25 22:40:09,457 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:40:09,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:40:09,457 INFO L82 PathProgramCache]: Analyzing trace with hash -833082465, now seen corresponding path program 4 times [2021-03-25 22:40:09,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:40:09,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415385392] [2021-03-25 22:40:09,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:40:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:40:09,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:09,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 22:40:09,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:09,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 22:40:09,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:09,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 22:40:09,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:09,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 22:40:09,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:09,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:40:09,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:09,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 22:40:09,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:09,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 22:40:09,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:09,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:40:09,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:09,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:40:09,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:09,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 22:40:09,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:09,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:40:09,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:09,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:40:09,674 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 22:40:09,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415385392] [2021-03-25 22:40:09,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:40:09,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 22:40:09,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179763927] [2021-03-25 22:40:09,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 22:40:09,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:40:09,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 22:40:09,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-03-25 22:40:09,676 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 348 [2021-03-25 22:40:09,677 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 275 transitions, 5479 flow. Second operand has 11 states, 11 states have (on average 187.45454545454547) internal successors, (2062), 11 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:09,677 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:40:09,677 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 348 [2021-03-25 22:40:09,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:40:13,618 INFO L129 PetriNetUnfolder]: 17651/25358 cut-off events. [2021-03-25 22:40:13,618 INFO L130 PetriNetUnfolder]: For 605878/606506 co-relation queries the response was YES. [2021-03-25 22:40:13,807 INFO L84 FinitePrefix]: Finished finitePrefix Result has 157802 conditions, 25358 events. 17651/25358 cut-off events. For 605878/606506 co-relation queries the response was YES. Maximal size of possible extension queue 1304. Compared 160195 event pairs, 3119 based on Foata normal form. 302/19563 useless extension candidates. Maximal degree in co-relation 152712. Up to 17146 conditions per place. [2021-03-25 22:40:13,854 INFO L132 encePairwiseOnDemand]: 336/348 looper letters, 227 selfloop transitions, 56 changer transitions 8/325 dead transitions. [2021-03-25 22:40:13,854 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 325 transitions, 7067 flow [2021-03-25 22:40:13,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 22:40:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 22:40:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1944 transitions. [2021-03-25 22:40:13,856 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5586206896551724 [2021-03-25 22:40:13,856 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1944 transitions. [2021-03-25 22:40:13,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1944 transitions. [2021-03-25 22:40:13,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:40:13,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1944 transitions. [2021-03-25 22:40:13,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 194.4) internal successors, (1944), 10 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:13,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:13,861 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:13,861 INFO L185 Difference]: Start difference. First operand has 205 places, 275 transitions, 5479 flow. Second operand 10 states and 1944 transitions. [2021-03-25 22:40:13,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 325 transitions, 7067 flow [2021-03-25 22:40:15,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 325 transitions, 6822 flow, removed 45 selfloop flow, removed 10 redundant places. [2021-03-25 22:40:15,146 INFO L241 Difference]: Finished difference. Result has 206 places, 250 transitions, 4895 flow [2021-03-25 22:40:15,146 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4751, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4895, PETRI_PLACES=206, PETRI_TRANSITIONS=250} [2021-03-25 22:40:15,147 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 142 predicate places. [2021-03-25 22:40:15,147 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:40:15,147 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 250 transitions, 4895 flow [2021-03-25 22:40:15,147 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 250 transitions, 4895 flow [2021-03-25 22:40:15,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 206 places, 250 transitions, 4895 flow [2021-03-25 22:40:16,012 INFO L129 PetriNetUnfolder]: 4837/9080 cut-off events. [2021-03-25 22:40:16,012 INFO L130 PetriNetUnfolder]: For 80966/82656 co-relation queries the response was YES. [2021-03-25 22:40:16,084 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32254 conditions, 9080 events. 4837/9080 cut-off events. For 80966/82656 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 76182 event pairs, 27 based on Foata normal form. 393/6639 useless extension candidates. Maximal degree in co-relation 30996. Up to 2412 conditions per place. [2021-03-25 22:40:16,179 INFO L142 LiptonReduction]: Number of co-enabled transitions 4152 [2021-03-25 22:40:16,189 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:40:16,189 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:40:16,189 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1042 [2021-03-25 22:40:16,190 INFO L480 AbstractCegarLoop]: Abstraction has has 206 places, 250 transitions, 4895 flow [2021-03-25 22:40:16,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 187.45454545454547) internal successors, (2062), 11 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:16,190 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:40:16,190 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 22:40:16,190 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-03-25 22:40:16,191 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:40:16,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:40:16,191 INFO L82 PathProgramCache]: Analyzing trace with hash 365023297, now seen corresponding path program 2 times [2021-03-25 22:40:16,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:40:16,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224181885] [2021-03-25 22:40:16,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:40:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:40:16,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:16,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 22:40:16,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:16,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:40:16,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:16,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:40:16,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:16,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:40:16,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:16,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 22:40:16,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:16,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:40:16,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:16,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:40:16,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:16,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:40:16,291 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 22:40:16,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224181885] [2021-03-25 22:40:16,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:40:16,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 22:40:16,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763565377] [2021-03-25 22:40:16,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 22:40:16,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:40:16,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 22:40:16,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-25 22:40:16,293 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 348 [2021-03-25 22:40:16,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 250 transitions, 4895 flow. Second operand has 9 states, 9 states have (on average 191.77777777777777) internal successors, (1726), 9 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:16,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:40:16,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 348 [2021-03-25 22:40:16,295 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:40:19,784 INFO L129 PetriNetUnfolder]: 16704/24012 cut-off events. [2021-03-25 22:40:19,785 INFO L130 PetriNetUnfolder]: For 564552/564674 co-relation queries the response was YES. [2021-03-25 22:40:19,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152704 conditions, 24012 events. 16704/24012 cut-off events. For 564552/564674 co-relation queries the response was YES. Maximal size of possible extension queue 1262. Compared 151723 event pairs, 3409 based on Foata normal form. 178/18573 useless extension candidates. Maximal degree in co-relation 147654. Up to 14390 conditions per place. [2021-03-25 22:40:19,989 INFO L132 encePairwiseOnDemand]: 336/348 looper letters, 214 selfloop transitions, 49 changer transitions 27/324 dead transitions. [2021-03-25 22:40:19,989 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 324 transitions, 7024 flow [2021-03-25 22:40:19,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-25 22:40:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-25 22:40:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2359 transitions. [2021-03-25 22:40:19,992 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5648946360153256 [2021-03-25 22:40:19,992 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2359 transitions. [2021-03-25 22:40:19,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2359 transitions. [2021-03-25 22:40:19,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:40:19,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2359 transitions. [2021-03-25 22:40:19,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 196.58333333333334) internal successors, (2359), 12 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:19,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 348.0) internal successors, (4524), 13 states have internal predecessors, (4524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:19,998 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 348.0) internal successors, (4524), 13 states have internal predecessors, (4524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:19,998 INFO L185 Difference]: Start difference. First operand has 206 places, 250 transitions, 4895 flow. Second operand 12 states and 2359 transitions. [2021-03-25 22:40:19,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 324 transitions, 7024 flow [2021-03-25 22:40:21,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 324 transitions, 6869 flow, removed 5 selfloop flow, removed 10 redundant places. [2021-03-25 22:40:21,094 INFO L241 Difference]: Finished difference. Result has 209 places, 253 transitions, 4974 flow [2021-03-25 22:40:21,094 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4717, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4974, PETRI_PLACES=209, PETRI_TRANSITIONS=253} [2021-03-25 22:40:21,095 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 145 predicate places. [2021-03-25 22:40:21,095 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:40:21,095 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 253 transitions, 4974 flow [2021-03-25 22:40:21,095 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 253 transitions, 4974 flow [2021-03-25 22:40:21,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 209 places, 253 transitions, 4974 flow [2021-03-25 22:40:21,989 INFO L129 PetriNetUnfolder]: 4761/8934 cut-off events. [2021-03-25 22:40:21,989 INFO L130 PetriNetUnfolder]: For 77238/78775 co-relation queries the response was YES. [2021-03-25 22:40:22,062 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30895 conditions, 8934 events. 4761/8934 cut-off events. For 77238/78775 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 74976 event pairs, 12 based on Foata normal form. 302/6374 useless extension candidates. Maximal degree in co-relation 29152. Up to 2412 conditions per place. [2021-03-25 22:40:22,152 INFO L142 LiptonReduction]: Number of co-enabled transitions 4048 [2021-03-25 22:40:22,163 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:40:22,163 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:40:22,163 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1068 [2021-03-25 22:40:22,163 INFO L480 AbstractCegarLoop]: Abstraction has has 209 places, 253 transitions, 4974 flow [2021-03-25 22:40:22,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 191.77777777777777) internal successors, (1726), 9 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:22,164 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:40:22,164 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 22:40:22,164 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-03-25 22:40:22,164 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:40:22,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:40:22,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1260813134, now seen corresponding path program 1 times [2021-03-25 22:40:22,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:40:22,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357070134] [2021-03-25 22:40:22,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:40:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:40:22,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:22,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 22:40:22,200 INFO L142 QuantifierPusher]: treesize reduction 4, result has 92.6 percent of original size [2021-03-25 22:40:22,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 22:40:22,221 INFO L142 QuantifierPusher]: treesize reduction 4, result has 92.5 percent of original size [2021-03-25 22:40:22,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 22:40:22,248 INFO L142 QuantifierPusher]: treesize reduction 4, result has 91.8 percent of original size [2021-03-25 22:40:22,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 22:40:22,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:22,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 22:40:22,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:22,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:40:22,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:22,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 22:40:22,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:22,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 22:40:22,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:22,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 22:40:22,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:22,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 22:40:22,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:22,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:40:22,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:22,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:40:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 22:40:22,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357070134] [2021-03-25 22:40:22,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:40:22,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 22:40:22,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968205107] [2021-03-25 22:40:22,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 22:40:22,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:40:22,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 22:40:22,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-03-25 22:40:22,417 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 348 [2021-03-25 22:40:22,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 253 transitions, 4974 flow. Second operand has 12 states, 12 states have (on average 185.33333333333334) internal successors, (2224), 12 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:22,418 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:40:22,418 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 348 [2021-03-25 22:40:22,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:40:26,309 INFO L129 PetriNetUnfolder]: 17086/24527 cut-off events. [2021-03-25 22:40:26,309 INFO L130 PetriNetUnfolder]: For 566807/567359 co-relation queries the response was YES. [2021-03-25 22:40:26,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 154527 conditions, 24527 events. 17086/24527 cut-off events. For 566807/567359 co-relation queries the response was YES. Maximal size of possible extension queue 1242. Compared 154190 event pairs, 2775 based on Foata normal form. 193/19001 useless extension candidates. Maximal degree in co-relation 150316. Up to 12289 conditions per place. [2021-03-25 22:40:26,527 INFO L132 encePairwiseOnDemand]: 335/348 looper letters, 225 selfloop transitions, 82 changer transitions 10/348 dead transitions. [2021-03-25 22:40:26,527 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 348 transitions, 7242 flow [2021-03-25 22:40:26,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 22:40:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 22:40:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2119 transitions. [2021-03-25 22:40:26,530 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5535527690700105 [2021-03-25 22:40:26,530 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2119 transitions. [2021-03-25 22:40:26,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2119 transitions. [2021-03-25 22:40:26,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:40:26,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2119 transitions. [2021-03-25 22:40:26,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 192.63636363636363) internal successors, (2119), 11 states have internal predecessors, (2119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:26,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:26,535 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:26,535 INFO L185 Difference]: Start difference. First operand has 209 places, 253 transitions, 4974 flow. Second operand 11 states and 2119 transitions. [2021-03-25 22:40:26,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 348 transitions, 7242 flow [2021-03-25 22:40:27,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 348 transitions, 7097 flow, removed 0 selfloop flow, removed 11 redundant places. [2021-03-25 22:40:27,514 INFO L241 Difference]: Finished difference. Result has 211 places, 267 transitions, 5385 flow [2021-03-25 22:40:27,514 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4799, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5385, PETRI_PLACES=211, PETRI_TRANSITIONS=267} [2021-03-25 22:40:27,514 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 147 predicate places. [2021-03-25 22:40:27,514 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:40:27,514 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 267 transitions, 5385 flow [2021-03-25 22:40:27,514 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 267 transitions, 5385 flow [2021-03-25 22:40:27,516 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 211 places, 267 transitions, 5385 flow [2021-03-25 22:40:28,380 INFO L129 PetriNetUnfolder]: 4820/9097 cut-off events. [2021-03-25 22:40:28,381 INFO L130 PetriNetUnfolder]: For 79748/81184 co-relation queries the response was YES. [2021-03-25 22:40:28,456 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31114 conditions, 9097 events. 4820/9097 cut-off events. For 79748/81184 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 76629 event pairs, 14 based on Foata normal form. 286/6498 useless extension candidates. Maximal degree in co-relation 29793. Up to 2458 conditions per place. [2021-03-25 22:40:28,549 INFO L142 LiptonReduction]: Number of co-enabled transitions 4048 [2021-03-25 22:40:28,563 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:40:28,563 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:40:28,563 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1049 [2021-03-25 22:40:28,564 INFO L480 AbstractCegarLoop]: Abstraction has has 211 places, 267 transitions, 5385 flow [2021-03-25 22:40:28,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 185.33333333333334) internal successors, (2224), 12 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:28,564 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:40:28,564 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 22:40:28,564 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-03-25 22:40:28,565 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:40:28,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:40:28,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1971624873, now seen corresponding path program 3 times [2021-03-25 22:40:28,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:40:28,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898374966] [2021-03-25 22:40:28,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:40:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:40:28,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:28,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 22:40:28,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:28,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 22:40:28,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:28,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 22:40:28,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:28,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 22:40:28,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:28,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:40:28,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:28,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:40:28,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:28,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:40:28,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:28,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 22:40:28,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:28,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 22:40:28,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:28,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 22:40:28,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:28,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:40:28,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:28,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:40:28,801 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 22:40:28,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898374966] [2021-03-25 22:40:28,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:40:28,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 22:40:28,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590969207] [2021-03-25 22:40:28,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 22:40:28,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:40:28,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 22:40:28,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-03-25 22:40:28,805 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 348 [2021-03-25 22:40:28,806 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 267 transitions, 5385 flow. Second operand has 12 states, 12 states have (on average 187.33333333333334) internal successors, (2248), 12 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:28,806 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:40:28,806 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 348 [2021-03-25 22:40:28,806 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:40:32,612 INFO L129 PetriNetUnfolder]: 18565/26958 cut-off events. [2021-03-25 22:40:32,612 INFO L130 PetriNetUnfolder]: For 628780/629066 co-relation queries the response was YES. [2021-03-25 22:40:32,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165525 conditions, 26958 events. 18565/26958 cut-off events. For 628780/629066 co-relation queries the response was YES. Maximal size of possible extension queue 1419. Compared 175286 event pairs, 3456 based on Foata normal form. 236/20620 useless extension candidates. Maximal degree in co-relation 161479. Up to 18092 conditions per place. [2021-03-25 22:40:32,872 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 268 selfloop transitions, 47 changer transitions 8/357 dead transitions. [2021-03-25 22:40:32,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 357 transitions, 7914 flow [2021-03-25 22:40:32,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 22:40:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 22:40:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1375 transitions. [2021-03-25 22:40:32,875 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5644499178981938 [2021-03-25 22:40:32,875 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1375 transitions. [2021-03-25 22:40:32,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1375 transitions. [2021-03-25 22:40:32,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:40:32,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1375 transitions. [2021-03-25 22:40:32,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 196.42857142857142) internal successors, (1375), 7 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:32,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:32,878 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:32,878 INFO L185 Difference]: Start difference. First operand has 211 places, 267 transitions, 5385 flow. Second operand 7 states and 1375 transitions. [2021-03-25 22:40:32,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 357 transitions, 7914 flow [2021-03-25 22:40:34,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 357 transitions, 7780 flow, removed 27 selfloop flow, removed 9 redundant places. [2021-03-25 22:40:34,391 INFO L241 Difference]: Finished difference. Result has 211 places, 283 transitions, 5766 flow [2021-03-25 22:40:34,391 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=5255, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5766, PETRI_PLACES=211, PETRI_TRANSITIONS=283} [2021-03-25 22:40:34,391 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 147 predicate places. [2021-03-25 22:40:34,391 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:40:34,391 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 283 transitions, 5766 flow [2021-03-25 22:40:34,391 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 283 transitions, 5766 flow [2021-03-25 22:40:34,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 211 places, 283 transitions, 5766 flow [2021-03-25 22:40:35,213 INFO L129 PetriNetUnfolder]: 5569/10493 cut-off events. [2021-03-25 22:40:35,213 INFO L130 PetriNetUnfolder]: For 87669/89723 co-relation queries the response was YES. [2021-03-25 22:40:35,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35143 conditions, 10493 events. 5569/10493 cut-off events. For 87669/89723 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 90790 event pairs, 15 based on Foata normal form. 444/7567 useless extension candidates. Maximal degree in co-relation 33809. Up to 2878 conditions per place. [2021-03-25 22:40:35,637 INFO L142 LiptonReduction]: Number of co-enabled transitions 4326 [2021-03-25 22:40:35,650 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:40:35,651 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:40:35,651 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1260 [2021-03-25 22:40:35,651 INFO L480 AbstractCegarLoop]: Abstraction has has 211 places, 283 transitions, 5766 flow [2021-03-25 22:40:35,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 187.33333333333334) internal successors, (2248), 12 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:35,652 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:40:35,652 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 22:40:35,652 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-03-25 22:40:35,652 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:40:35,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:40:35,652 INFO L82 PathProgramCache]: Analyzing trace with hash 462293073, now seen corresponding path program 4 times [2021-03-25 22:40:35,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:40:35,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600492065] [2021-03-25 22:40:35,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:40:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:40:35,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:35,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 22:40:35,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:35,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 22:40:35,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:35,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:40:35,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:35,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:40:35,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:35,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:40:35,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:35,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:40:35,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:35,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:40:35,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:35,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:40:35,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:35,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:40:35,736 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 22:40:35,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600492065] [2021-03-25 22:40:35,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:40:35,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 22:40:35,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424080438] [2021-03-25 22:40:35,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 22:40:35,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:40:35,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 22:40:35,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-03-25 22:40:35,738 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 348 [2021-03-25 22:40:35,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 283 transitions, 5766 flow. Second operand has 10 states, 10 states have (on average 190.6) internal successors, (1906), 10 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:35,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:40:35,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 348 [2021-03-25 22:40:35,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:40:39,414 INFO L129 PetriNetUnfolder]: 18079/26261 cut-off events. [2021-03-25 22:40:39,415 INFO L130 PetriNetUnfolder]: For 610582/610630 co-relation queries the response was YES. [2021-03-25 22:40:39,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162521 conditions, 26261 events. 18079/26261 cut-off events. For 610582/610630 co-relation queries the response was YES. Maximal size of possible extension queue 1377. Compared 170816 event pairs, 3675 based on Foata normal form. 88/19992 useless extension candidates. Maximal degree in co-relation 158674. Up to 11777 conditions per place. [2021-03-25 22:40:39,949 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 251 selfloop transitions, 70 changer transitions 30/385 dead transitions. [2021-03-25 22:40:39,950 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 385 transitions, 8364 flow [2021-03-25 22:40:39,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 22:40:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 22:40:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1800 transitions. [2021-03-25 22:40:39,951 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5747126436781609 [2021-03-25 22:40:39,951 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1800 transitions. [2021-03-25 22:40:39,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1800 transitions. [2021-03-25 22:40:39,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:40:39,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1800 transitions. [2021-03-25 22:40:39,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:39,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:39,955 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:39,955 INFO L185 Difference]: Start difference. First operand has 211 places, 283 transitions, 5766 flow. Second operand 9 states and 1800 transitions. [2021-03-25 22:40:39,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 385 transitions, 8364 flow [2021-03-25 22:40:41,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 385 transitions, 8308 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 22:40:41,259 INFO L241 Difference]: Finished difference. Result has 219 places, 289 transitions, 6040 flow [2021-03-25 22:40:41,259 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=5649, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6040, PETRI_PLACES=219, PETRI_TRANSITIONS=289} [2021-03-25 22:40:41,259 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 155 predicate places. [2021-03-25 22:40:41,259 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:40:41,260 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 289 transitions, 6040 flow [2021-03-25 22:40:41,260 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 289 transitions, 6040 flow [2021-03-25 22:40:41,262 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 219 places, 289 transitions, 6040 flow [2021-03-25 22:40:42,170 INFO L129 PetriNetUnfolder]: 5279/9866 cut-off events. [2021-03-25 22:40:42,171 INFO L130 PetriNetUnfolder]: For 81854/83681 co-relation queries the response was YES. [2021-03-25 22:40:42,247 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32553 conditions, 9866 events. 5279/9866 cut-off events. For 81854/83681 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 83630 event pairs, 15 based on Foata normal form. 388/7025 useless extension candidates. Maximal degree in co-relation 31325. Up to 2764 conditions per place. [2021-03-25 22:40:42,341 INFO L142 LiptonReduction]: Number of co-enabled transitions 4220 [2021-03-25 22:40:42,354 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:40:42,354 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:40:42,354 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1095 [2021-03-25 22:40:42,354 INFO L480 AbstractCegarLoop]: Abstraction has has 219 places, 289 transitions, 6040 flow [2021-03-25 22:40:42,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 190.6) internal successors, (1906), 10 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:42,355 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:40:42,355 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 22:40:42,355 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-03-25 22:40:42,355 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:40:42,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:40:42,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1207258561, now seen corresponding path program 1 times [2021-03-25 22:40:42,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:40:42,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855983607] [2021-03-25 22:40:42,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:40:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:40:42,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:42,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 22:40:42,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:42,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-25 22:40:42,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:42,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 22:40:42,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:42,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-03-25 22:40:42,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:42,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-03-25 22:40:42,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:42,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-03-25 22:40:42,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:42,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-03-25 22:40:42,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:42,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-03-25 22:40:42,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:42,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-25 22:40:42,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:42,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-03-25 22:40:42,762 INFO L142 QuantifierPusher]: treesize reduction 13, result has 61.8 percent of original size [2021-03-25 22:40:42,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 22:40:42,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:42,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:40:42,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:42,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:40:42,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 22:40:42,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855983607] [2021-03-25 22:40:42,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:40:42,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-25 22:40:42,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748255377] [2021-03-25 22:40:42,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-25 22:40:42,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:40:42,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-25 22:40:42,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-03-25 22:40:42,788 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 348 [2021-03-25 22:40:42,789 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 289 transitions, 6040 flow. Second operand has 13 states, 13 states have (on average 186.30769230769232) internal successors, (2422), 13 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:42,789 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:40:42,789 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 348 [2021-03-25 22:40:42,790 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:40:47,001 INFO L129 PetriNetUnfolder]: 17633/25487 cut-off events. [2021-03-25 22:40:47,001 INFO L130 PetriNetUnfolder]: For 609984/610569 co-relation queries the response was YES. [2021-03-25 22:40:47,213 INFO L84 FinitePrefix]: Finished finitePrefix Result has 153542 conditions, 25487 events. 17633/25487 cut-off events. For 609984/610569 co-relation queries the response was YES. Maximal size of possible extension queue 1282. Compared 161879 event pairs, 3059 based on Foata normal form. 211/19431 useless extension candidates. Maximal degree in co-relation 151032. Up to 12814 conditions per place. [2021-03-25 22:40:47,279 INFO L132 encePairwiseOnDemand]: 334/348 looper letters, 185 selfloop transitions, 116 changer transitions 8/349 dead transitions. [2021-03-25 22:40:47,279 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 349 transitions, 7565 flow [2021-03-25 22:40:47,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 22:40:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 22:40:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2128 transitions. [2021-03-25 22:40:47,281 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5559038662486938 [2021-03-25 22:40:47,281 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2128 transitions. [2021-03-25 22:40:47,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2128 transitions. [2021-03-25 22:40:47,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:40:47,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2128 transitions. [2021-03-25 22:40:47,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 193.45454545454547) internal successors, (2128), 11 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:47,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:47,285 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:47,285 INFO L185 Difference]: Start difference. First operand has 219 places, 289 transitions, 6040 flow. Second operand 11 states and 2128 transitions. [2021-03-25 22:40:47,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 349 transitions, 7565 flow [2021-03-25 22:40:48,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 349 transitions, 7246 flow, removed 8 selfloop flow, removed 21 redundant places. [2021-03-25 22:40:48,566 INFO L241 Difference]: Finished difference. Result has 208 places, 279 transitions, 5751 flow [2021-03-25 22:40:48,566 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=5294, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5751, PETRI_PLACES=208, PETRI_TRANSITIONS=279} [2021-03-25 22:40:48,566 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 144 predicate places. [2021-03-25 22:40:48,566 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:40:48,566 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 279 transitions, 5751 flow [2021-03-25 22:40:48,567 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 279 transitions, 5751 flow [2021-03-25 22:40:48,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 208 places, 279 transitions, 5751 flow [2021-03-25 22:40:49,568 INFO L129 PetriNetUnfolder]: 5015/9408 cut-off events. [2021-03-25 22:40:49,569 INFO L130 PetriNetUnfolder]: For 73919/75415 co-relation queries the response was YES. [2021-03-25 22:40:49,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29826 conditions, 9408 events. 5015/9408 cut-off events. For 73919/75415 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 79285 event pairs, 13 based on Foata normal form. 320/6680 useless extension candidates. Maximal degree in co-relation 27658. Up to 2610 conditions per place. [2021-03-25 22:40:49,742 INFO L142 LiptonReduction]: Number of co-enabled transitions 3754 [2021-03-25 22:40:49,754 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:40:49,755 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:40:49,755 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1189 [2021-03-25 22:40:49,755 INFO L480 AbstractCegarLoop]: Abstraction has has 208 places, 279 transitions, 5751 flow [2021-03-25 22:40:49,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 186.30769230769232) internal successors, (2422), 13 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:49,756 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:40:49,756 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 22:40:49,756 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-03-25 22:40:49,756 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:40:49,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:40:49,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1093257319, now seen corresponding path program 1 times [2021-03-25 22:40:49,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:40:49,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124315881] [2021-03-25 22:40:49,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:40:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:40:49,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:49,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 22:40:49,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:49,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 22:40:49,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:49,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 22:40:49,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:49,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 22:40:49,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:49,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 22:40:49,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:49,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:40:49,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:49,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:40:49,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:49,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 22:40:49,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:49,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:40:49,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:49,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:40:49,954 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-03-25 22:40:49,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 22:40:49,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:49,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:40:49,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:49,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:40:49,978 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 22:40:49,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124315881] [2021-03-25 22:40:49,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:40:49,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-25 22:40:49,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635710938] [2021-03-25 22:40:49,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-25 22:40:49,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:40:49,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-25 22:40:49,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-03-25 22:40:49,982 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 348 [2021-03-25 22:40:49,983 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 279 transitions, 5751 flow. Second operand has 13 states, 13 states have (on average 186.30769230769232) internal successors, (2422), 13 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:49,983 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:40:49,983 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 348 [2021-03-25 22:40:49,983 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:40:50,324 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2021-03-25 22:40:53,763 INFO L129 PetriNetUnfolder]: 17912/26489 cut-off events. [2021-03-25 22:40:53,763 INFO L130 PetriNetUnfolder]: For 607418/607773 co-relation queries the response was YES. [2021-03-25 22:40:53,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 151880 conditions, 26489 events. 17912/26489 cut-off events. For 607418/607773 co-relation queries the response was YES. Maximal size of possible extension queue 1394. Compared 177581 event pairs, 2695 based on Foata normal form. 142/19957 useless extension candidates. Maximal degree in co-relation 141924. Up to 15999 conditions per place. [2021-03-25 22:40:53,989 INFO L132 encePairwiseOnDemand]: 335/348 looper letters, 202 selfloop transitions, 101 changer transitions 28/365 dead transitions. [2021-03-25 22:40:53,989 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 365 transitions, 7914 flow [2021-03-25 22:40:53,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 22:40:53,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 22:40:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2136 transitions. [2021-03-25 22:40:53,991 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5579937304075235 [2021-03-25 22:40:53,991 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2136 transitions. [2021-03-25 22:40:53,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2136 transitions. [2021-03-25 22:40:53,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:40:53,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2136 transitions. [2021-03-25 22:40:53,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 194.1818181818182) internal successors, (2136), 11 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:53,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:53,995 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:53,995 INFO L185 Difference]: Start difference. First operand has 208 places, 279 transitions, 5751 flow. Second operand 11 states and 2136 transitions. [2021-03-25 22:40:53,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 365 transitions, 7914 flow [2021-03-25 22:40:55,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 365 transitions, 7700 flow, removed 53 selfloop flow, removed 9 redundant places. [2021-03-25 22:40:55,173 INFO L241 Difference]: Finished difference. Result has 212 places, 293 transitions, 6271 flow [2021-03-25 22:40:55,173 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=5511, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6271, PETRI_PLACES=212, PETRI_TRANSITIONS=293} [2021-03-25 22:40:55,173 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 148 predicate places. [2021-03-25 22:40:55,173 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:40:55,173 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 293 transitions, 6271 flow [2021-03-25 22:40:55,173 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 212 places, 293 transitions, 6271 flow [2021-03-25 22:40:55,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 212 places, 293 transitions, 6271 flow [2021-03-25 22:40:55,879 INFO L129 PetriNetUnfolder]: 5215/9834 cut-off events. [2021-03-25 22:40:55,880 INFO L130 PetriNetUnfolder]: For 82462/82863 co-relation queries the response was YES. [2021-03-25 22:40:55,954 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31147 conditions, 9834 events. 5215/9834 cut-off events. For 82462/82863 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 83872 event pairs, 9 based on Foata normal form. 157/6727 useless extension candidates. Maximal degree in co-relation 28960. Up to 2748 conditions per place. [2021-03-25 22:40:56,257 INFO L142 LiptonReduction]: Number of co-enabled transitions 3888 [2021-03-25 22:40:56,269 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:40:56,269 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:40:56,269 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1096 [2021-03-25 22:40:56,270 INFO L480 AbstractCegarLoop]: Abstraction has has 212 places, 293 transitions, 6271 flow [2021-03-25 22:40:56,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 186.30769230769232) internal successors, (2422), 13 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:56,270 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:40:56,270 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 22:40:56,270 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-03-25 22:40:56,270 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:40:56,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:40:56,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1977299969, now seen corresponding path program 1 times [2021-03-25 22:40:56,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:40:56,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464869154] [2021-03-25 22:40:56,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:40:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:40:56,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:56,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 22:40:56,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:56,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 22:40:56,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:56,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:40:56,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:56,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:40:56,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:40:56,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:40:56,306 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 22:40:56,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464869154] [2021-03-25 22:40:56,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:40:56,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 22:40:56,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442929772] [2021-03-25 22:40:56,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 22:40:56,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:40:56,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 22:40:56,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 22:40:56,308 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 348 [2021-03-25 22:40:56,309 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 293 transitions, 6271 flow. Second operand has 6 states, 6 states have (on average 194.83333333333334) internal successors, (1169), 6 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:56,309 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:40:56,309 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 348 [2021-03-25 22:40:56,309 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:40:59,553 INFO L129 PetriNetUnfolder]: 15813/23645 cut-off events. [2021-03-25 22:40:59,553 INFO L130 PetriNetUnfolder]: For 604713/604715 co-relation queries the response was YES. [2021-03-25 22:40:59,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145676 conditions, 23645 events. 15813/23645 cut-off events. For 604713/604715 co-relation queries the response was YES. Maximal size of possible extension queue 1286. Compared 159338 event pairs, 3384 based on Foata normal form. 173/18084 useless extension candidates. Maximal degree in co-relation 136390. Up to 15786 conditions per place. [2021-03-25 22:40:59,777 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 232 selfloop transitions, 4 changer transitions 91/363 dead transitions. [2021-03-25 22:40:59,777 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 363 transitions, 8466 flow [2021-03-25 22:40:59,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 22:40:59,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 22:40:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1597 transitions. [2021-03-25 22:40:59,779 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5736350574712644 [2021-03-25 22:40:59,779 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1597 transitions. [2021-03-25 22:40:59,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1597 transitions. [2021-03-25 22:40:59,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:40:59,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1597 transitions. [2021-03-25 22:40:59,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 199.625) internal successors, (1597), 8 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:59,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:59,782 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:40:59,782 INFO L185 Difference]: Start difference. First operand has 212 places, 293 transitions, 6271 flow. Second operand 8 states and 1597 transitions. [2021-03-25 22:40:59,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 363 transitions, 8466 flow [2021-03-25 22:41:00,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 363 transitions, 8321 flow, removed 60 selfloop flow, removed 7 redundant places. [2021-03-25 22:41:00,991 INFO L241 Difference]: Finished difference. Result has 214 places, 270 transitions, 5685 flow [2021-03-25 22:41:00,991 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=6008, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5685, PETRI_PLACES=214, PETRI_TRANSITIONS=270} [2021-03-25 22:41:00,991 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 150 predicate places. [2021-03-25 22:41:00,991 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:41:00,991 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 270 transitions, 5685 flow [2021-03-25 22:41:00,992 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 270 transitions, 5685 flow [2021-03-25 22:41:00,993 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 199 places, 270 transitions, 5685 flow [2021-03-25 22:41:01,546 INFO L129 PetriNetUnfolder]: 4311/8072 cut-off events. [2021-03-25 22:41:01,546 INFO L130 PetriNetUnfolder]: For 58796/58866 co-relation queries the response was YES. [2021-03-25 22:41:01,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24981 conditions, 8072 events. 4311/8072 cut-off events. For 58796/58866 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 66466 event pairs, 6 based on Foata normal form. 52/5431 useless extension candidates. Maximal degree in co-relation 24892. Up to 2294 conditions per place. [2021-03-25 22:41:01,682 INFO L142 LiptonReduction]: Number of co-enabled transitions 3612 [2021-03-25 22:41:01,696 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:41:01,696 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:41:01,696 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 705 [2021-03-25 22:41:01,697 INFO L480 AbstractCegarLoop]: Abstraction has has 199 places, 270 transitions, 5685 flow [2021-03-25 22:41:01,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 194.83333333333334) internal successors, (1169), 6 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:01,697 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:41:01,697 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 22:41:01,697 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-03-25 22:41:01,697 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:41:01,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:41:01,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1251056328, now seen corresponding path program 1 times [2021-03-25 22:41:01,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:41:01,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26635160] [2021-03-25 22:41:01,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:41:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:41:01,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:01,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 22:41:01,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:01,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:41:01,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:01,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:41:01,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:01,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 22:41:01,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:01,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:41:01,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:01,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:41:01,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:01,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:41:01,763 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 22:41:01,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26635160] [2021-03-25 22:41:01,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:41:01,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 22:41:01,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33542627] [2021-03-25 22:41:01,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 22:41:01,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:41:01,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 22:41:01,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-25 22:41:01,765 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 348 [2021-03-25 22:41:01,766 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 270 transitions, 5685 flow. Second operand has 8 states, 8 states have (on average 193.125) internal successors, (1545), 8 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:01,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:41:01,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 348 [2021-03-25 22:41:01,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:41:04,378 INFO L129 PetriNetUnfolder]: 13543/20127 cut-off events. [2021-03-25 22:41:04,378 INFO L130 PetriNetUnfolder]: For 493004/493005 co-relation queries the response was YES. [2021-03-25 22:41:04,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124226 conditions, 20127 events. 13543/20127 cut-off events. For 493004/493005 co-relation queries the response was YES. Maximal size of possible extension queue 1108. Compared 131748 event pairs, 2992 based on Foata normal form. 115/15301 useless extension candidates. Maximal degree in co-relation 124084. Up to 13893 conditions per place. [2021-03-25 22:41:04,581 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 209 selfloop transitions, 6 changer transitions 100/348 dead transitions. [2021-03-25 22:41:04,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 348 transitions, 8060 flow [2021-03-25 22:41:04,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 22:41:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 22:41:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1782 transitions. [2021-03-25 22:41:04,583 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2021-03-25 22:41:04,583 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1782 transitions. [2021-03-25 22:41:04,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1782 transitions. [2021-03-25 22:41:04,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:41:04,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1782 transitions. [2021-03-25 22:41:04,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:04,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:04,587 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:04,587 INFO L185 Difference]: Start difference. First operand has 199 places, 270 transitions, 5685 flow. Second operand 9 states and 1782 transitions. [2021-03-25 22:41:04,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 348 transitions, 8060 flow [2021-03-25 22:41:05,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 348 transitions, 7882 flow, removed 25 selfloop flow, removed 16 redundant places. [2021-03-25 22:41:05,575 INFO L241 Difference]: Finished difference. Result has 193 places, 246 transitions, 4926 flow [2021-03-25 22:41:05,576 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=5421, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4926, PETRI_PLACES=193, PETRI_TRANSITIONS=246} [2021-03-25 22:41:05,576 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 129 predicate places. [2021-03-25 22:41:05,576 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:41:05,576 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 246 transitions, 4926 flow [2021-03-25 22:41:05,576 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 246 transitions, 4926 flow [2021-03-25 22:41:05,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 184 places, 246 transitions, 4926 flow [2021-03-25 22:41:06,026 INFO L129 PetriNetUnfolder]: 3702/6896 cut-off events. [2021-03-25 22:41:06,026 INFO L130 PetriNetUnfolder]: For 49319/49861 co-relation queries the response was YES. [2021-03-25 22:41:06,071 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20894 conditions, 6896 events. 3702/6896 cut-off events. For 49319/49861 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 55164 event pairs, 2 based on Foata normal form. 134/4687 useless extension candidates. Maximal degree in co-relation 20797. Up to 1972 conditions per place. [2021-03-25 22:41:06,134 INFO L142 LiptonReduction]: Number of co-enabled transitions 3428 [2021-03-25 22:41:06,144 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:41:06,144 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:41:06,144 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 568 [2021-03-25 22:41:06,144 INFO L480 AbstractCegarLoop]: Abstraction has has 184 places, 246 transitions, 4926 flow [2021-03-25 22:41:06,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 193.125) internal successors, (1545), 8 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:06,145 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:41:06,145 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 22:41:06,145 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-03-25 22:41:06,145 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:41:06,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:41:06,145 INFO L82 PathProgramCache]: Analyzing trace with hash 516393884, now seen corresponding path program 1 times [2021-03-25 22:41:06,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:41:06,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950635657] [2021-03-25 22:41:06,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:41:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:41:06,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:06,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 22:41:06,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:06,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:41:06,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:06,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:41:06,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:06,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:41:06,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:06,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 22:41:06,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:06,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:41:06,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:06,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:41:06,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:06,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:41:06,238 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 22:41:06,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950635657] [2021-03-25 22:41:06,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:41:06,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 22:41:06,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605149492] [2021-03-25 22:41:06,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 22:41:06,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:41:06,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 22:41:06,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-25 22:41:06,241 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 348 [2021-03-25 22:41:06,242 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 246 transitions, 4926 flow. Second operand has 9 states, 9 states have (on average 191.88888888888889) internal successors, (1727), 9 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:06,242 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:41:06,242 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 348 [2021-03-25 22:41:06,242 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:41:08,474 INFO L129 PetriNetUnfolder]: 11919/17658 cut-off events. [2021-03-25 22:41:08,474 INFO L130 PetriNetUnfolder]: For 413186/413187 co-relation queries the response was YES. [2021-03-25 22:41:08,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107556 conditions, 17658 events. 11919/17658 cut-off events. For 413186/413187 co-relation queries the response was YES. Maximal size of possible extension queue 988. Compared 113214 event pairs, 2691 based on Foata normal form. 115/13407 useless extension candidates. Maximal degree in co-relation 107394. Up to 12049 conditions per place. [2021-03-25 22:41:08,624 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 186 selfloop transitions, 10 changer transitions 81/306 dead transitions. [2021-03-25 22:41:08,624 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 306 transitions, 6727 flow [2021-03-25 22:41:08,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 22:41:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 22:41:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1965 transitions. [2021-03-25 22:41:08,626 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5646551724137931 [2021-03-25 22:41:08,626 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1965 transitions. [2021-03-25 22:41:08,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1965 transitions. [2021-03-25 22:41:08,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:41:08,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1965 transitions. [2021-03-25 22:41:08,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 196.5) internal successors, (1965), 10 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:08,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:08,630 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:08,631 INFO L185 Difference]: Start difference. First operand has 184 places, 246 transitions, 4926 flow. Second operand 10 states and 1965 transitions. [2021-03-25 22:41:08,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 306 transitions, 6727 flow [2021-03-25 22:41:09,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 306 transitions, 6646 flow, removed 22 selfloop flow, removed 14 redundant places. [2021-03-25 22:41:09,217 INFO L241 Difference]: Finished difference. Result has 181 places, 223 transitions, 4274 flow [2021-03-25 22:41:09,217 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4737, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4274, PETRI_PLACES=181, PETRI_TRANSITIONS=223} [2021-03-25 22:41:09,217 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 117 predicate places. [2021-03-25 22:41:09,217 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:41:09,217 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 223 transitions, 4274 flow [2021-03-25 22:41:09,217 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 223 transitions, 4274 flow [2021-03-25 22:41:09,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 171 places, 223 transitions, 4274 flow [2021-03-25 22:41:09,813 INFO L129 PetriNetUnfolder]: 3121/5783 cut-off events. [2021-03-25 22:41:09,813 INFO L130 PetriNetUnfolder]: For 39694/40230 co-relation queries the response was YES. [2021-03-25 22:41:09,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17144 conditions, 5783 events. 3121/5783 cut-off events. For 39694/40230 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 44722 event pairs, 3 based on Foata normal form. 133/3914 useless extension candidates. Maximal degree in co-relation 15202. Up to 1664 conditions per place. [2021-03-25 22:41:09,895 INFO L142 LiptonReduction]: Number of co-enabled transitions 3240 [2021-03-25 22:41:09,903 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:41:09,903 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:41:09,904 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 687 [2021-03-25 22:41:09,904 INFO L480 AbstractCegarLoop]: Abstraction has has 171 places, 223 transitions, 4274 flow [2021-03-25 22:41:09,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 191.88888888888889) internal successors, (1727), 9 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:09,904 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:41:09,904 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 22:41:09,905 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-03-25 22:41:09,905 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:41:09,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:41:09,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1691884528, now seen corresponding path program 2 times [2021-03-25 22:41:09,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:41:09,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257410201] [2021-03-25 22:41:09,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:41:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:41:09,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:09,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 22:41:09,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:09,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 22:41:09,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:09,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:41:09,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:09,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:41:09,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:09,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:41:09,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:09,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 22:41:10,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:10,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:41:10,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:10,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:41:10,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:10,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:41:10,021 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 22:41:10,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257410201] [2021-03-25 22:41:10,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:41:10,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 22:41:10,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207062490] [2021-03-25 22:41:10,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 22:41:10,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:41:10,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 22:41:10,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-25 22:41:10,023 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 348 [2021-03-25 22:41:10,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 223 transitions, 4274 flow. Second operand has 10 states, 10 states have (on average 190.7) internal successors, (1907), 10 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:10,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:41:10,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 348 [2021-03-25 22:41:10,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:41:11,880 INFO L129 PetriNetUnfolder]: 10276/15176 cut-off events. [2021-03-25 22:41:11,880 INFO L130 PetriNetUnfolder]: For 343403/343404 co-relation queries the response was YES. [2021-03-25 22:41:11,967 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90887 conditions, 15176 events. 10276/15176 cut-off events. For 343403/343404 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 94879 event pairs, 2328 based on Foata normal form. 115/11508 useless extension candidates. Maximal degree in co-relation 83583. Up to 10307 conditions per place. [2021-03-25 22:41:12,007 INFO L132 encePairwiseOnDemand]: 336/348 looper letters, 164 selfloop transitions, 15 changer transitions 73/279 dead transitions. [2021-03-25 22:41:12,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 279 transitions, 5940 flow [2021-03-25 22:41:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 22:41:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 22:41:12,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1958 transitions. [2021-03-25 22:41:12,009 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5626436781609195 [2021-03-25 22:41:12,009 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1958 transitions. [2021-03-25 22:41:12,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1958 transitions. [2021-03-25 22:41:12,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:41:12,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1958 transitions. [2021-03-25 22:41:12,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 195.8) internal successors, (1958), 10 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:12,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:12,012 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:12,012 INFO L185 Difference]: Start difference. First operand has 171 places, 223 transitions, 4274 flow. Second operand 10 states and 1958 transitions. [2021-03-25 22:41:12,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 279 transitions, 5940 flow [2021-03-25 22:41:12,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 279 transitions, 5818 flow, removed 38 selfloop flow, removed 14 redundant places. [2021-03-25 22:41:12,750 INFO L241 Difference]: Finished difference. Result has 168 places, 204 transitions, 3723 flow [2021-03-25 22:41:12,750 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4044, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3723, PETRI_PLACES=168, PETRI_TRANSITIONS=204} [2021-03-25 22:41:12,750 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 104 predicate places. [2021-03-25 22:41:12,750 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:41:12,750 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 204 transitions, 3723 flow [2021-03-25 22:41:12,751 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 204 transitions, 3723 flow [2021-03-25 22:41:12,752 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 160 places, 204 transitions, 3723 flow [2021-03-25 22:41:13,034 INFO L129 PetriNetUnfolder]: 2630/4858 cut-off events. [2021-03-25 22:41:13,034 INFO L130 PetriNetUnfolder]: For 32055/32427 co-relation queries the response was YES. [2021-03-25 22:41:13,059 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14326 conditions, 4858 events. 2630/4858 cut-off events. For 32055/32427 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 36255 event pairs, 8 based on Foata normal form. 104/3294 useless extension candidates. Maximal degree in co-relation 12665. Up to 1392 conditions per place. [2021-03-25 22:41:13,099 INFO L142 LiptonReduction]: Number of co-enabled transitions 3042 [2021-03-25 22:41:13,107 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:41:13,107 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:41:13,107 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 357 [2021-03-25 22:41:13,107 INFO L480 AbstractCegarLoop]: Abstraction has has 160 places, 204 transitions, 3723 flow [2021-03-25 22:41:13,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 190.7) internal successors, (1907), 10 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:13,107 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:41:13,108 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 22:41:13,108 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-03-25 22:41:13,108 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:41:13,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:41:13,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1605609032, now seen corresponding path program 3 times [2021-03-25 22:41:13,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:41:13,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170300127] [2021-03-25 22:41:13,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:41:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:41:13,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:13,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 22:41:13,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:13,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 22:41:13,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:13,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 22:41:13,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:13,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:41:13,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:13,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:41:13,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:13,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:41:13,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:13,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:41:13,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:13,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:41:13,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:13,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:41:13,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:13,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:41:13,221 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 22:41:13,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170300127] [2021-03-25 22:41:13,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:41:13,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 22:41:13,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780110010] [2021-03-25 22:41:13,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 22:41:13,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:41:13,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 22:41:13,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-03-25 22:41:13,224 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-25 22:41:13,224 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 204 transitions, 3723 flow. Second operand has 11 states, 11 states have (on average 188.54545454545453) internal successors, (2074), 11 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:13,224 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:41:13,224 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-25 22:41:13,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:41:14,839 INFO L129 PetriNetUnfolder]: 10294/15141 cut-off events. [2021-03-25 22:41:14,839 INFO L130 PetriNetUnfolder]: For 320848/320849 co-relation queries the response was YES. [2021-03-25 22:41:14,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88343 conditions, 15141 events. 10294/15141 cut-off events. For 320848/320849 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 93702 event pairs, 2380 based on Foata normal form. 58/11391 useless extension candidates. Maximal degree in co-relation 81150. Up to 10331 conditions per place. [2021-03-25 22:41:14,967 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 173 selfloop transitions, 23 changer transitions 31/254 dead transitions. [2021-03-25 22:41:14,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 254 transitions, 4724 flow [2021-03-25 22:41:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 22:41:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 22:41:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1585 transitions. [2021-03-25 22:41:14,969 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5693247126436781 [2021-03-25 22:41:14,969 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1585 transitions. [2021-03-25 22:41:14,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1585 transitions. [2021-03-25 22:41:14,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:41:14,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1585 transitions. [2021-03-25 22:41:14,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 198.125) internal successors, (1585), 8 states have internal predecessors, (1585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:14,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:14,971 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:14,971 INFO L185 Difference]: Start difference. First operand has 160 places, 204 transitions, 3723 flow. Second operand 8 states and 1585 transitions. [2021-03-25 22:41:14,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 254 transitions, 4724 flow [2021-03-25 22:41:15,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 254 transitions, 4642 flow, removed 19 selfloop flow, removed 11 redundant places. [2021-03-25 22:41:15,507 INFO L241 Difference]: Finished difference. Result has 159 places, 206 transitions, 3784 flow [2021-03-25 22:41:15,507 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3657, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3784, PETRI_PLACES=159, PETRI_TRANSITIONS=206} [2021-03-25 22:41:15,507 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 95 predicate places. [2021-03-25 22:41:15,507 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:41:15,508 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 206 transitions, 3784 flow [2021-03-25 22:41:15,508 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 206 transitions, 3784 flow [2021-03-25 22:41:15,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 157 places, 206 transitions, 3784 flow [2021-03-25 22:41:15,796 INFO L129 PetriNetUnfolder]: 2723/5042 cut-off events. [2021-03-25 22:41:15,796 INFO L130 PetriNetUnfolder]: For 32072/32284 co-relation queries the response was YES. [2021-03-25 22:41:15,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14888 conditions, 5042 events. 2723/5042 cut-off events. For 32072/32284 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 37997 event pairs, 5 based on Foata normal form. 79/3386 useless extension candidates. Maximal degree in co-relation 13787. Up to 1448 conditions per place. [2021-03-25 22:41:15,865 INFO L142 LiptonReduction]: Number of co-enabled transitions 3126 [2021-03-25 22:41:15,872 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:41:15,872 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:41:15,872 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 365 [2021-03-25 22:41:15,873 INFO L480 AbstractCegarLoop]: Abstraction has has 157 places, 206 transitions, 3784 flow [2021-03-25 22:41:15,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 188.54545454545453) internal successors, (2074), 11 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:15,873 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:41:15,873 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 22:41:15,873 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-03-25 22:41:15,873 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:41:15,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:41:15,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2117190334, now seen corresponding path program 2 times [2021-03-25 22:41:15,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:41:15,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074979740] [2021-03-25 22:41:15,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:41:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:41:15,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:15,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 22:41:15,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:15,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 22:41:15,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:15,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 22:41:15,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:15,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 22:41:15,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:15,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 22:41:15,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:15,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:41:15,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:15,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:41:16,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:16,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:41:16,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:16,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:41:16,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:16,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:41:16,068 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-03-25 22:41:16,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 22:41:16,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:16,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:41:16,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:16,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:41:16,092 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 22:41:16,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074979740] [2021-03-25 22:41:16,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:41:16,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-25 22:41:16,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308726670] [2021-03-25 22:41:16,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-25 22:41:16,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:41:16,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-25 22:41:16,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-03-25 22:41:16,095 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 348 [2021-03-25 22:41:16,096 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 206 transitions, 3784 flow. Second operand has 13 states, 13 states have (on average 186.30769230769232) internal successors, (2422), 13 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:16,096 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:41:16,096 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 348 [2021-03-25 22:41:16,096 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:41:18,384 INFO L129 PetriNetUnfolder]: 11213/16637 cut-off events. [2021-03-25 22:41:18,384 INFO L130 PetriNetUnfolder]: For 348974/348974 co-relation queries the response was YES. [2021-03-25 22:41:18,456 INFO L84 FinitePrefix]: Finished finitePrefix Result has 96658 conditions, 16637 events. 11213/16637 cut-off events. For 348974/348974 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 106975 event pairs, 494 based on Foata normal form. 114/12831 useless extension candidates. Maximal degree in co-relation 88378. Up to 8776 conditions per place. [2021-03-25 22:41:18,508 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 210 selfloop transitions, 73 changer transitions 21/331 dead transitions. [2021-03-25 22:41:18,508 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 331 transitions, 6627 flow [2021-03-25 22:41:18,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 22:41:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 22:41:18,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1954 transitions. [2021-03-25 22:41:18,510 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5614942528735632 [2021-03-25 22:41:18,510 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1954 transitions. [2021-03-25 22:41:18,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1954 transitions. [2021-03-25 22:41:18,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:41:18,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1954 transitions. [2021-03-25 22:41:18,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 195.4) internal successors, (1954), 10 states have internal predecessors, (1954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:18,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:18,514 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:18,514 INFO L185 Difference]: Start difference. First operand has 157 places, 206 transitions, 3784 flow. Second operand 10 states and 1954 transitions. [2021-03-25 22:41:18,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 331 transitions, 6627 flow [2021-03-25 22:41:19,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 331 transitions, 6554 flow, removed 12 selfloop flow, removed 6 redundant places. [2021-03-25 22:41:19,027 INFO L241 Difference]: Finished difference. Result has 163 places, 240 transitions, 4802 flow [2021-03-25 22:41:19,027 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3669, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4802, PETRI_PLACES=163, PETRI_TRANSITIONS=240} [2021-03-25 22:41:19,027 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 99 predicate places. [2021-03-25 22:41:19,027 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:41:19,027 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 240 transitions, 4802 flow [2021-03-25 22:41:19,027 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 240 transitions, 4802 flow [2021-03-25 22:41:19,030 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 159 places, 240 transitions, 4802 flow [2021-03-25 22:41:19,471 INFO L129 PetriNetUnfolder]: 3444/6429 cut-off events. [2021-03-25 22:41:19,471 INFO L130 PetriNetUnfolder]: For 57132/57209 co-relation queries the response was YES. [2021-03-25 22:41:19,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20766 conditions, 6429 events. 3444/6429 cut-off events. For 57132/57209 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 50676 event pairs, 3 based on Foata normal form. 34/4392 useless extension candidates. Maximal degree in co-relation 19169. Up to 1820 conditions per place. [2021-03-25 22:41:19,764 INFO L142 LiptonReduction]: Number of co-enabled transitions 3422 [2021-03-25 22:41:19,773 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:41:19,773 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:41:19,773 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 746 [2021-03-25 22:41:19,774 INFO L480 AbstractCegarLoop]: Abstraction has has 159 places, 240 transitions, 4802 flow [2021-03-25 22:41:19,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 186.30769230769232) internal successors, (2422), 13 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:19,774 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:41:19,774 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] [2021-03-25 22:41:19,774 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-03-25 22:41:19,774 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:41:19,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:41:19,774 INFO L82 PathProgramCache]: Analyzing trace with hash -290143258, now seen corresponding path program 1 times [2021-03-25 22:41:19,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:41:19,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806515726] [2021-03-25 22:41:19,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:41:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:41:19,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:19,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 22:41:19,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:19,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 22:41:19,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:19,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 22:41:19,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:19,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:41:19,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:19,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:41:19,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:19,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:41:19,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:19,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:41:19,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:19,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:41:19,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:19,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:41:19,861 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 22:41:19,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806515726] [2021-03-25 22:41:19,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:41:19,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 22:41:19,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743014830] [2021-03-25 22:41:19,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 22:41:19,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:41:19,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 22:41:19,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-25 22:41:19,864 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 348 [2021-03-25 22:41:19,865 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 240 transitions, 4802 flow. Second operand has 10 states, 10 states have (on average 189.8) internal successors, (1898), 10 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:19,865 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:41:19,865 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 348 [2021-03-25 22:41:19,865 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:41:21,642 INFO L129 PetriNetUnfolder]: 10962/16008 cut-off events. [2021-03-25 22:41:21,643 INFO L130 PetriNetUnfolder]: For 413867/413918 co-relation queries the response was YES. [2021-03-25 22:41:21,718 INFO L84 FinitePrefix]: Finished finitePrefix Result has 100548 conditions, 16008 events. 10962/16008 cut-off events. For 413867/413918 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 99392 event pairs, 2194 based on Foata normal form. 110/12111 useless extension candidates. Maximal degree in co-relation 92131. Up to 11829 conditions per place. [2021-03-25 22:41:21,772 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 235 selfloop transitions, 10 changer transitions 3/276 dead transitions. [2021-03-25 22:41:21,773 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 276 transitions, 5971 flow [2021-03-25 22:41:21,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 22:41:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 22:41:21,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1374 transitions. [2021-03-25 22:41:21,776 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5640394088669951 [2021-03-25 22:41:21,776 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1374 transitions. [2021-03-25 22:41:21,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1374 transitions. [2021-03-25 22:41:21,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:41:21,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1374 transitions. [2021-03-25 22:41:21,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 196.28571428571428) internal successors, (1374), 7 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:21,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:21,780 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:21,780 INFO L185 Difference]: Start difference. First operand has 159 places, 240 transitions, 4802 flow. Second operand 7 states and 1374 transitions. [2021-03-25 22:41:21,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 276 transitions, 5971 flow [2021-03-25 22:41:22,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 276 transitions, 5924 flow, removed 22 selfloop flow, removed 2 redundant places. [2021-03-25 22:41:22,235 INFO L241 Difference]: Finished difference. Result has 165 places, 240 transitions, 4779 flow [2021-03-25 22:41:22,235 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4740, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4779, PETRI_PLACES=165, PETRI_TRANSITIONS=240} [2021-03-25 22:41:22,235 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 101 predicate places. [2021-03-25 22:41:22,235 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:41:22,235 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 240 transitions, 4779 flow [2021-03-25 22:41:22,235 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 240 transitions, 4779 flow [2021-03-25 22:41:22,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 165 places, 240 transitions, 4779 flow [2021-03-25 22:41:22,778 INFO L129 PetriNetUnfolder]: 3422/6394 cut-off events. [2021-03-25 22:41:22,778 INFO L130 PetriNetUnfolder]: For 55679/55751 co-relation queries the response was YES. [2021-03-25 22:41:22,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20342 conditions, 6394 events. 3422/6394 cut-off events. For 55679/55751 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 50397 event pairs, 4 based on Foata normal form. 23/4350 useless extension candidates. Maximal degree in co-relation 20117. Up to 1816 conditions per place. [2021-03-25 22:41:22,864 INFO L142 LiptonReduction]: Number of co-enabled transitions 3380 [2021-03-25 22:41:22,873 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:41:22,873 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:41:22,873 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 638 [2021-03-25 22:41:22,874 INFO L480 AbstractCegarLoop]: Abstraction has has 165 places, 240 transitions, 4779 flow [2021-03-25 22:41:22,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 189.8) internal successors, (1898), 10 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:22,874 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:41:22,874 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] [2021-03-25 22:41:22,875 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-03-25 22:41:22,875 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:41:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:41:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1857185558, now seen corresponding path program 2 times [2021-03-25 22:41:22,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:41:22,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208716145] [2021-03-25 22:41:22,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:41:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:41:22,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:22,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 22:41:22,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:22,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:41:22,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:22,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:41:22,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:22,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 22:41:22,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:22,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:41:22,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:22,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:41:22,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:22,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:41:22,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:22,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:41:22,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:22,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:41:22,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:22,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:41:23,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:23,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:41:23,001 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 22:41:23,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208716145] [2021-03-25 22:41:23,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:41:23,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 22:41:23,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885765053] [2021-03-25 22:41:23,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 22:41:23,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:41:23,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 22:41:23,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-03-25 22:41:23,005 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 348 [2021-03-25 22:41:23,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 240 transitions, 4779 flow. Second operand has 11 states, 11 states have (on average 187.63636363636363) internal successors, (2064), 11 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:23,006 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:41:23,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 348 [2021-03-25 22:41:23,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:41:24,782 INFO L129 PetriNetUnfolder]: 9650/14287 cut-off events. [2021-03-25 22:41:24,782 INFO L130 PetriNetUnfolder]: For 376069/376090 co-relation queries the response was YES. [2021-03-25 22:41:24,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87231 conditions, 14287 events. 9650/14287 cut-off events. For 376069/376090 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 88514 event pairs, 1926 based on Foata normal form. 343/11170 useless extension candidates. Maximal degree in co-relation 85589. Up to 4930 conditions per place. [2021-03-25 22:41:24,884 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 193 selfloop transitions, 52 changer transitions 56/329 dead transitions. [2021-03-25 22:41:24,884 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 329 transitions, 7396 flow [2021-03-25 22:41:24,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 22:41:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 22:41:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1950 transitions. [2021-03-25 22:41:24,886 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5603448275862069 [2021-03-25 22:41:24,886 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1950 transitions. [2021-03-25 22:41:24,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1950 transitions. [2021-03-25 22:41:24,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:41:24,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1950 transitions. [2021-03-25 22:41:24,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 195.0) internal successors, (1950), 10 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 22:41:24,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:24,889 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:24,889 INFO L185 Difference]: Start difference. First operand has 165 places, 240 transitions, 4779 flow. Second operand 10 states and 1950 transitions. [2021-03-25 22:41:24,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 329 transitions, 7396 flow [2021-03-25 22:41:25,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 329 transitions, 7095 flow, removed 38 selfloop flow, removed 13 redundant places. [2021-03-25 22:41:25,210 INFO L241 Difference]: Finished difference. Result has 162 places, 196 transitions, 3812 flow [2021-03-25 22:41:25,210 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3757, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3812, PETRI_PLACES=162, PETRI_TRANSITIONS=196} [2021-03-25 22:41:25,210 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 98 predicate places. [2021-03-25 22:41:25,210 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:41:25,210 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 196 transitions, 3812 flow [2021-03-25 22:41:25,210 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 196 transitions, 3812 flow [2021-03-25 22:41:25,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 161 places, 196 transitions, 3812 flow [2021-03-25 22:41:25,519 INFO L129 PetriNetUnfolder]: 2962/5556 cut-off events. [2021-03-25 22:41:25,520 INFO L130 PetriNetUnfolder]: For 43180/43228 co-relation queries the response was YES. [2021-03-25 22:41:25,548 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16431 conditions, 5556 events. 2962/5556 cut-off events. For 43180/43228 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 42945 event pairs, 3 based on Foata normal form. 13/3695 useless extension candidates. Maximal degree in co-relation 15325. Up to 1628 conditions per place. [2021-03-25 22:41:25,593 INFO L142 LiptonReduction]: Number of co-enabled transitions 2710 [2021-03-25 22:41:25,600 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:41:25,600 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:41:25,600 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 390 [2021-03-25 22:41:25,600 INFO L480 AbstractCegarLoop]: Abstraction has has 161 places, 196 transitions, 3812 flow [2021-03-25 22:41:25,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 187.63636363636363) internal successors, (2064), 11 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:25,601 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:41:25,601 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] [2021-03-25 22:41:25,601 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-03-25 22:41:25,601 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:41:25,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:41:25,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1406620423, now seen corresponding path program 1 times [2021-03-25 22:41:25,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:41:25,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630869246] [2021-03-25 22:41:25,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:41:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:41:25,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:25,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 22:41:25,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:25,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-03-25 22:41:25,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:25,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-03-25 22:41:25,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:25,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-03-25 22:41:25,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:25,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 22:41:25,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:25,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:41:25,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:25,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:41:25,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:25,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 22:41:25,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:25,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:41:25,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:25,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 22:41:25,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:25,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:41:25,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:25,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:41:25,901 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 22:41:25,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630869246] [2021-03-25 22:41:25,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:41:25,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 22:41:25,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564614383] [2021-03-25 22:41:25,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 22:41:25,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:41:25,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 22:41:25,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-03-25 22:41:25,905 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 348 [2021-03-25 22:41:25,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 196 transitions, 3812 flow. Second operand has 12 states, 12 states have (on average 185.5) internal successors, (2226), 12 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:25,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:41:25,906 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 348 [2021-03-25 22:41:25,906 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:41:27,551 INFO L129 PetriNetUnfolder]: 8629/12875 cut-off events. [2021-03-25 22:41:27,551 INFO L130 PetriNetUnfolder]: For 303223/303234 co-relation queries the response was YES. [2021-03-25 22:41:27,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 76193 conditions, 12875 events. 8629/12875 cut-off events. For 303223/303234 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 80250 event pairs, 1233 based on Foata normal form. 70/9836 useless extension candidates. Maximal degree in co-relation 72318. Up to 6880 conditions per place. [2021-03-25 22:41:27,630 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 162 selfloop transitions, 47 changer transitions 32/266 dead transitions. [2021-03-25 22:41:27,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 266 transitions, 5865 flow [2021-03-25 22:41:27,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 22:41:27,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 22:41:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1729 transitions. [2021-03-25 22:41:27,631 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5520434227330779 [2021-03-25 22:41:27,631 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1729 transitions. [2021-03-25 22:41:27,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1729 transitions. [2021-03-25 22:41:27,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:41:27,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1729 transitions. [2021-03-25 22:41:27,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 192.11111111111111) internal successors, (1729), 9 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:27,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:27,634 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:27,634 INFO L185 Difference]: Start difference. First operand has 161 places, 196 transitions, 3812 flow. Second operand 9 states and 1729 transitions. [2021-03-25 22:41:27,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 266 transitions, 5865 flow [2021-03-25 22:41:27,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 266 transitions, 5291 flow, removed 27 selfloop flow, removed 14 redundant places. [2021-03-25 22:41:27,842 INFO L241 Difference]: Finished difference. Result has 155 places, 179 transitions, 3146 flow [2021-03-25 22:41:27,842 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3271, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3146, PETRI_PLACES=155, PETRI_TRANSITIONS=179} [2021-03-25 22:41:27,842 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 91 predicate places. [2021-03-25 22:41:27,842 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:41:27,842 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 179 transitions, 3146 flow [2021-03-25 22:41:27,843 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 179 transitions, 3146 flow [2021-03-25 22:41:27,844 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 155 places, 179 transitions, 3146 flow [2021-03-25 22:41:28,085 INFO L129 PetriNetUnfolder]: 2550/4947 cut-off events. [2021-03-25 22:41:28,086 INFO L130 PetriNetUnfolder]: For 31415/31471 co-relation queries the response was YES. [2021-03-25 22:41:28,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13335 conditions, 4947 events. 2550/4947 cut-off events. For 31415/31471 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 38793 event pairs, 8 based on Foata normal form. 14/3309 useless extension candidates. Maximal degree in co-relation 12500. Up to 1520 conditions per place. [2021-03-25 22:41:28,145 INFO L142 LiptonReduction]: Number of co-enabled transitions 2396 [2021-03-25 22:41:30,076 INFO L154 LiptonReduction]: Checked pairs total: 240 [2021-03-25 22:41:30,077 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-25 22:41:30,077 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2235 [2021-03-25 22:41:30,077 INFO L480 AbstractCegarLoop]: Abstraction has has 155 places, 179 transitions, 3192 flow [2021-03-25 22:41:30,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 185.5) internal successors, (2226), 12 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:30,078 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:41:30,078 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] [2021-03-25 22:41:30,078 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-03-25 22:41:30,078 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:41:30,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:41:30,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1112187985, now seen corresponding path program 1 times [2021-03-25 22:41:30,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:41:30,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985677839] [2021-03-25 22:41:30,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:41:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:41:30,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:30,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 22:41:30,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:30,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:41:30,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:30,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 22:41:30,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:30,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:41:30,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:30,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:41:30,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:30,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 22:41:30,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:30,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:41:30,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:30,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:41:30,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:30,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:41:30,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:30,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:41:30,183 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 22:41:30,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985677839] [2021-03-25 22:41:30,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:41:30,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 22:41:30,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822295320] [2021-03-25 22:41:30,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 22:41:30,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:41:30,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 22:41:30,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-03-25 22:41:30,186 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 358 [2021-03-25 22:41:30,187 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 179 transitions, 3192 flow. Second operand has 11 states, 11 states have (on average 188.63636363636363) internal successors, (2075), 11 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:30,187 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:41:30,187 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 358 [2021-03-25 22:41:30,187 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:41:31,324 INFO L129 PetriNetUnfolder]: 6774/10619 cut-off events. [2021-03-25 22:41:31,325 INFO L130 PetriNetUnfolder]: For 217349/217350 co-relation queries the response was YES. [2021-03-25 22:41:31,363 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57377 conditions, 10619 events. 6774/10619 cut-off events. For 217349/217350 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 70331 event pairs, 1529 based on Foata normal form. 145/8195 useless extension candidates. Maximal degree in co-relation 54941. Up to 6175 conditions per place. [2021-03-25 22:41:31,385 INFO L132 encePairwiseOnDemand]: 351/358 looper letters, 119 selfloop transitions, 8 changer transitions 52/206 dead transitions. [2021-03-25 22:41:31,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 206 transitions, 4074 flow [2021-03-25 22:41:31,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 22:41:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 22:41:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1368 transitions. [2021-03-25 22:41:31,387 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5458898643256185 [2021-03-25 22:41:31,387 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1368 transitions. [2021-03-25 22:41:31,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1368 transitions. [2021-03-25 22:41:31,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:41:31,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1368 transitions. [2021-03-25 22:41:31,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 195.42857142857142) internal successors, (1368), 7 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:31,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:31,389 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:31,389 INFO L185 Difference]: Start difference. First operand has 155 places, 179 transitions, 3192 flow. Second operand 7 states and 1368 transitions. [2021-03-25 22:41:31,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 206 transitions, 4074 flow [2021-03-25 22:41:31,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 206 transitions, 3881 flow, removed 33 selfloop flow, removed 11 redundant places. [2021-03-25 22:41:31,559 INFO L241 Difference]: Finished difference. Result has 152 places, 151 transitions, 2583 flow [2021-03-25 22:41:31,560 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=2813, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2583, PETRI_PLACES=152, PETRI_TRANSITIONS=151} [2021-03-25 22:41:31,560 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 88 predicate places. [2021-03-25 22:41:31,560 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:41:31,560 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 151 transitions, 2583 flow [2021-03-25 22:41:31,560 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 151 transitions, 2583 flow [2021-03-25 22:41:31,561 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 139 places, 151 transitions, 2583 flow [2021-03-25 22:41:31,692 INFO L129 PetriNetUnfolder]: 1296/2622 cut-off events. [2021-03-25 22:41:31,692 INFO L130 PetriNetUnfolder]: For 25466/25488 co-relation queries the response was YES. [2021-03-25 22:41:31,704 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9112 conditions, 2622 events. 1296/2622 cut-off events. For 25466/25488 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 18892 event pairs, 8 based on Foata normal form. 10/1867 useless extension candidates. Maximal degree in co-relation 8906. Up to 692 conditions per place. [2021-03-25 22:41:31,721 INFO L142 LiptonReduction]: Number of co-enabled transitions 1934 [2021-03-25 22:41:31,910 INFO L154 LiptonReduction]: Checked pairs total: 24 [2021-03-25 22:41:31,910 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 22:41:31,910 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 350 [2021-03-25 22:41:31,911 INFO L480 AbstractCegarLoop]: Abstraction has has 138 places, 150 transitions, 2563 flow [2021-03-25 22:41:31,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 188.63636363636363) internal successors, (2075), 11 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:31,911 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:41:31,911 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] [2021-03-25 22:41:31,911 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-03-25 22:41:31,911 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:41:31,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:41:31,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2005765651, now seen corresponding path program 2 times [2021-03-25 22:41:31,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:41:31,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460356528] [2021-03-25 22:41:31,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:41:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:41:31,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:31,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 22:41:31,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:31,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 22:41:31,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:31,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 22:41:31,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:31,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 22:41:32,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:32,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:41:32,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:32,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:41:32,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:32,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 22:41:32,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:32,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 22:41:32,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:32,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:41:32,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:32,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:41:32,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:32,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:41:32,095 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 22:41:32,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460356528] [2021-03-25 22:41:32,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:41:32,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 22:41:32,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504768109] [2021-03-25 22:41:32,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 22:41:32,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:41:32,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 22:41:32,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-03-25 22:41:32,098 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 359 [2021-03-25 22:41:32,099 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 150 transitions, 2563 flow. Second operand has 11 states, 11 states have (on average 187.63636363636363) internal successors, (2064), 11 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:32,099 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:41:32,099 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 359 [2021-03-25 22:41:32,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:41:33,064 INFO L129 PetriNetUnfolder]: 4273/6806 cut-off events. [2021-03-25 22:41:33,064 INFO L130 PetriNetUnfolder]: For 151540/151541 co-relation queries the response was YES. [2021-03-25 22:41:33,096 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40375 conditions, 6806 events. 4273/6806 cut-off events. For 151540/151541 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 43757 event pairs, 962 based on Foata normal form. 145/5451 useless extension candidates. Maximal degree in co-relation 39636. Up to 4010 conditions per place. [2021-03-25 22:41:33,104 INFO L132 encePairwiseOnDemand]: 347/359 looper letters, 63 selfloop transitions, 21 changer transitions 70/181 dead transitions. [2021-03-25 22:41:33,105 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 181 transitions, 3525 flow [2021-03-25 22:41:33,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 22:41:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 22:41:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2104 transitions. [2021-03-25 22:41:33,106 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5327931121802988 [2021-03-25 22:41:33,106 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2104 transitions. [2021-03-25 22:41:33,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2104 transitions. [2021-03-25 22:41:33,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:41:33,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2104 transitions. [2021-03-25 22:41:33,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 191.27272727272728) internal successors, (2104), 11 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 22:41:33,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 359.0) internal successors, (4308), 12 states have internal predecessors, (4308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:33,110 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 359.0) internal successors, (4308), 12 states have internal predecessors, (4308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:33,110 INFO L185 Difference]: Start difference. First operand has 138 places, 150 transitions, 2563 flow. Second operand 11 states and 2104 transitions. [2021-03-25 22:41:33,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 181 transitions, 3525 flow [2021-03-25 22:41:33,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 181 transitions, 3303 flow, removed 20 selfloop flow, removed 19 redundant places. [2021-03-25 22:41:33,270 INFO L241 Difference]: Finished difference. Result has 132 places, 109 transitions, 1465 flow [2021-03-25 22:41:33,270 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=2291, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1465, PETRI_PLACES=132, PETRI_TRANSITIONS=109} [2021-03-25 22:41:33,270 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 68 predicate places. [2021-03-25 22:41:33,270 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:41:33,270 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 109 transitions, 1465 flow [2021-03-25 22:41:33,271 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 109 transitions, 1465 flow [2021-03-25 22:41:33,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 109 transitions, 1465 flow [2021-03-25 22:41:33,331 INFO L129 PetriNetUnfolder]: 683/1358 cut-off events. [2021-03-25 22:41:33,331 INFO L130 PetriNetUnfolder]: For 7635/7665 co-relation queries the response was YES. [2021-03-25 22:41:33,335 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3992 conditions, 1358 events. 683/1358 cut-off events. For 7635/7665 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 8313 event pairs, 6 based on Foata normal form. 8/909 useless extension candidates. Maximal degree in co-relation 3473. Up to 404 conditions per place. [2021-03-25 22:41:33,342 INFO L142 LiptonReduction]: Number of co-enabled transitions 1320 [2021-03-25 22:41:33,345 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:41:33,345 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:41:33,345 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 75 [2021-03-25 22:41:33,346 INFO L480 AbstractCegarLoop]: Abstraction has has 129 places, 109 transitions, 1465 flow [2021-03-25 22:41:33,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 187.63636363636363) internal successors, (2064), 11 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:33,346 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:41:33,346 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] [2021-03-25 22:41:33,346 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-03-25 22:41:33,346 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:41:33,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:41:33,347 INFO L82 PathProgramCache]: Analyzing trace with hash 822123527, now seen corresponding path program 1 times [2021-03-25 22:41:33,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:41:33,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74229951] [2021-03-25 22:41:33,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:41:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:41:33,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:33,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 22:41:33,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:33,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 22:41:33,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:33,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:41:33,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:33,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 22:41:33,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:33,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 22:41:33,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:33,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 22:41:33,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:33,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:41:33,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:33,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:41:33,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:33,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:41:33,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:33,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 22:41:33,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:33,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:41:33,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:33,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:41:33,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 22:41:33,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74229951] [2021-03-25 22:41:33,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:41:33,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 22:41:33,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855255390] [2021-03-25 22:41:33,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 22:41:33,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:41:33,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 22:41:33,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-03-25 22:41:33,489 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 359 [2021-03-25 22:41:33,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 109 transitions, 1465 flow. Second operand has 12 states, 12 states have (on average 185.5) internal successors, (2226), 12 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:33,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:41:33,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 359 [2021-03-25 22:41:33,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:41:34,036 INFO L129 PetriNetUnfolder]: 2549/4115 cut-off events. [2021-03-25 22:41:34,036 INFO L130 PetriNetUnfolder]: For 68868/68869 co-relation queries the response was YES. [2021-03-25 22:41:34,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23279 conditions, 4115 events. 2549/4115 cut-off events. For 68868/68869 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 25436 event pairs, 526 based on Foata normal form. 85/3292 useless extension candidates. Maximal degree in co-relation 16982. Up to 2088 conditions per place. [2021-03-25 22:41:34,058 INFO L132 encePairwiseOnDemand]: 346/359 looper letters, 75 selfloop transitions, 11 changer transitions 35/148 dead transitions. [2021-03-25 22:41:34,058 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 148 transitions, 2348 flow [2021-03-25 22:41:34,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 22:41:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 22:41:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1339 transitions. [2021-03-25 22:41:34,059 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5328292877039396 [2021-03-25 22:41:34,059 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1339 transitions. [2021-03-25 22:41:34,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1339 transitions. [2021-03-25 22:41:34,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:41:34,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1339 transitions. [2021-03-25 22:41:34,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 191.28571428571428) internal successors, (1339), 7 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:34,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 359.0) internal successors, (2872), 8 states have internal predecessors, (2872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:34,062 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 359.0) internal successors, (2872), 8 states have internal predecessors, (2872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:34,062 INFO L185 Difference]: Start difference. First operand has 129 places, 109 transitions, 1465 flow. Second operand 7 states and 1339 transitions. [2021-03-25 22:41:34,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 148 transitions, 2348 flow [2021-03-25 22:41:34,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 148 transitions, 2022 flow, removed 66 selfloop flow, removed 14 redundant places. [2021-03-25 22:41:34,127 INFO L241 Difference]: Finished difference. Result has 123 places, 104 transitions, 1208 flow [2021-03-25 22:41:34,127 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1208, PETRI_PLACES=123, PETRI_TRANSITIONS=104} [2021-03-25 22:41:34,127 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 59 predicate places. [2021-03-25 22:41:34,127 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:41:34,127 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 104 transitions, 1208 flow [2021-03-25 22:41:34,128 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 104 transitions, 1208 flow [2021-03-25 22:41:34,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 104 transitions, 1208 flow [2021-03-25 22:41:34,193 INFO L129 PetriNetUnfolder]: 719/1454 cut-off events. [2021-03-25 22:41:34,194 INFO L130 PetriNetUnfolder]: For 5043/5043 co-relation queries the response was YES. [2021-03-25 22:41:34,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3607 conditions, 1454 events. 719/1454 cut-off events. For 5043/5043 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 9235 event pairs, 4 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 3032. Up to 428 conditions per place. [2021-03-25 22:41:34,204 INFO L142 LiptonReduction]: Number of co-enabled transitions 1200 [2021-03-25 22:41:34,206 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:41:34,206 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:41:34,206 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 79 [2021-03-25 22:41:34,207 INFO L480 AbstractCegarLoop]: Abstraction has has 120 places, 104 transitions, 1208 flow [2021-03-25 22:41:34,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 185.5) internal successors, (2226), 12 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:34,207 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:41:34,207 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] [2021-03-25 22:41:34,208 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-03-25 22:41:34,208 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-25 22:41:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:41:34,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1216579531, now seen corresponding path program 2 times [2021-03-25 22:41:34,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:41:34,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818556353] [2021-03-25 22:41:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:41:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:41:34,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:34,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 22:41:34,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:34,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 22:41:34,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:34,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 22:41:34,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:34,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 22:41:34,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:34,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 22:41:34,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:34,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 22:41:34,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:34,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 22:41:34,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:34,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 22:41:34,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:34,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:41:34,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:34,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:41:34,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:34,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:41:34,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:41:34,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:41:34,349 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 22:41:34,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818556353] [2021-03-25 22:41:34,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:41:34,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 22:41:34,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25147649] [2021-03-25 22:41:34,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 22:41:34,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:41:34,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 22:41:34,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-03-25 22:41:34,351 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 359 [2021-03-25 22:41:34,352 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 104 transitions, 1208 flow. Second operand has 12 states, 12 states have (on average 185.5) internal successors, (2226), 12 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:34,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:41:34,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 359 [2021-03-25 22:41:34,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:41:34,681 INFO L129 PetriNetUnfolder]: 1177/2097 cut-off events. [2021-03-25 22:41:34,681 INFO L130 PetriNetUnfolder]: For 21374/21375 co-relation queries the response was YES. [2021-03-25 22:41:34,686 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9257 conditions, 2097 events. 1177/2097 cut-off events. For 21374/21375 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 12359 event pairs, 228 based on Foata normal form. 207/1824 useless extension candidates. Maximal degree in co-relation 9232. Up to 883 conditions per place. [2021-03-25 22:41:34,687 INFO L132 encePairwiseOnDemand]: 352/359 looper letters, 0 selfloop transitions, 0 changer transitions 119/119 dead transitions. [2021-03-25 22:41:34,687 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 1644 flow [2021-03-25 22:41:34,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 22:41:34,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 22:41:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1324 transitions. [2021-03-25 22:41:34,689 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5268603263032232 [2021-03-25 22:41:34,689 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1324 transitions. [2021-03-25 22:41:34,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1324 transitions. [2021-03-25 22:41:34,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:41:34,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1324 transitions. [2021-03-25 22:41:34,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 189.14285714285714) internal successors, (1324), 7 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:34,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 359.0) internal successors, (2872), 8 states have internal predecessors, (2872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:34,691 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 359.0) internal successors, (2872), 8 states have internal predecessors, (2872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:34,691 INFO L185 Difference]: Start difference. First operand has 120 places, 104 transitions, 1208 flow. Second operand 7 states and 1324 transitions. [2021-03-25 22:41:34,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 1644 flow [2021-03-25 22:41:34,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 119 transitions, 1441 flow, removed 31 selfloop flow, removed 11 redundant places. [2021-03-25 22:41:34,703 INFO L241 Difference]: Finished difference. Result has 109 places, 0 transitions, 0 flow [2021-03-25 22:41:34,703 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=109, PETRI_TRANSITIONS=0} [2021-03-25 22:41:34,703 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 45 predicate places. [2021-03-25 22:41:34,703 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:41:34,704 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 0 transitions, 0 flow [2021-03-25 22:41:34,704 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 0 transitions, 0 flow [2021-03-25 22:41:34,704 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2021-03-25 22:41:34,704 INFO L129 PetriNetUnfolder]: 0/0 cut-off events. [2021-03-25 22:41:34,704 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 22:41:34,704 INFO L84 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2021-03-25 22:41:34,704 INFO L142 LiptonReduction]: Number of co-enabled transitions 0 [2021-03-25 22:41:34,704 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:41:34,704 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:41:34,704 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1 [2021-03-25 22:41:34,705 INFO L480 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2021-03-25 22:41:34,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 185.5) internal successors, (2226), 12 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:41:34,705 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-03-25 22:41:34,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 10:41:34 BasicIcfg [2021-03-25 22:41:34,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 22:41:34,709 INFO L168 Benchmark]: Toolchain (without parser) took 185678.32 ms. Allocated memory was 255.9 MB in the beginning and 15.9 GB in the end (delta: 15.6 GB). Free memory was 234.8 MB in the beginning and 13.1 GB in the end (delta: -12.9 GB). Peak memory consumption was 2.8 GB. Max. memory is 16.0 GB. [2021-03-25 22:41:34,709 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 22:41:34,709 INFO L168 Benchmark]: CACSL2BoogieTranslator took 662.06 ms. Allocated memory was 255.9 MB in the beginning and 388.0 MB in the end (delta: 132.1 MB). Free memory was 234.4 MB in the beginning and 348.1 MB in the end (delta: -113.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 16.0 GB. [2021-03-25 22:41:34,709 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.21 ms. Allocated memory is still 388.0 MB. Free memory was 348.1 MB in the beginning and 345.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 22:41:34,710 INFO L168 Benchmark]: Boogie Preprocessor took 37.88 ms. Allocated memory is still 388.0 MB. Free memory was 345.5 MB in the beginning and 344.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 22:41:34,710 INFO L168 Benchmark]: RCFGBuilder took 440.74 ms. Allocated memory is still 388.0 MB. Free memory was 344.0 MB in the beginning and 368.5 MB in the end (delta: -24.5 MB). Peak memory consumption was 29.2 MB. Max. memory is 16.0 GB. [2021-03-25 22:41:34,710 INFO L168 Benchmark]: TraceAbstraction took 184470.39 ms. Allocated memory was 388.0 MB in the beginning and 15.9 GB in the end (delta: 15.5 GB). Free memory was 368.5 MB in the beginning and 13.1 GB in the end (delta: -12.7 GB). Peak memory consumption was 2.8 GB. Max. memory is 16.0 GB. [2021-03-25 22:41:34,710 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.47 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 662.06 ms. Allocated memory was 255.9 MB in the beginning and 388.0 MB in the end (delta: 132.1 MB). Free memory was 234.4 MB in the beginning and 348.1 MB in the end (delta: -113.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 62.21 ms. Allocated memory is still 388.0 MB. Free memory was 348.1 MB in the beginning and 345.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 37.88 ms. Allocated memory is still 388.0 MB. Free memory was 345.5 MB in the beginning and 344.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 440.74 ms. Allocated memory is still 388.0 MB. Free memory was 344.0 MB in the beginning and 368.5 MB in the end (delta: -24.5 MB). Peak memory consumption was 29.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 184470.39 ms. Allocated memory was 388.0 MB in the beginning and 15.9 GB in the end (delta: 15.5 GB). Free memory was 368.5 MB in the beginning and 13.1 GB in the end (delta: -12.7 GB). Peak memory consumption was 2.8 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2180.0ms, 125 PlacesBefore, 64 PlacesAfterwards, 147 TransitionsBefore, 85 TransitionsAfterwards, 4982 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, 2660 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2309, positive: 2302, positive conditional: 2302, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2161, positive: 2154, positive conditional: 0, positive unconditional: 2154, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2161, positive: 2154, positive conditional: 0, positive unconditional: 2154, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2161, positive: 2152, positive conditional: 0, positive unconditional: 2152, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2309, positive: 148, positive conditional: 148, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2161, unknown conditional: 2161, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 36, Positive conditional cache size: 36, 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: 1359.1ms, 62 PlacesBefore, 50 PlacesAfterwards, 86 TransitionsBefore, 75 TransitionsAfterwards, 1484 CoEnabledTransitionPairs, 4 FixpointIterations, 2 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 323 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 246, positive: 244, positive conditional: 244, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 235, positive: 234, positive conditional: 3, positive unconditional: 231, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 235, positive: 234, positive conditional: 3, positive unconditional: 231, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 235, positive: 234, positive conditional: 0, positive unconditional: 234, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 246, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 235, unknown conditional: 235, 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: 34.7ms, 54 PlacesBefore, 54 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1154 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.5ms, 61 PlacesBefore, 61 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 1222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 271.0ms, 67 PlacesBefore, 67 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 1914 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 229.4ms, 76 PlacesBefore, 76 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 1902 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 243.5ms, 81 PlacesBefore, 79 PlacesAfterwards, 114 TransitionsBefore, 114 TransitionsAfterwards, 2076 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 263.0ms, 80 PlacesBefore, 80 PlacesAfterwards, 123 TransitionsBefore, 123 TransitionsAfterwards, 2306 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 250.8ms, 88 PlacesBefore, 86 PlacesAfterwards, 111 TransitionsBefore, 111 TransitionsAfterwards, 2184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 290.6ms, 90 PlacesBefore, 90 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 2450 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 365.5ms, 104 PlacesBefore, 104 PlacesAfterwards, 162 TransitionsBefore, 162 TransitionsAfterwards, 2610 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 422.4ms, 115 PlacesBefore, 115 PlacesAfterwards, 139 TransitionsBefore, 139 TransitionsAfterwards, 2490 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 375.7ms, 118 PlacesBefore, 118 PlacesAfterwards, 154 TransitionsBefore, 154 TransitionsAfterwards, 2714 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 396.5ms, 121 PlacesBefore, 121 PlacesAfterwards, 158 TransitionsBefore, 158 TransitionsAfterwards, 2740 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 572.2ms, 129 PlacesBefore, 129 PlacesAfterwards, 167 TransitionsBefore, 167 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 564.4ms, 137 PlacesBefore, 137 PlacesAfterwards, 193 TransitionsBefore, 193 TransitionsAfterwards, 2942 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 595.1ms, 142 PlacesBefore, 142 PlacesAfterwards, 188 TransitionsBefore, 188 TransitionsAfterwards, 2736 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 692.9ms, 147 PlacesBefore, 147 PlacesAfterwards, 223 TransitionsBefore, 223 TransitionsAfterwards, 3622 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 734.0ms, 152 PlacesBefore, 152 PlacesAfterwards, 227 TransitionsBefore, 227 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 842.9ms, 159 PlacesBefore, 159 PlacesAfterwards, 232 TransitionsBefore, 232 TransitionsAfterwards, 3908 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 977.9ms, 163 PlacesBefore, 163 PlacesAfterwards, 242 TransitionsBefore, 242 TransitionsAfterwards, 4044 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 976.6ms, 169 PlacesBefore, 169 PlacesAfterwards, 249 TransitionsBefore, 249 TransitionsAfterwards, 4090 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1050.5ms, 177 PlacesBefore, 177 PlacesAfterwards, 260 TransitionsBefore, 260 TransitionsAfterwards, 4276 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 940.1ms, 184 PlacesBefore, 184 PlacesAfterwards, 258 TransitionsBefore, 258 TransitionsAfterwards, 4178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 994.7ms, 185 PlacesBefore, 185 PlacesAfterwards, 260 TransitionsBefore, 260 TransitionsAfterwards, 4146 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 984.1ms, 189 PlacesBefore, 189 PlacesAfterwards, 268 TransitionsBefore, 268 TransitionsAfterwards, 4268 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1125.7ms, 192 PlacesBefore, 192 PlacesAfterwards, 272 TransitionsBefore, 272 TransitionsAfterwards, 4382 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1155.6ms, 199 PlacesBefore, 199 PlacesAfterwards, 283 TransitionsBefore, 283 TransitionsAfterwards, 4510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1112.4ms, 205 PlacesBefore, 205 PlacesAfterwards, 275 TransitionsBefore, 275 TransitionsAfterwards, 4436 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1042.2ms, 206 PlacesBefore, 206 PlacesAfterwards, 250 TransitionsBefore, 250 TransitionsAfterwards, 4152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1067.6ms, 209 PlacesBefore, 209 PlacesAfterwards, 253 TransitionsBefore, 253 TransitionsAfterwards, 4048 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1048.7ms, 211 PlacesBefore, 211 PlacesAfterwards, 267 TransitionsBefore, 267 TransitionsAfterwards, 4048 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1259.3ms, 211 PlacesBefore, 211 PlacesAfterwards, 283 TransitionsBefore, 283 TransitionsAfterwards, 4326 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1094.0ms, 219 PlacesBefore, 219 PlacesAfterwards, 289 TransitionsBefore, 289 TransitionsAfterwards, 4220 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1188.0ms, 208 PlacesBefore, 208 PlacesAfterwards, 279 TransitionsBefore, 279 TransitionsAfterwards, 3754 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1095.9ms, 212 PlacesBefore, 212 PlacesAfterwards, 293 TransitionsBefore, 293 TransitionsAfterwards, 3888 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 704.5ms, 214 PlacesBefore, 199 PlacesAfterwards, 270 TransitionsBefore, 270 TransitionsAfterwards, 3612 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 567.5ms, 193 PlacesBefore, 184 PlacesAfterwards, 246 TransitionsBefore, 246 TransitionsAfterwards, 3428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 686.1ms, 181 PlacesBefore, 171 PlacesAfterwards, 223 TransitionsBefore, 223 TransitionsAfterwards, 3240 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 356.1ms, 168 PlacesBefore, 160 PlacesAfterwards, 204 TransitionsBefore, 204 TransitionsAfterwards, 3042 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 364.6ms, 159 PlacesBefore, 157 PlacesAfterwards, 206 TransitionsBefore, 206 TransitionsAfterwards, 3126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 745.8ms, 163 PlacesBefore, 159 PlacesAfterwards, 240 TransitionsBefore, 240 TransitionsAfterwards, 3422 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 638.0ms, 165 PlacesBefore, 165 PlacesAfterwards, 240 TransitionsBefore, 240 TransitionsAfterwards, 3380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 389.1ms, 162 PlacesBefore, 161 PlacesAfterwards, 196 TransitionsBefore, 196 TransitionsAfterwards, 2710 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2234.2ms, 155 PlacesBefore, 155 PlacesAfterwards, 179 TransitionsBefore, 179 TransitionsAfterwards, 2396 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 240 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 240, positive: 240, positive conditional: 240, 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: 96, positive: 96, positive conditional: 96, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 96, positive: 96, positive conditional: 96, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 96, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83, positive: 83, positive conditional: 83, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 240, positive: 144, positive conditional: 144, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 96, unknown conditional: 96, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 24, 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: 350.0ms, 152 PlacesBefore, 138 PlacesAfterwards, 151 TransitionsBefore, 150 TransitionsAfterwards, 1934 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 24 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 24, positive conditional: 24, 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: 24, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 24, unknown conditional: 24, 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: 74.6ms, 132 PlacesBefore, 129 PlacesAfterwards, 109 TransitionsBefore, 109 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 78.8ms, 123 PlacesBefore, 120 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 1200 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5ms, 109 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - PositiveResult [Line: 1123]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 11.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 184171.3ms, OverallIterations: 48, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 142831.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2315.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1263 SDtfs, 2482 SDslu, 2804 SDs, 0 SdLazy, 11559 SolverSat, 1127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6253.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 622 GetRequests, 50 SyntacticMatches, 16 SemanticMatches, 556 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 10125.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=6271occurred in iteration=35, InterpolantAutomatonStates: 405, 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: 83.7ms SsaConstructionTime, 410.1ms SatisfiabilityAnalysisTime, 5231.9ms InterpolantComputationTime, 923 NumberOfCodeBlocks, 923 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 875 ConstructedInterpolants, 0 QuantifiedInterpolants, 13341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...