/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:52:39,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:52:39,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:52:39,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:52:39,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:52:39,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:52:39,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:52:39,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:52:39,378 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:52:39,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:52:39,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:52:39,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:52:39,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:52:39,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:52:39,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:52:39,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:52:39,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:52:39,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:52:39,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:52:39,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:52:39,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:52:39,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:52:39,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:52:39,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:52:39,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:52:39,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:52:39,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:52:39,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:52:39,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:52:39,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:52:39,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:52:39,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:52:39,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:52:39,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:52:39,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:52:39,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:52:39,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:52:39,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:52:39,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:52:39,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:52:39,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:52:39,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 14:52:39,468 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:52:39,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:52:39,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:52:39,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:52:39,472 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:52:39,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:52:39,472 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:52:39,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:52:39,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:52:39,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:52:39,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:52:39,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:52:39,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:52:39,474 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:52:39,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:52:39,474 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:52:39,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:52:39,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:52:39,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:52:39,475 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:52:39,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:52:39,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:52:39,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:52:39,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:52:39,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:52:39,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:52:39,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:52:39,476 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:52:39,476 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:52:39,476 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 14:52:39,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:52:39,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:52:39,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:52:39,787 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:52:39,788 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:52:39,789 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i [2021-03-25 14:52:39,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5a6eaa89/fef09452553f4f29b2dcc37f11a2469c/FLAGbd3c8a18f [2021-03-25 14:52:40,389 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:52:40,390 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i [2021-03-25 14:52:40,409 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5a6eaa89/fef09452553f4f29b2dcc37f11a2469c/FLAGbd3c8a18f [2021-03-25 14:52:40,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5a6eaa89/fef09452553f4f29b2dcc37f11a2469c [2021-03-25 14:52:40,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:52:40,700 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:52:40,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:52:40,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:52:40,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:52:40,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:52:40" (1/1) ... [2021-03-25 14:52:40,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c2f8fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:40, skipping insertion in model container [2021-03-25 14:52:40,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:52:40" (1/1) ... [2021-03-25 14:52:40,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:52:40,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:52:40,913 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-wmm/safe011_rmo.opt.i[949,962] [2021-03-25 14:52:41,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:52:41,147 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:52:41,162 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-wmm/safe011_rmo.opt.i[949,962] [2021-03-25 14:52:41,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:52:41,289 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:52:41,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:41 WrapperNode [2021-03-25 14:52:41,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:52:41,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:52:41,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:52:41,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:52:41,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:41" (1/1) ... [2021-03-25 14:52:41,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:41" (1/1) ... [2021-03-25 14:52:41,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:52:41,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:52:41,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:52:41,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:52:41,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:41" (1/1) ... [2021-03-25 14:52:41,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:41" (1/1) ... [2021-03-25 14:52:41,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:41" (1/1) ... [2021-03-25 14:52:41,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:41" (1/1) ... [2021-03-25 14:52:41,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:41" (1/1) ... [2021-03-25 14:52:41,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:41" (1/1) ... [2021-03-25 14:52:41,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:41" (1/1) ... [2021-03-25 14:52:41,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:52:41,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:52:41,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:52:41,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:52:41,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:41" (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 14:52:41,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:52:41,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:52:41,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:52:41,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:52:41,456 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:52:41,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:52:41,456 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:52:41,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:52:41,456 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:52:41,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:52:41,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:52:41,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:52:41,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:52:41,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:52:41,459 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 14:52:43,470 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:52:43,471 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:52:43,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:52:43 BoogieIcfgContainer [2021-03-25 14:52:43,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:52:43,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:52:43,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:52:43,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:52:43,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:52:40" (1/3) ... [2021-03-25 14:52:43,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f00e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:52:43, skipping insertion in model container [2021-03-25 14:52:43,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:41" (2/3) ... [2021-03-25 14:52:43,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f00e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:52:43, skipping insertion in model container [2021-03-25 14:52:43,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:52:43" (3/3) ... [2021-03-25 14:52:43,479 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_rmo.opt.i [2021-03-25 14:52:43,484 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:52:43,488 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:52:43,489 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:52:43,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,517 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,517 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,519 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,519 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,523 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,523 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,523 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,524 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,527 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,527 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,527 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,528 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,528 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,532 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,533 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,536 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,536 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,539 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,540 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,540 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:43,541 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:52:43,557 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 14:52:43,574 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:52:43,574 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:52:43,574 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:52:43,574 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:52:43,574 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:52:43,574 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:52:43,574 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:52:43,575 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:52:43,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-25 14:52:43,615 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-25 14:52:43,615 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:43,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 14:52:43,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-25 14:52:43,622 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-25 14:52:43,623 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:43,633 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-25 14:52:43,636 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-25 14:52:43,638 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-25 14:52:43,654 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-25 14:52:43,654 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:43,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 14:52:43,658 INFO L142 LiptonReduction]: Number of co-enabled transitions 1694 [2021-03-25 14:52:45,297 WARN L205 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-03-25 14:52:45,616 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-25 14:52:46,936 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-25 14:52:47,517 WARN L205 SmtUtils]: Spent 577.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 14:52:47,757 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:52:48,202 WARN L205 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 14:52:48,338 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:52:49,353 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 14:52:49,640 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 14:52:50,222 WARN L205 SmtUtils]: Spent 580.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 14:52:50,761 WARN L205 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 14:52:51,007 INFO L154 LiptonReduction]: Checked pairs total: 3065 [2021-03-25 14:52:51,007 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-25 14:52:51,009 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7386 [2021-03-25 14:52:51,020 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2021-03-25 14:52:51,020 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:51,020 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:51,021 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:51,021 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:51,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:51,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1571617397, now seen corresponding path program 1 times [2021-03-25 14:52:51,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:51,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296122419] [2021-03-25 14:52:51,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:51,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:51,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:51,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:51,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:51,215 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 14:52:51,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296122419] [2021-03-25 14:52:51,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:51,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:52:51,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219846502] [2021-03-25 14:52:51,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:52:51,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:51,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:52:51,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:52:51,236 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 161 [2021-03-25 14:52:51,238 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:51,238 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:51,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 161 [2021-03-25 14:52:51,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:51,360 INFO L129 PetriNetUnfolder]: 69/200 cut-off events. [2021-03-25 14:52:51,360 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:51,362 INFO L84 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 200 events. 69/200 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 953 event pairs, 54 based on Foata normal form. 11/193 useless extension candidates. Maximal degree in co-relation 309. Up to 89 conditions per place. [2021-03-25 14:52:51,363 INFO L132 encePairwiseOnDemand]: 157/161 looper letters, 9 selfloop transitions, 2 changer transitions 5/41 dead transitions. [2021-03-25 14:52:51,364 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 117 flow [2021-03-25 14:52:51,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:52:51,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:52:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2021-03-25 14:52:51,381 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8964803312629399 [2021-03-25 14:52:51,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2021-03-25 14:52:51,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2021-03-25 14:52:51,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:51,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2021-03-25 14:52:51,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:51,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:51,400 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:51,401 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 433 transitions. [2021-03-25 14:52:51,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 117 flow [2021-03-25 14:52:51,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:52:51,406 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 74 flow [2021-03-25 14:52:51,407 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-03-25 14:52:51,407 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-25 14:52:51,408 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:51,408 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-25 14:52:51,409 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-25 14:52:51,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2021-03-25 14:52:51,415 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-25 14:52:51,415 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:51,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:52:51,417 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-25 14:52:52,088 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 14:52:52,388 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 14:52:53,431 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 266 DAG size of output: 265 [2021-03-25 14:52:53,993 WARN L205 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 14:52:54,414 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-03-25 14:52:54,607 INFO L154 LiptonReduction]: Checked pairs total: 942 [2021-03-25 14:52:54,607 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-25 14:52:54,607 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3199 [2021-03-25 14:52:54,608 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-25 14:52:54,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,609 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:54,609 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 14:52:54,609 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:52:54,609 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:54,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:54,610 INFO L82 PathProgramCache]: Analyzing trace with hash -72729481, now seen corresponding path program 1 times [2021-03-25 14:52:54,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:54,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906732700] [2021-03-25 14:52:54,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:54,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:54,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:54,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:54,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:54,783 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:52:54,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:52:54,787 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 14:52:54,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906732700] [2021-03-25 14:52:54,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:54,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:54,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258861544] [2021-03-25 14:52:54,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:54,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:54,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:54,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:54,791 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 169 [2021-03-25 14:52:54,792 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,792 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:54,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 169 [2021-03-25 14:52:54,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:54,808 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 14:52:54,809 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:54,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:52:54,809 INFO L132 encePairwiseOnDemand]: 166/169 looper letters, 1 selfloop transitions, 2 changer transitions 1/24 dead transitions. [2021-03-25 14:52:54,809 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 64 flow [2021-03-25 14:52:54,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:52:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:52:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2021-03-25 14:52:54,811 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8717948717948718 [2021-03-25 14:52:54,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2021-03-25 14:52:54,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2021-03-25 14:52:54,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:54,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2021-03-25 14:52:54,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,815 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 442 transitions. [2021-03-25 14:52:54,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 64 flow [2021-03-25 14:52:54,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:54,816 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 60 flow [2021-03-25 14:52:54,816 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-03-25 14:52:54,816 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-25 14:52:54,816 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:54,817 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-25 14:52:54,817 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-25 14:52:54,817 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow [2021-03-25 14:52:54,820 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-25 14:52:54,821 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:54,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:52:54,821 INFO L142 LiptonReduction]: Number of co-enabled transitions 214 [2021-03-25 14:52:55,272 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 14:52:55,410 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 14:52:55,659 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 14:52:55,782 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 14:52:55,784 INFO L154 LiptonReduction]: Checked pairs total: 777 [2021-03-25 14:52:55,784 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:52:55,785 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 969 [2021-03-25 14:52:55,786 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-25 14:52:55,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,786 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:55,786 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:55,786 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:52:55,787 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:55,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:55,787 INFO L82 PathProgramCache]: Analyzing trace with hash -721798440, now seen corresponding path program 1 times [2021-03-25 14:52:55,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:55,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023499470] [2021-03-25 14:52:55,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:55,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:55,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:55,871 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 14:52:55,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023499470] [2021-03-25 14:52:55,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:55,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:52:55,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179493260] [2021-03-25 14:52:55,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:52:55,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:55,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:52:55,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:52:55,874 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 171 [2021-03-25 14:52:55,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:55,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 171 [2021-03-25 14:52:55,874 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:55,887 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-25 14:52:55,888 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-25 14:52:55,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 33 events. 3/33 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-03-25 14:52:55,888 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 3 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2021-03-25 14:52:55,888 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 72 flow [2021-03-25 14:52:55,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:52:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:52:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2021-03-25 14:52:55,891 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8791423001949318 [2021-03-25 14:52:55,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2021-03-25 14:52:55,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2021-03-25 14:52:55,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:55,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2021-03-25 14:52:55,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,894 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 451 transitions. [2021-03-25 14:52:55,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 72 flow [2021-03-25 14:52:55,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:55,895 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 71 flow [2021-03-25 14:52:55,895 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2021-03-25 14:52:55,896 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -16 predicate places. [2021-03-25 14:52:55,896 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:55,896 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 23 transitions, 71 flow [2021-03-25 14:52:55,896 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 71 flow [2021-03-25 14:52:55,897 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 71 flow [2021-03-25 14:52:55,901 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-25 14:52:55,901 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 14:52:55,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 71 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2021-03-25 14:52:55,902 INFO L142 LiptonReduction]: Number of co-enabled transitions 240 [2021-03-25 14:52:55,904 INFO L154 LiptonReduction]: Checked pairs total: 230 [2021-03-25 14:52:55,904 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:55,904 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-03-25 14:52:55,905 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 71 flow [2021-03-25 14:52:55,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,905 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:55,906 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:55,906 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:52:55,906 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:55,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:55,906 INFO L82 PathProgramCache]: Analyzing trace with hash 452263556, now seen corresponding path program 1 times [2021-03-25 14:52:55,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:55,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042779886] [2021-03-25 14:52:55,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:55,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:55,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:55,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:55,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:55,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 14:52:55,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042779886] [2021-03-25 14:52:55,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:55,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:52:55,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459971844] [2021-03-25 14:52:55,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:55,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:55,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:55,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:55,969 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 171 [2021-03-25 14:52:55,970 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,970 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:55,970 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 171 [2021-03-25 14:52:55,970 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:55,999 INFO L129 PetriNetUnfolder]: 2/42 cut-off events. [2021-03-25 14:52:55,999 INFO L130 PetriNetUnfolder]: For 22/31 co-relation queries the response was YES. [2021-03-25 14:52:56,001 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 42 events. 2/42 cut-off events. For 22/31 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 4/45 useless extension candidates. Maximal degree in co-relation 67. Up to 8 conditions per place. [2021-03-25 14:52:56,001 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 2 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2021-03-25 14:52:56,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 84 flow [2021-03-25 14:52:56,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:52:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:52:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 587 transitions. [2021-03-25 14:52:56,004 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8581871345029239 [2021-03-25 14:52:56,004 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 587 transitions. [2021-03-25 14:52:56,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 587 transitions. [2021-03-25 14:52:56,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:56,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 587 transitions. [2021-03-25 14:52:56,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,008 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,008 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 71 flow. Second operand 4 states and 587 transitions. [2021-03-25 14:52:56,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 84 flow [2021-03-25 14:52:56,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 24 transitions, 81 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:52:56,010 INFO L241 Difference]: Finished difference. Result has 36 places, 24 transitions, 87 flow [2021-03-25 14:52:56,010 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2021-03-25 14:52:56,010 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -12 predicate places. [2021-03-25 14:52:56,010 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:56,010 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 24 transitions, 87 flow [2021-03-25 14:52:56,011 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 24 transitions, 87 flow [2021-03-25 14:52:56,011 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 24 transitions, 87 flow [2021-03-25 14:52:56,016 INFO L129 PetriNetUnfolder]: 2/42 cut-off events. [2021-03-25 14:52:56,016 INFO L130 PetriNetUnfolder]: For 23/29 co-relation queries the response was YES. [2021-03-25 14:52:56,016 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 42 events. 2/42 cut-off events. For 23/29 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 129 event pairs, 0 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 73. Up to 8 conditions per place. [2021-03-25 14:52:56,018 INFO L142 LiptonReduction]: Number of co-enabled transitions 248 [2021-03-25 14:52:56,020 INFO L154 LiptonReduction]: Checked pairs total: 243 [2021-03-25 14:52:56,020 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:56,020 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-25 14:52:56,024 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 87 flow [2021-03-25 14:52:56,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,024 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:56,025 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:56,025 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:52:56,025 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:56,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:56,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1388593770, now seen corresponding path program 1 times [2021-03-25 14:52:56,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:56,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416984839] [2021-03-25 14:52:56,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:56,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:52:56,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:56,125 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 14:52:56,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416984839] [2021-03-25 14:52:56,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:56,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:52:56,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450006339] [2021-03-25 14:52:56,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:52:56,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:56,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:52:56,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:52:56,127 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 171 [2021-03-25 14:52:56,128 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,128 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:56,128 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 171 [2021-03-25 14:52:56,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:56,200 INFO L129 PetriNetUnfolder]: 154/325 cut-off events. [2021-03-25 14:52:56,200 INFO L130 PetriNetUnfolder]: For 334/389 co-relation queries the response was YES. [2021-03-25 14:52:56,204 INFO L84 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 325 events. 154/325 cut-off events. For 334/389 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1692 event pairs, 116 based on Foata normal form. 10/310 useless extension candidates. Maximal degree in co-relation 691. Up to 244 conditions per place. [2021-03-25 14:52:56,206 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 9 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2021-03-25 14:52:56,206 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 28 transitions, 119 flow [2021-03-25 14:52:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:52:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:52:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2021-03-25 14:52:56,212 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8031189083820662 [2021-03-25 14:52:56,212 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2021-03-25 14:52:56,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2021-03-25 14:52:56,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:56,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2021-03-25 14:52:56,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,217 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,217 INFO L185 Difference]: Start difference. First operand has 36 places, 24 transitions, 87 flow. Second operand 3 states and 412 transitions. [2021-03-25 14:52:56,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 28 transitions, 119 flow [2021-03-25 14:52:56,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 115 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:56,220 INFO L241 Difference]: Finished difference. Result has 37 places, 26 transitions, 102 flow [2021-03-25 14:52:56,220 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2021-03-25 14:52:56,221 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -11 predicate places. [2021-03-25 14:52:56,221 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:56,221 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 26 transitions, 102 flow [2021-03-25 14:52:56,222 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 102 flow [2021-03-25 14:52:56,222 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 102 flow [2021-03-25 14:52:56,231 INFO L129 PetriNetUnfolder]: 10/62 cut-off events. [2021-03-25 14:52:56,231 INFO L130 PetriNetUnfolder]: For 70/79 co-relation queries the response was YES. [2021-03-25 14:52:56,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 62 events. 10/62 cut-off events. For 70/79 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 239 event pairs, 2 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 129. Up to 17 conditions per place. [2021-03-25 14:52:56,232 INFO L142 LiptonReduction]: Number of co-enabled transitions 266 [2021-03-25 14:52:56,341 INFO L154 LiptonReduction]: Checked pairs total: 179 [2021-03-25 14:52:56,341 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:56,342 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 121 [2021-03-25 14:52:56,342 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 102 flow [2021-03-25 14:52:56,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,343 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:56,343 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:56,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:52:56,343 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:56,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:56,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2054710621, now seen corresponding path program 1 times [2021-03-25 14:52:56,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:56,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160252229] [2021-03-25 14:52:56,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:56,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:56,442 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-25 14:52:56,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 14:52:56,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:56,460 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 14:52:56,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160252229] [2021-03-25 14:52:56,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:56,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:52:56,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344377438] [2021-03-25 14:52:56,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:56,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:56,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:56,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:56,462 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 171 [2021-03-25 14:52:56,464 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,464 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:56,464 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 171 [2021-03-25 14:52:56,464 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:56,564 INFO L129 PetriNetUnfolder]: 154/321 cut-off events. [2021-03-25 14:52:56,564 INFO L130 PetriNetUnfolder]: For 537/623 co-relation queries the response was YES. [2021-03-25 14:52:56,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 321 events. 154/321 cut-off events. For 537/623 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1624 event pairs, 50 based on Foata normal form. 19/321 useless extension candidates. Maximal degree in co-relation 779. Up to 238 conditions per place. [2021-03-25 14:52:56,567 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 10 selfloop transitions, 6 changer transitions 0/32 dead transitions. [2021-03-25 14:52:56,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 148 flow [2021-03-25 14:52:56,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:52:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:52:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2021-03-25 14:52:56,570 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7850877192982456 [2021-03-25 14:52:56,570 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2021-03-25 14:52:56,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2021-03-25 14:52:56,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:56,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2021-03-25 14:52:56,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,574 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,574 INFO L185 Difference]: Start difference. First operand has 37 places, 26 transitions, 102 flow. Second operand 4 states and 537 transitions. [2021-03-25 14:52:56,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 148 flow [2021-03-25 14:52:56,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 145 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:52:56,579 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 131 flow [2021-03-25 14:52:56,579 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-03-25 14:52:56,580 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2021-03-25 14:52:56,580 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:56,580 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 131 flow [2021-03-25 14:52:56,580 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 131 flow [2021-03-25 14:52:56,580 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 131 flow [2021-03-25 14:52:56,603 INFO L129 PetriNetUnfolder]: 36/124 cut-off events. [2021-03-25 14:52:56,604 INFO L130 PetriNetUnfolder]: For 211/243 co-relation queries the response was YES. [2021-03-25 14:52:56,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 124 events. 36/124 cut-off events. For 211/243 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 589 event pairs, 11 based on Foata normal form. 2/114 useless extension candidates. Maximal degree in co-relation 326. Up to 60 conditions per place. [2021-03-25 14:52:56,605 INFO L142 LiptonReduction]: Number of co-enabled transitions 294 [2021-03-25 14:52:56,630 INFO L154 LiptonReduction]: Checked pairs total: 105 [2021-03-25 14:52:56,630 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:56,630 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 50 [2021-03-25 14:52:56,631 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 131 flow [2021-03-25 14:52:56,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,631 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:56,631 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:56,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:52:56,632 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:56,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:56,632 INFO L82 PathProgramCache]: Analyzing trace with hash -366050313, now seen corresponding path program 1 times [2021-03-25 14:52:56,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:56,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989215618] [2021-03-25 14:52:56,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:56,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:52:56,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:56,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:56,695 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 14:52:56,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989215618] [2021-03-25 14:52:56,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:56,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:52:56,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006537336] [2021-03-25 14:52:56,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:56,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:56,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:56,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:56,697 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 171 [2021-03-25 14:52:56,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,698 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:56,698 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 171 [2021-03-25 14:52:56,698 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:56,805 INFO L129 PetriNetUnfolder]: 170/389 cut-off events. [2021-03-25 14:52:56,806 INFO L130 PetriNetUnfolder]: For 689/854 co-relation queries the response was YES. [2021-03-25 14:52:56,807 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 389 events. 170/389 cut-off events. For 689/854 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2245 event pairs, 53 based on Foata normal form. 19/393 useless extension candidates. Maximal degree in co-relation 1046. Up to 230 conditions per place. [2021-03-25 14:52:56,809 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 11 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2021-03-25 14:52:56,809 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 183 flow [2021-03-25 14:52:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:52:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:52:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 558 transitions. [2021-03-25 14:52:56,812 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8157894736842105 [2021-03-25 14:52:56,812 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 558 transitions. [2021-03-25 14:52:56,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 558 transitions. [2021-03-25 14:52:56,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:56,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 558 transitions. [2021-03-25 14:52:56,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,815 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,815 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 131 flow. Second operand 4 states and 558 transitions. [2021-03-25 14:52:56,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 183 flow [2021-03-25 14:52:56,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 173 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:56,819 INFO L241 Difference]: Finished difference. Result has 42 places, 32 transitions, 159 flow [2021-03-25 14:52:56,819 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2021-03-25 14:52:56,819 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2021-03-25 14:52:56,819 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:56,819 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 159 flow [2021-03-25 14:52:56,819 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 159 flow [2021-03-25 14:52:56,820 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 159 flow [2021-03-25 14:52:56,844 INFO L129 PetriNetUnfolder]: 61/178 cut-off events. [2021-03-25 14:52:56,844 INFO L130 PetriNetUnfolder]: For 479/554 co-relation queries the response was YES. [2021-03-25 14:52:56,845 INFO L84 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 178 events. 61/178 cut-off events. For 479/554 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 908 event pairs, 16 based on Foata normal form. 1/162 useless extension candidates. Maximal degree in co-relation 529. Up to 82 conditions per place. [2021-03-25 14:52:56,847 INFO L142 LiptonReduction]: Number of co-enabled transitions 322 [2021-03-25 14:52:56,851 INFO L154 LiptonReduction]: Checked pairs total: 59 [2021-03-25 14:52:56,851 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:56,851 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-03-25 14:52:56,852 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 159 flow [2021-03-25 14:52:56,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,852 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:56,852 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:56,852 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:52:56,852 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:56,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:56,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1450930176, now seen corresponding path program 1 times [2021-03-25 14:52:56,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:56,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916598993] [2021-03-25 14:52:56,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:56,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 14:52:56,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:52:56,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 14:52:57,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:57,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:52:57,040 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 14:52:57,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916598993] [2021-03-25 14:52:57,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:57,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:52:57,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914295380] [2021-03-25 14:52:57,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:52:57,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:57,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:52:57,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:52:57,043 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 171 [2021-03-25 14:52:57,043 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,044 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:57,044 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 171 [2021-03-25 14:52:57,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:57,185 INFO L129 PetriNetUnfolder]: 174/387 cut-off events. [2021-03-25 14:52:57,185 INFO L130 PetriNetUnfolder]: For 904/1099 co-relation queries the response was YES. [2021-03-25 14:52:57,186 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1273 conditions, 387 events. 174/387 cut-off events. For 904/1099 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2220 event pairs, 42 based on Foata normal form. 31/402 useless extension candidates. Maximal degree in co-relation 1255. Up to 264 conditions per place. [2021-03-25 14:52:57,190 INFO L132 encePairwiseOnDemand]: 166/171 looper letters, 14 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2021-03-25 14:52:57,190 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 226 flow [2021-03-25 14:52:57,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:52:57,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:52:57,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 513 transitions. [2021-03-25 14:52:57,192 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.75 [2021-03-25 14:52:57,193 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 513 transitions. [2021-03-25 14:52:57,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 513 transitions. [2021-03-25 14:52:57,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:57,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 513 transitions. [2021-03-25 14:52:57,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,196 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,196 INFO L185 Difference]: Start difference. First operand has 42 places, 32 transitions, 159 flow. Second operand 4 states and 513 transitions. [2021-03-25 14:52:57,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 226 flow [2021-03-25 14:52:57,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 213 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:57,200 INFO L241 Difference]: Finished difference. Result has 44 places, 34 transitions, 186 flow [2021-03-25 14:52:57,201 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2021-03-25 14:52:57,201 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2021-03-25 14:52:57,201 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:57,201 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 34 transitions, 186 flow [2021-03-25 14:52:57,201 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 34 transitions, 186 flow [2021-03-25 14:52:57,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 34 transitions, 186 flow [2021-03-25 14:52:57,224 INFO L129 PetriNetUnfolder]: 55/167 cut-off events. [2021-03-25 14:52:57,224 INFO L130 PetriNetUnfolder]: For 597/652 co-relation queries the response was YES. [2021-03-25 14:52:57,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 167 events. 55/167 cut-off events. For 597/652 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 870 event pairs, 15 based on Foata normal form. 5/159 useless extension candidates. Maximal degree in co-relation 520. Up to 72 conditions per place. [2021-03-25 14:52:57,226 INFO L142 LiptonReduction]: Number of co-enabled transitions 334 [2021-03-25 14:52:57,244 INFO L154 LiptonReduction]: Checked pairs total: 89 [2021-03-25 14:52:57,244 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:57,244 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 43 [2021-03-25 14:52:57,245 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 186 flow [2021-03-25 14:52:57,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,245 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:57,245 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:57,246 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:52:57,246 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:57,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:57,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1938938411, now seen corresponding path program 1 times [2021-03-25 14:52:57,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:57,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060713943] [2021-03-25 14:52:57,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:57,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:57,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:57,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:57,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:52:57,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:57,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:52:57,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:57,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:52:57,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 14:52:57,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060713943] [2021-03-25 14:52:57,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:57,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:52:57,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370414765] [2021-03-25 14:52:57,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:52:57,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:57,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:52:57,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:52:57,351 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 171 [2021-03-25 14:52:57,352 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:57,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 171 [2021-03-25 14:52:57,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:57,456 INFO L129 PetriNetUnfolder]: 174/381 cut-off events. [2021-03-25 14:52:57,457 INFO L130 PetriNetUnfolder]: For 1074/1309 co-relation queries the response was YES. [2021-03-25 14:52:57,458 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 381 events. 174/381 cut-off events. For 1074/1309 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2095 event pairs, 58 based on Foata normal form. 27/389 useless extension candidates. Maximal degree in co-relation 1245. Up to 243 conditions per place. [2021-03-25 14:52:57,460 INFO L132 encePairwiseOnDemand]: 164/171 looper letters, 19 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2021-03-25 14:52:57,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 274 flow [2021-03-25 14:52:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:52:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:52:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2021-03-25 14:52:57,462 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7850877192982456 [2021-03-25 14:52:57,462 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2021-03-25 14:52:57,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2021-03-25 14:52:57,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:57,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2021-03-25 14:52:57,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,466 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,466 INFO L185 Difference]: Start difference. First operand has 44 places, 34 transitions, 186 flow. Second operand 4 states and 537 transitions. [2021-03-25 14:52:57,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 274 flow [2021-03-25 14:52:57,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 261 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:57,470 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 223 flow [2021-03-25 14:52:57,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-25 14:52:57,471 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2021-03-25 14:52:57,471 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:57,471 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 223 flow [2021-03-25 14:52:57,471 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 223 flow [2021-03-25 14:52:57,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 223 flow [2021-03-25 14:52:57,507 INFO L129 PetriNetUnfolder]: 116/297 cut-off events. [2021-03-25 14:52:57,507 INFO L130 PetriNetUnfolder]: For 1074/1164 co-relation queries the response was YES. [2021-03-25 14:52:57,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 297 events. 116/297 cut-off events. For 1074/1164 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1715 event pairs, 17 based on Foata normal form. 7/271 useless extension candidates. Maximal degree in co-relation 948. Up to 142 conditions per place. [2021-03-25 14:52:57,511 INFO L142 LiptonReduction]: Number of co-enabled transitions 352 [2021-03-25 14:52:57,717 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 14:52:58,100 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 14:52:58,223 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 14:52:58,243 INFO L154 LiptonReduction]: Checked pairs total: 85 [2021-03-25 14:52:58,243 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:52:58,243 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 772 [2021-03-25 14:52:58,244 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 225 flow [2021-03-25 14:52:58,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:58,244 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:58,244 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:58,244 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:52:58,244 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:58,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:58,245 INFO L82 PathProgramCache]: Analyzing trace with hash -409956316, now seen corresponding path program 1 times [2021-03-25 14:52:58,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:58,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883668330] [2021-03-25 14:52:58,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:58,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:58,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:58,298 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:52:58,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:52:58,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:58,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:58,305 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 14:52:58,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883668330] [2021-03-25 14:52:58,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:58,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:58,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738193814] [2021-03-25 14:52:58,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:58,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:58,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:58,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:58,307 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 172 [2021-03-25 14:52:58,307 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:58,307 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:58,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 172 [2021-03-25 14:52:58,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:58,388 INFO L129 PetriNetUnfolder]: 220/531 cut-off events. [2021-03-25 14:52:58,388 INFO L130 PetriNetUnfolder]: For 1757/1925 co-relation queries the response was YES. [2021-03-25 14:52:58,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 531 events. 220/531 cut-off events. For 1757/1925 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 3548 event pairs, 66 based on Foata normal form. 96/582 useless extension candidates. Maximal degree in co-relation 1581. Up to 253 conditions per place. [2021-03-25 14:52:58,393 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 9 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2021-03-25 14:52:58,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 279 flow [2021-03-25 14:52:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:52:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:52:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 728 transitions. [2021-03-25 14:52:58,395 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8465116279069768 [2021-03-25 14:52:58,395 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 728 transitions. [2021-03-25 14:52:58,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 728 transitions. [2021-03-25 14:52:58,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:58,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 728 transitions. [2021-03-25 14:52:58,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.6) internal successors, (728), 5 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:58,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:58,399 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:58,399 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 225 flow. Second operand 5 states and 728 transitions. [2021-03-25 14:52:58,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 279 flow [2021-03-25 14:52:58,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 271 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 14:52:58,429 INFO L241 Difference]: Finished difference. Result has 53 places, 45 transitions, 281 flow [2021-03-25 14:52:58,430 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=281, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2021-03-25 14:52:58,430 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2021-03-25 14:52:58,430 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:58,431 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 45 transitions, 281 flow [2021-03-25 14:52:58,431 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 281 flow [2021-03-25 14:52:58,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 281 flow [2021-03-25 14:52:58,484 INFO L129 PetriNetUnfolder]: 217/512 cut-off events. [2021-03-25 14:52:58,484 INFO L130 PetriNetUnfolder]: For 2196/2406 co-relation queries the response was YES. [2021-03-25 14:52:58,487 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1819 conditions, 512 events. 217/512 cut-off events. For 2196/2406 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 3324 event pairs, 65 based on Foata normal form. 34/498 useless extension candidates. Maximal degree in co-relation 1796. Up to 231 conditions per place. [2021-03-25 14:52:58,491 INFO L142 LiptonReduction]: Number of co-enabled transitions 484 [2021-03-25 14:52:58,495 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:52:58,496 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:58,496 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 66 [2021-03-25 14:52:58,496 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 281 flow [2021-03-25 14:52:58,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:58,497 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:58,497 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:58,497 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:52:58,497 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:58,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:58,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1866526499, now seen corresponding path program 1 times [2021-03-25 14:52:58,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:58,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273118001] [2021-03-25 14:52:58,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:58,566 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 14:52:58,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 14:52:58,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:58,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:58,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:58,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 14:52:58,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:58,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:52:58,626 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 14:52:58,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273118001] [2021-03-25 14:52:58,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:58,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:58,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579153385] [2021-03-25 14:52:58,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:52:58,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:58,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:52:58,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:52:58,628 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 172 [2021-03-25 14:52:58,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 281 flow. Second operand has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:58,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:58,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 172 [2021-03-25 14:52:58,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:58,805 INFO L129 PetriNetUnfolder]: 327/720 cut-off events. [2021-03-25 14:52:58,805 INFO L130 PetriNetUnfolder]: For 2942/3360 co-relation queries the response was YES. [2021-03-25 14:52:58,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 720 events. 327/720 cut-off events. For 2942/3360 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 4840 event pairs, 71 based on Foata normal form. 92/756 useless extension candidates. Maximal degree in co-relation 2768. Up to 310 conditions per place. [2021-03-25 14:52:58,812 INFO L132 encePairwiseOnDemand]: 163/172 looper letters, 19 selfloop transitions, 16 changer transitions 0/58 dead transitions. [2021-03-25 14:52:58,812 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 433 flow [2021-03-25 14:52:58,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:52:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:52:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2021-03-25 14:52:58,814 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7511627906976744 [2021-03-25 14:52:58,814 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2021-03-25 14:52:58,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2021-03-25 14:52:58,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:58,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2021-03-25 14:52:58,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:58,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:58,819 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:58,819 INFO L185 Difference]: Start difference. First operand has 53 places, 45 transitions, 281 flow. Second operand 5 states and 646 transitions. [2021-03-25 14:52:58,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 433 flow [2021-03-25 14:52:58,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 429 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:52:58,825 INFO L241 Difference]: Finished difference. Result has 58 places, 53 transitions, 390 flow [2021-03-25 14:52:58,825 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=390, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2021-03-25 14:52:58,826 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2021-03-25 14:52:58,826 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:58,826 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 53 transitions, 390 flow [2021-03-25 14:52:58,826 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 53 transitions, 390 flow [2021-03-25 14:52:58,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 53 transitions, 390 flow [2021-03-25 14:52:58,889 INFO L129 PetriNetUnfolder]: 257/602 cut-off events. [2021-03-25 14:52:58,889 INFO L130 PetriNetUnfolder]: For 3056/3391 co-relation queries the response was YES. [2021-03-25 14:52:58,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 602 events. 257/602 cut-off events. For 3056/3391 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4064 event pairs, 55 based on Foata normal form. 53/602 useless extension candidates. Maximal degree in co-relation 2360. Up to 247 conditions per place. [2021-03-25 14:52:58,898 INFO L142 LiptonReduction]: Number of co-enabled transitions 584 [2021-03-25 14:52:58,905 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:52:58,906 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:58,906 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 80 [2021-03-25 14:52:58,907 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 390 flow [2021-03-25 14:52:58,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:58,908 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:58,908 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:58,908 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:52:58,908 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:58,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:58,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1346905371, now seen corresponding path program 2 times [2021-03-25 14:52:58,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:58,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8944516] [2021-03-25 14:52:58,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:58,975 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 14:52:58,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:52:58,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:58,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:52:59,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:59,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 14:52:59,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:59,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:52:59,030 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 14:52:59,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8944516] [2021-03-25 14:52:59,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:59,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:52:59,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243712623] [2021-03-25 14:52:59,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:52:59,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:59,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:52:59,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:52:59,033 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 172 [2021-03-25 14:52:59,034 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 390 flow. Second operand has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:59,034 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:59,034 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 172 [2021-03-25 14:52:59,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:59,222 INFO L129 PetriNetUnfolder]: 331/747 cut-off events. [2021-03-25 14:52:59,222 INFO L130 PetriNetUnfolder]: For 4301/4783 co-relation queries the response was YES. [2021-03-25 14:52:59,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3255 conditions, 747 events. 331/747 cut-off events. For 4301/4783 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 5144 event pairs, 72 based on Foata normal form. 127/819 useless extension candidates. Maximal degree in co-relation 3227. Up to 314 conditions per place. [2021-03-25 14:52:59,229 INFO L132 encePairwiseOnDemand]: 164/172 looper letters, 23 selfloop transitions, 27 changer transitions 0/73 dead transitions. [2021-03-25 14:52:59,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 73 transitions, 669 flow [2021-03-25 14:52:59,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:52:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:52:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 794 transitions. [2021-03-25 14:52:59,232 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7693798449612403 [2021-03-25 14:52:59,232 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 794 transitions. [2021-03-25 14:52:59,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 794 transitions. [2021-03-25 14:52:59,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:59,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 794 transitions. [2021-03-25 14:52:59,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.33333333333334) internal successors, (794), 6 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:59,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:59,236 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:59,236 INFO L185 Difference]: Start difference. First operand has 58 places, 53 transitions, 390 flow. Second operand 6 states and 794 transitions. [2021-03-25 14:52:59,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 73 transitions, 669 flow [2021-03-25 14:52:59,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 73 transitions, 646 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-03-25 14:52:59,244 INFO L241 Difference]: Finished difference. Result has 64 places, 67 transitions, 593 flow [2021-03-25 14:52:59,244 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=593, PETRI_PLACES=64, PETRI_TRANSITIONS=67} [2021-03-25 14:52:59,244 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2021-03-25 14:52:59,245 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:59,245 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 67 transitions, 593 flow [2021-03-25 14:52:59,245 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 67 transitions, 593 flow [2021-03-25 14:52:59,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 67 transitions, 593 flow [2021-03-25 14:52:59,317 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L761-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_98 1) v_~__unbuffered_cnt~0_97) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][19], [Black: 129#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0)), 67#L834true, Black: 194#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0) (or (= ~z~0 0) (= ~z~0 1))), Black: 191#(and (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (< 0 (+ (div ~z$r_buff0_thd3~0 256) 1))), Black: 135#(and (= ~z$w_buff0~0 0) (= ~z$w_buff0~0 ~z~0) (= ~z$w_buff1~0 ~z$w_buff0~0)), 10#P1EXITtrue, Black: 141#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0)), Black: 149#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 156#(and (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 2)), 33#P2EXITtrue, Black: 163#(and (= ~z$w_buff0~0 0) (= ~z~0 1) (= ~z$w_buff1~0 ~z$w_buff0~0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork1InUse, Black: 164#(and (= ~z$w_buff0~0 0) (= ~z$w_buff1~0 ~z$w_buff0~0) (or (= ~z$w_buff0~0 ~z~0) (= ~z~0 1)) (= ~z$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 47#P0EXITtrue, Black: 171#(= ~__unbuffered_cnt~0 0), Black: 172#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 174#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 115#(= ~__unbuffered_p2_EAX~0 0), Black: 121#(= ~x~0 0), Black: 183#(and (= ~z$w_buff1~0 0) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 2)), Black: 185#(and (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd3~0 256) 1)) (= ~z$r_buff1_thd3~0 0)), 189#true, 127#(= ~__unbuffered_p2_EAX~0 0)]) [2021-03-25 14:52:59,317 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 14:52:59,317 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:52:59,317 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:52:59,317 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:52:59,318 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L761-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_98 1) v_~__unbuffered_cnt~0_97) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base][19], [67#L834true, Black: 129#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0)), Black: 127#(= ~__unbuffered_p2_EAX~0 0), Black: 194#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0) (or (= ~z~0 0) (= ~z~0 1))), Black: 135#(and (= ~z$w_buff0~0 0) (= ~z$w_buff0~0 ~z~0) (= ~z$w_buff1~0 ~z$w_buff0~0)), Black: 191#(and (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (< 0 (+ (div ~z$r_buff0_thd3~0 256) 1))), 10#P1EXITtrue, Black: 141#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0)), Black: 149#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 156#(and (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 2)), 33#P2EXITtrue, Black: 163#(and (= ~z$w_buff0~0 0) (= ~z~0 1) (= ~z$w_buff1~0 ~z$w_buff0~0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork1InUse, Black: 164#(and (= ~z$w_buff0~0 0) (= ~z$w_buff1~0 ~z$w_buff0~0) (or (= ~z$w_buff0~0 ~z~0) (= ~z~0 1)) (= ~z$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 47#P0EXITtrue, Black: 171#(= ~__unbuffered_cnt~0 0), Black: 172#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 174#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 115#(= ~__unbuffered_p2_EAX~0 0), Black: 121#(= ~x~0 0), Black: 183#(and (= ~z$w_buff1~0 0) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 2)), Black: 185#(and (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd3~0 256) 1)) (= ~z$r_buff1_thd3~0 0)), 189#true]) [2021-03-25 14:52:59,318 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 14:52:59,318 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:52:59,318 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:52:59,318 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:52:59,319 INFO L129 PetriNetUnfolder]: 271/656 cut-off events. [2021-03-25 14:52:59,319 INFO L130 PetriNetUnfolder]: For 4417/4862 co-relation queries the response was YES. [2021-03-25 14:52:59,323 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 656 events. 271/656 cut-off events. For 4417/4862 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 4649 event pairs, 46 based on Foata normal form. 85/689 useless extension candidates. Maximal degree in co-relation 2792. Up to 262 conditions per place. [2021-03-25 14:52:59,329 INFO L142 LiptonReduction]: Number of co-enabled transitions 644 [2021-03-25 14:52:59,339 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:52:59,339 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:59,340 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 95 [2021-03-25 14:52:59,341 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 67 transitions, 593 flow [2021-03-25 14:52:59,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:59,342 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:59,342 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:59,342 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:52:59,342 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:59,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:59,342 INFO L82 PathProgramCache]: Analyzing trace with hash -729242590, now seen corresponding path program 1 times [2021-03-25 14:52:59,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:59,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96948149] [2021-03-25 14:52:59,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:59,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:59,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:59,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:59,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:59,396 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:52:59,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:52:59,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:59,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:59,403 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 14:52:59,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96948149] [2021-03-25 14:52:59,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:59,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:52:59,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423097029] [2021-03-25 14:52:59,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:52:59,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:59,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:52:59,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:52:59,405 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 172 [2021-03-25 14:52:59,406 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 67 transitions, 593 flow. Second operand has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:59,406 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:59,406 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 172 [2021-03-25 14:52:59,406 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:59,549 INFO L129 PetriNetUnfolder]: 149/467 cut-off events. [2021-03-25 14:52:59,549 INFO L130 PetriNetUnfolder]: For 2543/3388 co-relation queries the response was YES. [2021-03-25 14:52:59,552 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2008 conditions, 467 events. 149/467 cut-off events. For 2543/3388 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3477 event pairs, 6 based on Foata normal form. 379/822 useless extension candidates. Maximal degree in co-relation 1977. Up to 233 conditions per place. [2021-03-25 14:52:59,554 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 6 selfloop transitions, 15 changer transitions 3/74 dead transitions. [2021-03-25 14:52:59,554 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 74 transitions, 663 flow [2021-03-25 14:52:59,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:52:59,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:52:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1019 transitions. [2021-03-25 14:52:59,556 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8463455149501661 [2021-03-25 14:52:59,557 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1019 transitions. [2021-03-25 14:52:59,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1019 transitions. [2021-03-25 14:52:59,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:59,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1019 transitions. [2021-03-25 14:52:59,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.57142857142858) internal successors, (1019), 7 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:59,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:59,562 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:59,562 INFO L185 Difference]: Start difference. First operand has 64 places, 67 transitions, 593 flow. Second operand 7 states and 1019 transitions. [2021-03-25 14:52:59,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 74 transitions, 663 flow [2021-03-25 14:52:59,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 74 transitions, 653 flow, removed 5 selfloop flow, removed 0 redundant places. [2021-03-25 14:52:59,571 INFO L241 Difference]: Finished difference. Result has 73 places, 71 transitions, 650 flow [2021-03-25 14:52:59,572 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=650, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2021-03-25 14:52:59,572 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 25 predicate places. [2021-03-25 14:52:59,572 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:59,572 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 71 transitions, 650 flow [2021-03-25 14:52:59,572 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 71 transitions, 650 flow [2021-03-25 14:52:59,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 71 transitions, 650 flow [2021-03-25 14:52:59,617 INFO L129 PetriNetUnfolder]: 132/415 cut-off events. [2021-03-25 14:52:59,617 INFO L130 PetriNetUnfolder]: For 2527/2888 co-relation queries the response was YES. [2021-03-25 14:52:59,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1927 conditions, 415 events. 132/415 cut-off events. For 2527/2888 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 2957 event pairs, 6 based on Foata normal form. 40/434 useless extension candidates. Maximal degree in co-relation 1893. Up to 187 conditions per place. [2021-03-25 14:52:59,624 INFO L142 LiptonReduction]: Number of co-enabled transitions 672 [2021-03-25 14:52:59,632 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:52:59,632 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:59,632 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 60 [2021-03-25 14:52:59,633 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 650 flow [2021-03-25 14:52:59,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:59,633 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:59,633 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 14:52:59,633 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:52:59,633 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:59,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:59,634 INFO L82 PathProgramCache]: Analyzing trace with hash -87640843, now seen corresponding path program 1 times [2021-03-25 14:52:59,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:59,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270491362] [2021-03-25 14:52:59,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:59,700 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-25 14:52:59,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 14:52:59,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:59,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:52:59,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:59,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 14:52:59,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:59,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:52:59,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:59,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:52:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:52:59,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270491362] [2021-03-25 14:52:59,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:59,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:52:59,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899946170] [2021-03-25 14:52:59,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:52:59,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:59,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:52:59,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:52:59,780 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 172 [2021-03-25 14:52:59,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 650 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:59,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:59,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 172 [2021-03-25 14:52:59,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:00,034 INFO L129 PetriNetUnfolder]: 150/475 cut-off events. [2021-03-25 14:53:00,034 INFO L130 PetriNetUnfolder]: For 3770/4319 co-relation queries the response was YES. [2021-03-25 14:53:00,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 475 events. 150/475 cut-off events. For 3770/4319 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3544 event pairs, 8 based on Foata normal form. 126/577 useless extension candidates. Maximal degree in co-relation 2344. Up to 217 conditions per place. [2021-03-25 14:53:00,038 INFO L132 encePairwiseOnDemand]: 163/172 looper letters, 20 selfloop transitions, 27 changer transitions 0/77 dead transitions. [2021-03-25 14:53:00,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 77 transitions, 800 flow [2021-03-25 14:53:00,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:53:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:53:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 989 transitions. [2021-03-25 14:53:00,042 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.71875 [2021-03-25 14:53:00,042 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 989 transitions. [2021-03-25 14:53:00,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 989 transitions. [2021-03-25 14:53:00,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:00,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 989 transitions. [2021-03-25 14:53:00,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.625) internal successors, (989), 8 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:00,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:00,047 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:00,047 INFO L185 Difference]: Start difference. First operand has 73 places, 71 transitions, 650 flow. Second operand 8 states and 989 transitions. [2021-03-25 14:53:00,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 77 transitions, 800 flow [2021-03-25 14:53:00,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 77 transitions, 765 flow, removed 13 selfloop flow, removed 2 redundant places. [2021-03-25 14:53:00,058 INFO L241 Difference]: Finished difference. Result has 79 places, 73 transitions, 700 flow [2021-03-25 14:53:00,058 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=700, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2021-03-25 14:53:00,058 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2021-03-25 14:53:00,058 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:00,058 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 73 transitions, 700 flow [2021-03-25 14:53:00,058 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 73 transitions, 700 flow [2021-03-25 14:53:00,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 73 transitions, 700 flow [2021-03-25 14:53:00,104 INFO L129 PetriNetUnfolder]: 141/451 cut-off events. [2021-03-25 14:53:00,104 INFO L130 PetriNetUnfolder]: For 2483/2669 co-relation queries the response was YES. [2021-03-25 14:53:00,107 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1970 conditions, 451 events. 141/451 cut-off events. For 2483/2669 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3368 event pairs, 6 based on Foata normal form. 35/463 useless extension candidates. Maximal degree in co-relation 1934. Up to 102 conditions per place. [2021-03-25 14:53:00,111 INFO L142 LiptonReduction]: Number of co-enabled transitions 706 [2021-03-25 14:53:00,119 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:53:00,119 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:53:00,119 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 61 [2021-03-25 14:53:00,120 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 700 flow [2021-03-25 14:53:00,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:00,120 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:00,120 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 14:53:00,120 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:53:00,121 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:00,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:00,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1687915925, now seen corresponding path program 2 times [2021-03-25 14:53:00,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:00,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739943505] [2021-03-25 14:53:00,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:00,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:00,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:53:00,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:00,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 14:53:00,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:00,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:53:00,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:00,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:53:00,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:00,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:53:00,247 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 14:53:00,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739943505] [2021-03-25 14:53:00,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:00,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:53:00,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292073277] [2021-03-25 14:53:00,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:53:00,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:00,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:53:00,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:53:00,250 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 172 [2021-03-25 14:53:00,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 700 flow. Second operand has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:00,251 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:00,251 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 172 [2021-03-25 14:53:00,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:00,393 INFO L129 PetriNetUnfolder]: 166/533 cut-off events. [2021-03-25 14:53:00,393 INFO L130 PetriNetUnfolder]: For 3925/4288 co-relation queries the response was YES. [2021-03-25 14:53:00,397 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2502 conditions, 533 events. 166/533 cut-off events. For 3925/4288 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4134 event pairs, 7 based on Foata normal form. 120/625 useless extension candidates. Maximal degree in co-relation 2464. Up to 152 conditions per place. [2021-03-25 14:53:00,399 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 25 selfloop transitions, 25 changer transitions 0/80 dead transitions. [2021-03-25 14:53:00,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 80 transitions, 872 flow [2021-03-25 14:53:00,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:53:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:53:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 511 transitions. [2021-03-25 14:53:00,402 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7427325581395349 [2021-03-25 14:53:00,402 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 511 transitions. [2021-03-25 14:53:00,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 511 transitions. [2021-03-25 14:53:00,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:00,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 511 transitions. [2021-03-25 14:53:00,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:00,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:00,405 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:00,405 INFO L185 Difference]: Start difference. First operand has 79 places, 73 transitions, 700 flow. Second operand 4 states and 511 transitions. [2021-03-25 14:53:00,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 80 transitions, 872 flow [2021-03-25 14:53:00,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 80 transitions, 797 flow, removed 12 selfloop flow, removed 5 redundant places. [2021-03-25 14:53:00,416 INFO L241 Difference]: Finished difference. Result has 78 places, 77 transitions, 747 flow [2021-03-25 14:53:00,416 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=747, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2021-03-25 14:53:00,416 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 30 predicate places. [2021-03-25 14:53:00,417 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:00,417 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 77 transitions, 747 flow [2021-03-25 14:53:00,417 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 77 transitions, 747 flow [2021-03-25 14:53:00,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 747 flow [2021-03-25 14:53:00,470 INFO L129 PetriNetUnfolder]: 157/521 cut-off events. [2021-03-25 14:53:00,470 INFO L130 PetriNetUnfolder]: For 3095/3278 co-relation queries the response was YES. [2021-03-25 14:53:00,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2295 conditions, 521 events. 157/521 cut-off events. For 3095/3278 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 4159 event pairs, 5 based on Foata normal form. 49/544 useless extension candidates. Maximal degree in co-relation 2260. Up to 113 conditions per place. [2021-03-25 14:53:00,479 INFO L142 LiptonReduction]: Number of co-enabled transitions 756 [2021-03-25 14:53:00,489 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:53:00,489 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:53:00,489 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 72 [2021-03-25 14:53:00,492 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 747 flow [2021-03-25 14:53:00,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:00,492 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:00,492 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 14:53:00,492 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 14:53:00,492 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:00,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:00,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1011913036, now seen corresponding path program 1 times [2021-03-25 14:53:00,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:00,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058006644] [2021-03-25 14:53:00,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:00,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:00,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:00,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:00,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:00,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:00,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:00,566 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:53:00,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:53:00,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:00,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:53:00,573 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 14:53:00,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058006644] [2021-03-25 14:53:00,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:00,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:53:00,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635931432] [2021-03-25 14:53:00,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:53:00,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:00,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:53:00,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:53:00,577 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 172 [2021-03-25 14:53:00,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 747 flow. Second operand has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:00,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:00,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 172 [2021-03-25 14:53:00,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:00,709 INFO L129 PetriNetUnfolder]: 133/461 cut-off events. [2021-03-25 14:53:00,709 INFO L130 PetriNetUnfolder]: For 2561/3321 co-relation queries the response was YES. [2021-03-25 14:53:00,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2143 conditions, 461 events. 133/461 cut-off events. For 2561/3321 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 3684 event pairs, 0 based on Foata normal form. 386/821 useless extension candidates. Maximal degree in co-relation 2106. Up to 108 conditions per place. [2021-03-25 14:53:00,714 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 2 selfloop transitions, 19 changer transitions 3/78 dead transitions. [2021-03-25 14:53:00,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 78 transitions, 783 flow [2021-03-25 14:53:00,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:53:00,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:53:00,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1304 transitions. [2021-03-25 14:53:00,718 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8423772609819121 [2021-03-25 14:53:00,718 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1304 transitions. [2021-03-25 14:53:00,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1304 transitions. [2021-03-25 14:53:00,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:00,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1304 transitions. [2021-03-25 14:53:00,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 144.88888888888889) internal successors, (1304), 9 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:00,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:00,724 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:00,724 INFO L185 Difference]: Start difference. First operand has 78 places, 77 transitions, 747 flow. Second operand 9 states and 1304 transitions. [2021-03-25 14:53:00,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 78 transitions, 783 flow [2021-03-25 14:53:00,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 78 transitions, 687 flow, removed 16 selfloop flow, removed 8 redundant places. [2021-03-25 14:53:00,733 INFO L241 Difference]: Finished difference. Result has 81 places, 75 transitions, 670 flow [2021-03-25 14:53:00,733 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=670, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2021-03-25 14:53:00,733 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 33 predicate places. [2021-03-25 14:53:00,733 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:00,734 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 75 transitions, 670 flow [2021-03-25 14:53:00,734 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 75 transitions, 670 flow [2021-03-25 14:53:00,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 670 flow [2021-03-25 14:53:00,783 INFO L129 PetriNetUnfolder]: 132/458 cut-off events. [2021-03-25 14:53:00,783 INFO L130 PetriNetUnfolder]: For 2009/2194 co-relation queries the response was YES. [2021-03-25 14:53:00,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2054 conditions, 458 events. 132/458 cut-off events. For 2009/2194 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 3673 event pairs, 0 based on Foata normal form. 38/473 useless extension candidates. Maximal degree in co-relation 2019. Up to 108 conditions per place. [2021-03-25 14:53:00,790 INFO L142 LiptonReduction]: Number of co-enabled transitions 728 [2021-03-25 14:53:01,121 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 14:53:01,265 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 14:53:01,910 WARN L205 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 192 [2021-03-25 14:53:02,129 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 14:53:03,460 WARN L205 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 346 DAG size of output: 270 [2021-03-25 14:53:04,052 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-25 14:53:04,066 INFO L154 LiptonReduction]: Checked pairs total: 98 [2021-03-25 14:53:04,067 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:53:04,067 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3334 [2021-03-25 14:53:04,067 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 640 flow [2021-03-25 14:53:04,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:04,068 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:04,068 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 14:53:04,068 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 14:53:04,068 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:04,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:04,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1344900062, now seen corresponding path program 1 times [2021-03-25 14:53:04,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:04,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609298639] [2021-03-25 14:53:04,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:04,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:04,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:53:04,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:04,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:04,106 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 14:53:04,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609298639] [2021-03-25 14:53:04,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:04,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:53:04,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129015504] [2021-03-25 14:53:04,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:53:04,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:04,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:53:04,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:53:04,107 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 174 [2021-03-25 14:53:04,108 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:04,108 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:04,108 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 174 [2021-03-25 14:53:04,108 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:04,158 INFO L129 PetriNetUnfolder]: 120/335 cut-off events. [2021-03-25 14:53:04,158 INFO L130 PetriNetUnfolder]: For 2735/2846 co-relation queries the response was YES. [2021-03-25 14:53:04,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1587 conditions, 335 events. 120/335 cut-off events. For 2735/2846 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2060 event pairs, 1 based on Foata normal form. 35/361 useless extension candidates. Maximal degree in co-relation 1550. Up to 117 conditions per place. [2021-03-25 14:53:04,160 INFO L132 encePairwiseOnDemand]: 171/174 looper letters, 2 selfloop transitions, 2 changer transitions 28/64 dead transitions. [2021-03-25 14:53:04,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 64 transitions, 595 flow [2021-03-25 14:53:04,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:53:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:53:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2021-03-25 14:53:04,163 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8735632183908046 [2021-03-25 14:53:04,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 456 transitions. [2021-03-25 14:53:04,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 456 transitions. [2021-03-25 14:53:04,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:04,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 456 transitions. [2021-03-25 14:53:04,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:04,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:04,165 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:04,165 INFO L185 Difference]: Start difference. First operand has 78 places, 70 transitions, 640 flow. Second operand 3 states and 456 transitions. [2021-03-25 14:53:04,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 64 transitions, 595 flow [2021-03-25 14:53:04,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 547 flow, removed 15 selfloop flow, removed 10 redundant places. [2021-03-25 14:53:04,172 INFO L241 Difference]: Finished difference. Result has 64 places, 36 transitions, 274 flow [2021-03-25 14:53:04,172 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=64, PETRI_TRANSITIONS=36} [2021-03-25 14:53:04,172 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2021-03-25 14:53:04,172 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:04,173 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 36 transitions, 274 flow [2021-03-25 14:53:04,173 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 36 transitions, 274 flow [2021-03-25 14:53:04,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 36 transitions, 274 flow [2021-03-25 14:53:04,180 INFO L129 PetriNetUnfolder]: 19/62 cut-off events. [2021-03-25 14:53:04,181 INFO L130 PetriNetUnfolder]: For 240/249 co-relation queries the response was YES. [2021-03-25 14:53:04,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 62 events. 19/62 cut-off events. For 240/249 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 157 event pairs, 1 based on Foata normal form. 2/62 useless extension candidates. Maximal degree in co-relation 240. Up to 19 conditions per place. [2021-03-25 14:53:04,181 INFO L142 LiptonReduction]: Number of co-enabled transitions 136 [2021-03-25 14:53:04,373 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:53:04,758 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 14:53:04,881 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:53:05,101 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-25 14:53:05,322 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 85 [2021-03-25 14:53:05,467 INFO L154 LiptonReduction]: Checked pairs total: 43 [2021-03-25 14:53:05,467 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-25 14:53:05,467 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1295 [2021-03-25 14:53:05,467 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 33 transitions, 281 flow [2021-03-25 14:53:05,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:05,468 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:05,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] [2021-03-25 14:53:05,468 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 14:53:05,468 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:05,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:05,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1562709189, now seen corresponding path program 1 times [2021-03-25 14:53:05,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:05,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298336740] [2021-03-25 14:53:05,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:05,517 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 14:53:05,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 14:53:05,542 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-25 14:53:05,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 14:53:05,576 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-03-25 14:53:05,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 14:53:05,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:05,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:53:05,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:05,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 14:53:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:53:05,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298336740] [2021-03-25 14:53:05,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:05,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:53:05,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468145373] [2021-03-25 14:53:05,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:53:05,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:05,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:53:05,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:53:05,649 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 181 [2021-03-25 14:53:05,649 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 33 transitions, 281 flow. Second operand has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:05,650 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:05,650 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 181 [2021-03-25 14:53:05,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:05,741 INFO L129 PetriNetUnfolder]: 24/76 cut-off events. [2021-03-25 14:53:05,742 INFO L130 PetriNetUnfolder]: For 564/610 co-relation queries the response was YES. [2021-03-25 14:53:05,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 76 events. 24/76 cut-off events. For 564/610 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 252 event pairs, 0 based on Foata normal form. 20/93 useless extension candidates. Maximal degree in co-relation 326. Up to 22 conditions per place. [2021-03-25 14:53:05,743 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 11 selfloop transitions, 5 changer transitions 4/35 dead transitions. [2021-03-25 14:53:05,743 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 35 transitions, 341 flow [2021-03-25 14:53:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:53:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:53:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 633 transitions. [2021-03-25 14:53:05,745 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6994475138121546 [2021-03-25 14:53:05,746 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 633 transitions. [2021-03-25 14:53:05,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 633 transitions. [2021-03-25 14:53:05,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:05,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 633 transitions. [2021-03-25 14:53:05,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:05,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:05,749 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:05,750 INFO L185 Difference]: Start difference. First operand has 55 places, 33 transitions, 281 flow. Second operand 5 states and 633 transitions. [2021-03-25 14:53:05,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 35 transitions, 341 flow [2021-03-25 14:53:05,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 35 transitions, 277 flow, removed 19 selfloop flow, removed 10 redundant places. [2021-03-25 14:53:05,752 INFO L241 Difference]: Finished difference. Result has 50 places, 29 transitions, 212 flow [2021-03-25 14:53:05,752 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=50, PETRI_TRANSITIONS=29} [2021-03-25 14:53:05,752 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2021-03-25 14:53:05,752 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:05,753 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 29 transitions, 212 flow [2021-03-25 14:53:05,753 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 29 transitions, 212 flow [2021-03-25 14:53:05,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 29 transitions, 212 flow [2021-03-25 14:53:05,765 INFO L129 PetriNetUnfolder]: 14/47 cut-off events. [2021-03-25 14:53:05,765 INFO L130 PetriNetUnfolder]: For 141/142 co-relation queries the response was YES. [2021-03-25 14:53:05,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 47 events. 14/47 cut-off events. For 141/142 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 113 event pairs, 0 based on Foata normal form. 1/48 useless extension candidates. Maximal degree in co-relation 173. Up to 15 conditions per place. [2021-03-25 14:53:05,766 INFO L142 LiptonReduction]: Number of co-enabled transitions 50 [2021-03-25 14:53:05,938 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2021-03-25 14:53:06,306 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 90 [2021-03-25 14:53:06,421 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-25 14:53:06,422 INFO L154 LiptonReduction]: Checked pairs total: 2 [2021-03-25 14:53:06,422 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:53:06,423 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 671 [2021-03-25 14:53:06,423 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 29 transitions, 216 flow [2021-03-25 14:53:06,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:06,424 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:06,424 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:53:06,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 14:53:06,424 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:06,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:06,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1380444061, now seen corresponding path program 1 times [2021-03-25 14:53:06,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:06,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108182064] [2021-03-25 14:53:06,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:53:06,452 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:53:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:53:06,477 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:53:06,501 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:53:06,501 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:53:06,501 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-25 14:53:06,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:53:06 BasicIcfg [2021-03-25 14:53:06,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:53:06,568 INFO L168 Benchmark]: Toolchain (without parser) took 25867.26 ms. Allocated memory was 255.9 MB in the beginning and 786.4 MB in the end (delta: 530.6 MB). Free memory was 233.2 MB in the beginning and 377.7 MB in the end (delta: -144.5 MB). Peak memory consumption was 385.6 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:06,568 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:53:06,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 576.60 ms. Allocated memory was 255.9 MB in the beginning and 377.5 MB in the end (delta: 121.6 MB). Free memory was 233.2 MB in the beginning and 336.5 MB in the end (delta: -103.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:06,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.75 ms. Allocated memory is still 377.5 MB. Free memory was 336.5 MB in the beginning and 333.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:06,568 INFO L168 Benchmark]: Boogie Preprocessor took 29.20 ms. Allocated memory is still 377.5 MB. Free memory was 333.5 MB in the beginning and 331.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:06,569 INFO L168 Benchmark]: RCFGBuilder took 2085.10 ms. Allocated memory was 377.5 MB in the beginning and 453.0 MB in the end (delta: 75.5 MB). Free memory was 331.2 MB in the beginning and 418.6 MB in the end (delta: -87.3 MB). Peak memory consumption was 64.6 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:06,569 INFO L168 Benchmark]: TraceAbstraction took 23093.17 ms. Allocated memory was 453.0 MB in the beginning and 786.4 MB in the end (delta: 333.4 MB). Free memory was 418.6 MB in the beginning and 377.7 MB in the end (delta: 40.8 MB). Peak memory consumption was 374.3 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:06,570 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.11 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 576.60 ms. Allocated memory was 255.9 MB in the beginning and 377.5 MB in the end (delta: 121.6 MB). Free memory was 233.2 MB in the beginning and 336.5 MB in the end (delta: -103.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 65.75 ms. Allocated memory is still 377.5 MB. Free memory was 336.5 MB in the beginning and 333.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.20 ms. Allocated memory is still 377.5 MB. Free memory was 333.5 MB in the beginning and 331.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2085.10 ms. Allocated memory was 377.5 MB in the beginning and 453.0 MB in the end (delta: 75.5 MB). Free memory was 331.2 MB in the beginning and 418.6 MB in the end (delta: -87.3 MB). Peak memory consumption was 64.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 23093.17 ms. Allocated memory was 453.0 MB in the beginning and 786.4 MB in the end (delta: 333.4 MB). Free memory was 418.6 MB in the beginning and 377.7 MB in the end (delta: 40.8 MB). Peak memory consumption was 374.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7371.5ms, 102 PlacesBefore, 48 PlacesAfterwards, 94 TransitionsBefore, 39 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 3065 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1546, positive: 1462, positive conditional: 0, positive unconditional: 1462, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1105, positive: 1070, positive conditional: 0, positive unconditional: 1070, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1105, positive: 1070, positive conditional: 0, positive unconditional: 1070, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1105, positive: 1064, positive conditional: 0, positive unconditional: 1064, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 383, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 368, negative conditional: 0, negative unconditional: 368, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1546, positive: 392, positive conditional: 0, positive unconditional: 392, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 1105, unknown conditional: 0, unknown unconditional: 1105] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3198.1ms, 45 PlacesBefore, 33 PlacesAfterwards, 32 TransitionsBefore, 24 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 942 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 246, positive: 179, positive conditional: 0, positive unconditional: 179, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 215, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 215, negative conditional: 0, negative unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 246, positive: 163, positive conditional: 0, positive unconditional: 163, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 967.4ms, 34 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 777 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 201, positive: 141, positive conditional: 0, positive unconditional: 141, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 201, positive: 138, positive conditional: 0, positive unconditional: 138, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4ms, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 230 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 94, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 94, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.8ms, 36 PlacesBefore, 36 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 248 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 243 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 63, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 17, negative conditional: 0, negative unconditional: 17, 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: 63, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 119.6ms, 37 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 179 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 53, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 106, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 53, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 49.9ms, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 105 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 34, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 4, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 4, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 21, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 153, Positive conditional cache size: 0, Positive unconditional cache size: 153, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.5ms, 42 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 59 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 153, Positive conditional cache size: 0, Positive unconditional cache size: 153, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.5ms, 44 PlacesBefore, 44 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 89 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 155, Positive conditional cache size: 0, Positive unconditional cache size: 155, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 772.1ms, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 352 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 85 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 49, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 156, Positive conditional cache size: 0, Positive unconditional cache size: 156, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 64.9ms, 53 PlacesBefore, 53 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 484 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): 179, Positive cache size: 156, Positive conditional cache size: 0, Positive unconditional cache size: 156, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 79.5ms, 58 PlacesBefore, 58 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 584 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): 179, Positive cache size: 156, Positive conditional cache size: 0, Positive unconditional cache size: 156, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 94.7ms, 64 PlacesBefore, 64 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 644 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): 179, Positive cache size: 156, Positive conditional cache size: 0, Positive unconditional cache size: 156, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.1ms, 73 PlacesBefore, 73 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 672 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): 179, Positive cache size: 156, Positive conditional cache size: 0, Positive unconditional cache size: 156, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.7ms, 79 PlacesBefore, 79 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 706 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): 179, Positive cache size: 156, Positive conditional cache size: 0, Positive unconditional cache size: 156, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 72.4ms, 78 PlacesBefore, 78 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 756 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): 179, Positive cache size: 156, Positive conditional cache size: 0, Positive unconditional cache size: 156, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3332.9ms, 81 PlacesBefore, 78 PlacesAfterwards, 75 TransitionsBefore, 70 TransitionsAfterwards, 728 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 98 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 98, positive: 98, positive conditional: 0, positive unconditional: 98, 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: 98, positive: 98, positive conditional: 0, positive unconditional: 98, 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): 144, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1294.2ms, 64 PlacesBefore, 55 PlacesAfterwards, 36 TransitionsBefore, 33 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 43 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 43, positive: 43, positive conditional: 0, positive unconditional: 43, 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: 11, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 11, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 11, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 43, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 669.7ms, 50 PlacesBefore, 50 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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): 81, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2040; [L819] FCALL, FORK 0 pthread_create(&t2040, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2041; [L821] FCALL, FORK 0 pthread_create(&t2041, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2042; [L823] FCALL, FORK 0 pthread_create(&t2042, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L790] 3 __unbuffered_p2_EAX = y [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 22931.8ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2359.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7442.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 78 SDtfs, 28 SDslu, 23 SDs, 0 SdLazy, 479 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 592.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 704.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=747occurred in iteration=15, InterpolantAutomatonStates: 84, 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: 46.5ms SsaConstructionTime, 452.2ms SatisfiabilityAnalysisTime, 1407.8ms InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 2549 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...