/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 15:49:39,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 15:49:39,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 15:49:39,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 15:49:39,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 15:49:39,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 15:49:39,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 15:49:39,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 15:49:39,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 15:49:39,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 15:49:39,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 15:49:39,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 15:49:39,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 15:49:39,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 15:49:39,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 15:49:39,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 15:49:39,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 15:49:39,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 15:49:39,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 15:49:39,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 15:49:39,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 15:49:39,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 15:49:39,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 15:49:39,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 15:49:39,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 15:49:39,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 15:49:39,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 15:49:39,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 15:49:39,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 15:49:39,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 15:49:39,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 15:49:39,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 15:49:39,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 15:49:39,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 15:49:39,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 15:49:39,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 15:49:39,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 15:49:39,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 15:49:39,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 15:49:39,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 15:49:39,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 15:49:39,550 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-06-11 15:49:39,589 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 15:49:39,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 15:49:39,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 15:49:39,608 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 15:49:39,608 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 15:49:39,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 15:49:39,608 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 15:49:39,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 15:49:39,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 15:49:39,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 15:49:39,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 15:49:39,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 15:49:39,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 15:49:39,610 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 15:49:39,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 15:49:39,610 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 15:49:39,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 15:49:39,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 15:49:39,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 15:49:39,611 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 15:49:39,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 15:49:39,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:49:39,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 15:49:39,612 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 15:49:39,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 15:49:39,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 15:49:39,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 15:49:39,612 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 15:49:39,612 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 15:49:39,613 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 15:49:39,613 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-06-11 15:49:40,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 15:49:40,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 15:49:40,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 15:49:40,226 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 15:49:40,235 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 15:49:40,235 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2021-06-11 15:49:40,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09dc199a8/2955abec45cf464097d599635fcd89e3/FLAG908a69a4c [2021-06-11 15:49:41,227 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 15:49:41,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2021-06-11 15:49:41,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09dc199a8/2955abec45cf464097d599635fcd89e3/FLAG908a69a4c [2021-06-11 15:49:41,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09dc199a8/2955abec45cf464097d599635fcd89e3 [2021-06-11 15:49:41,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 15:49:41,299 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 15:49:41,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 15:49:41,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 15:49:41,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 15:49:41,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:49:41" (1/1) ... [2021-06-11 15:49:41,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68610768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:41, skipping insertion in model container [2021-06-11 15:49:41,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:49:41" (1/1) ... [2021-06-11 15:49:41,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 15:49:41,401 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 15:49:41,746 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/mix047_rmo.opt.i[948,961] [2021-06-11 15:49:42,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:49:42,094 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 15:49:42,118 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/mix047_rmo.opt.i[948,961] [2021-06-11 15:49:42,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:49:42,354 INFO L208 MainTranslator]: Completed translation [2021-06-11 15:49:42,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:42 WrapperNode [2021-06-11 15:49:42,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 15:49:42,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 15:49:42,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 15:49:42,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 15:49:42,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:42" (1/1) ... [2021-06-11 15:49:42,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:42" (1/1) ... [2021-06-11 15:49:42,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 15:49:42,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 15:49:42,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 15:49:42,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 15:49:42,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:42" (1/1) ... [2021-06-11 15:49:42,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:42" (1/1) ... [2021-06-11 15:49:42,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:42" (1/1) ... [2021-06-11 15:49:42,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:42" (1/1) ... [2021-06-11 15:49:42,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:42" (1/1) ... [2021-06-11 15:49:42,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:42" (1/1) ... [2021-06-11 15:49:42,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:42" (1/1) ... [2021-06-11 15:49:42,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 15:49:42,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 15:49:42,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 15:49:42,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 15:49:42,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:42" (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-06-11 15:49:42,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 15:49:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 15:49:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 15:49:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 15:49:42,728 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 15:49:42,728 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 15:49:42,729 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 15:49:42,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 15:49:42,729 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 15:49:42,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 15:49:42,729 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-11 15:49:42,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-11 15:49:42,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 15:49:42,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 15:49:42,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 15:49:42,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 15:49:42,731 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 15:49:45,443 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 15:49:45,443 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 15:49:45,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:49:45 BoogieIcfgContainer [2021-06-11 15:49:45,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 15:49:45,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 15:49:45,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 15:49:45,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 15:49:45,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 03:49:41" (1/3) ... [2021-06-11 15:49:45,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c1e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:49:45, skipping insertion in model container [2021-06-11 15:49:45,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:42" (2/3) ... [2021-06-11 15:49:45,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c1e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:49:45, skipping insertion in model container [2021-06-11 15:49:45,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:49:45" (3/3) ... [2021-06-11 15:49:45,452 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_rmo.opt.i [2021-06-11 15:49:45,457 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 15:49:45,461 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 15:49:45,462 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 15:49:45,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,504 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,504 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,504 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,505 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,507 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,507 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,508 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,508 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,510 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,510 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,510 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,510 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,514 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,514 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,514 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,515 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,515 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,515 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,515 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,515 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,515 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,516 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,516 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,516 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,516 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,516 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,516 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,516 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,523 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,523 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,525 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,525 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,529 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,530 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,540 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,540 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,540 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,541 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,541 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,541 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,541 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,541 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,541 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,541 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,541 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,542 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:45,543 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 15:49:45,558 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-11 15:49:45,582 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 15:49:45,582 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 15:49:45,583 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 15:49:45,583 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 15:49:45,583 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 15:49:45,583 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 15:49:45,583 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 15:49:45,583 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 15:49:45,595 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 252 flow [2021-06-11 15:49:45,645 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-06-11 15:49:45,645 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:49:45,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-06-11 15:49:45,649 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 116 transitions, 252 flow [2021-06-11 15:49:45,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 112 transitions, 236 flow [2021-06-11 15:49:45,655 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:45,666 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 236 flow [2021-06-11 15:49:45,670 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 236 flow [2021-06-11 15:49:45,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 236 flow [2021-06-11 15:49:45,707 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-06-11 15:49:45,707 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:49:45,708 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-06-11 15:49:45,712 INFO L151 LiptonReduction]: Number of co-enabled transitions 2598 [2021-06-11 15:49:45,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:45,838 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:45,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:45,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:45,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:45,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:45,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:45,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:45,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:45,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:45,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:45,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:45,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:45,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:45,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:45,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:45,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:45,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:45,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:46,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:46,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:46,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,116 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:46,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:46,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:46,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:46,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:46,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:46,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:46,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:46,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:46,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,519 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:46,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:46,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:46,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:46,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:46,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:46,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,873 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 15:49:46,873 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:46,895 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:46,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:46,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:47,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,087 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:47,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:47,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:47,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:47,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:47,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:47,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,314 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:47,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:47,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:47,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:47,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:47,463 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 15:49:47,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:47,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:47,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:47,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:47,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:47,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:47,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:47,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:47,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:47,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:47,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:47,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:48,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:48,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:48,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:48,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:48,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:48,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:48,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:48,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:48,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:48,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:48,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:48,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:48,462 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 15:49:48,923 WARN L205 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-06-11 15:49:49,105 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-11 15:49:49,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,117 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:49,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:49:49,124 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:49,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,129 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 15:49:49,129 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:49,132 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,134 INFO L147 QuantifierPusher]: treesize reduction 50, result has 50.0 percent of original size 50 [2021-06-11 15:49:49,134 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:49,138 INFO L142 QuantifierPusher]: treesize reduction 50, result has 68.8 percent of original size [2021-06-11 15:49:49,139 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 1] term [2021-06-11 15:49:49,139 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:49,143 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,146 INFO L147 QuantifierPusher]: treesize reduction 76, result has 39.7 percent of original size 50 [2021-06-11 15:49:49,147 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 3, 2, 1] term [2021-06-11 15:49:49,147 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:49,149 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,157 INFO L147 QuantifierPusher]: treesize reduction 141, result has 44.3 percent of original size 112 [2021-06-11 15:49:49,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:49,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,422 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:49,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:49,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:49,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:49,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:49,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:49,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:49,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,716 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:49,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:49,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:49,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:49,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,859 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 15:49:49,952 INFO L142 QuantifierPusher]: treesize reduction 84, result has 91.3 percent of original size [2021-06-11 15:49:49,964 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:49,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 15:49:49,969 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:49,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,973 INFO L147 QuantifierPusher]: treesize reduction 36, result has 2.7 percent of original size 1 [2021-06-11 15:49:49,973 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:49,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:49,976 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:49,978 INFO L142 QuantifierPusher]: treesize reduction 38, result has 69.6 percent of original size [2021-06-11 15:49:49,981 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 15:49:49,990 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:49,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:49,995 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 15:49:49,997 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:49,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:49:50,010 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:50,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:49:50,015 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:50,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:49:50,019 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:50,023 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 15:49:50,024 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 15:49:50,024 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:50,026 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,027 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 15:49:50,027 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:50,029 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,029 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 15:49:50,029 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:50,034 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,037 INFO L147 QuantifierPusher]: treesize reduction 148, result has 52.1 percent of original size 161 [2021-06-11 15:49:50,037 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:50,041 INFO L142 QuantifierPusher]: treesize reduction 148, result has 64.3 percent of original size [2021-06-11 15:49:50,043 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 2, 1] term [2021-06-11 15:49:50,043 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:50,046 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,047 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 2, 2, 1] term [2021-06-11 15:49:50,047 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:50,050 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,051 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 2, 1] term [2021-06-11 15:49:50,052 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:50,055 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,060 INFO L147 QuantifierPusher]: treesize reduction 492, result has 21.0 percent of original size 131 [2021-06-11 15:49:50,061 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:49:50,061 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:50,063 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,064 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:49:50,065 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:50,067 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,067 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:49:50,068 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:50,070 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,079 INFO L147 QuantifierPusher]: treesize reduction 1874, result has 10.5 percent of original size 221 [2021-06-11 15:49:50,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:50,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:50,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,490 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:50,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,492 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:50,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 15:49:50,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:50,493 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:50,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,494 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:50,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 15:49:50,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 15:49:50,498 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:50,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 15:49:50,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:49:50,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:50,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:50,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,858 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:50,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:50,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:50,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:50,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:51,380 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-06-11 15:49:51,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:51,400 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:51,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:51,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:51,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:51,823 WARN L205 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-06-11 15:49:51,993 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-11 15:49:52,382 WARN L205 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-06-11 15:49:52,525 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-11 15:49:52,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:52,545 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:52,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:52,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:52,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:52,573 INFO L163 LiptonReduction]: Checked pairs total: 6997 [2021-06-11 15:49:52,573 INFO L165 LiptonReduction]: Total number of compositions: 100 [2021-06-11 15:49:52,577 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6923 [2021-06-11 15:49:52,590 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-06-11 15:49:52,590 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:49:52,590 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:52,590 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:52,591 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:49:52,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:52,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1899639694, now seen corresponding path program 1 times [2021-06-11 15:49:52,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:52,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887593390] [2021-06-11 15:49:52,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:52,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:52,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:52,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:49:52,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887593390] [2021-06-11 15:49:52,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:52,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:49:52,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720604592] [2021-06-11 15:49:52,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:49:52,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:52,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:49:52,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:49:52,782 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 216 [2021-06-11 15:49:52,784 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 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-06-11 15:49:52,784 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:52,784 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 216 [2021-06-11 15:49:52,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:52,829 INFO L129 PetriNetUnfolder]: 16/75 cut-off events. [2021-06-11 15:49:52,829 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:49:52,830 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 75 events. 16/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 254 event pairs, 2 based on Foata normal form. 12/84 useless extension candidates. Maximal degree in co-relation 112. Up to 27 conditions per place. [2021-06-11 15:49:52,831 INFO L132 encePairwiseOnDemand]: 211/216 looper letters, 7 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2021-06-11 15:49:52,831 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 32 transitions, 94 flow [2021-06-11 15:49:52,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:49:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:49:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2021-06-11 15:49:52,843 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8641975308641975 [2021-06-11 15:49:52,844 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 560 transitions. [2021-06-11 15:49:52,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 560 transitions. [2021-06-11 15:49:52,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:52,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 560 transitions. [2021-06-11 15:49:52,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:52,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:52,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:52,860 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 560 transitions. [2021-06-11 15:49:52,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 32 transitions, 94 flow [2021-06-11 15:49:52,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 90 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-06-11 15:49:52,886 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 70 flow [2021-06-11 15:49:52,888 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-06-11 15:49:52,889 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2021-06-11 15:49:52,889 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:52,889 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 70 flow [2021-06-11 15:49:52,890 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 70 flow [2021-06-11 15:49:52,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 70 flow [2021-06-11 15:49:52,896 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-06-11 15:49:52,897 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:49:52,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 15:49:52,898 INFO L151 LiptonReduction]: Number of co-enabled transitions 422 [2021-06-11 15:49:54,139 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 249 DAG size of output: 209 [2021-06-11 15:49:55,233 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 207 DAG size of output: 206 [2021-06-11 15:49:57,773 WARN L205 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 339 DAG size of output: 293 [2021-06-11 15:49:58,916 WARN L205 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 289 [2021-06-11 15:49:58,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:58,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:59,642 WARN L205 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 193 [2021-06-11 15:49:59,937 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-06-11 15:50:01,394 WARN L205 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 317 DAG size of output: 273 [2021-06-11 15:50:02,083 WARN L205 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-06-11 15:50:02,286 INFO L163 LiptonReduction]: Checked pairs total: 948 [2021-06-11 15:50:02,286 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 15:50:02,286 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9397 [2021-06-11 15:50:02,287 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2021-06-11 15:50:02,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 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-06-11 15:50:02,288 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:02,288 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:50:02,288 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 15:50:02,288 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:02,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:02,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1675436419, now seen corresponding path program 1 times [2021-06-11 15:50:02,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:02,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515124995] [2021-06-11 15:50:02,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:50:02,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:02,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:50:02,443 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-11 15:50:02,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 15:50:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:50:02,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515124995] [2021-06-11 15:50:02,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:50:02,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:50:02,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401792925] [2021-06-11 15:50:02,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:50:02,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:50:02,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:50:02,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:50:02,466 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 218 [2021-06-11 15:50:02,467 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:02,467 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:50:02,467 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 218 [2021-06-11 15:50:02,467 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:50:02,526 INFO L129 PetriNetUnfolder]: 1/30 cut-off events. [2021-06-11 15:50:02,526 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:50:02,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 40. Up to 3 conditions per place. [2021-06-11 15:50:02,527 INFO L132 encePairwiseOnDemand]: 214/218 looper letters, 1 selfloop transitions, 2 changer transitions 4/30 dead transitions. [2021-06-11 15:50:02,527 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 30 transitions, 84 flow [2021-06-11 15:50:02,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:50:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:50:02,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 897 transitions. [2021-06-11 15:50:02,530 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8229357798165138 [2021-06-11 15:50:02,531 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 897 transitions. [2021-06-11 15:50:02,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 897 transitions. [2021-06-11 15:50:02,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:50:02,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 897 transitions. [2021-06-11 15:50:02,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:02,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:02,538 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:02,538 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 5 states and 897 transitions. [2021-06-11 15:50:02,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 30 transitions, 84 flow [2021-06-11 15:50:02,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:50:02,539 INFO L241 Difference]: Finished difference. Result has 42 places, 26 transitions, 68 flow [2021-06-11 15:50:02,539 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2021-06-11 15:50:02,540 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2021-06-11 15:50:02,540 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:50:02,540 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 26 transitions, 68 flow [2021-06-11 15:50:02,541 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 26 transitions, 68 flow [2021-06-11 15:50:02,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 26 transitions, 68 flow [2021-06-11 15:50:02,551 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-06-11 15:50:02,551 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:50:02,552 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 35 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 15:50:02,552 INFO L151 LiptonReduction]: Number of co-enabled transitions 328 [2021-06-11 15:50:02,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:02,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:50:02,807 INFO L163 LiptonReduction]: Checked pairs total: 713 [2021-06-11 15:50:02,808 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 15:50:02,808 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 268 [2021-06-11 15:50:02,808 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2021-06-11 15:50:02,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:02,809 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:02,809 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:50:02,809 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 15:50:02,809 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:02,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:02,810 INFO L82 PathProgramCache]: Analyzing trace with hash -398795555, now seen corresponding path program 1 times [2021-06-11 15:50:02,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:02,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399251618] [2021-06-11 15:50:02,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:50:02,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:02,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:50:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:50:02,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399251618] [2021-06-11 15:50:02,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:50:02,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:50:02,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765581556] [2021-06-11 15:50:02,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:50:02,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:50:02,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:50:02,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:50:02,920 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 219 [2021-06-11 15:50:02,920 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:02,920 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:50:02,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 219 [2021-06-11 15:50:02,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:50:02,938 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-06-11 15:50:02,938 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-06-11 15:50:02,939 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 37 events. 3/37 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 1 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 55. Up to 10 conditions per place. [2021-06-11 15:50:02,939 INFO L132 encePairwiseOnDemand]: 215/219 looper letters, 3 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2021-06-11 15:50:02,939 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 82 flow [2021-06-11 15:50:02,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:50:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:50:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 574 transitions. [2021-06-11 15:50:02,942 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8736681887366818 [2021-06-11 15:50:02,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 574 transitions. [2021-06-11 15:50:02,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 574 transitions. [2021-06-11 15:50:02,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:50:02,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 574 transitions. [2021-06-11 15:50:02,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:02,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:02,946 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:02,946 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 3 states and 574 transitions. [2021-06-11 15:50:02,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 82 flow [2021-06-11 15:50:02,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:50:02,947 INFO L241 Difference]: Finished difference. Result has 38 places, 27 transitions, 81 flow [2021-06-11 15:50:02,947 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2021-06-11 15:50:02,947 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, -6 predicate places. [2021-06-11 15:50:02,947 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:50:02,947 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 81 flow [2021-06-11 15:50:02,949 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 81 flow [2021-06-11 15:50:02,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 81 flow [2021-06-11 15:50:02,954 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-06-11 15:50:02,955 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-06-11 15:50:02,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 33 events. 3/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2021-06-11 15:50:02,955 INFO L151 LiptonReduction]: Number of co-enabled transitions 342 [2021-06-11 15:50:02,958 INFO L163 LiptonReduction]: Checked pairs total: 292 [2021-06-11 15:50:02,958 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:50:02,958 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11 [2021-06-11 15:50:02,959 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 81 flow [2021-06-11 15:50:02,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:02,959 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:02,959 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:50:02,959 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 15:50:02,959 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:02,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:02,960 INFO L82 PathProgramCache]: Analyzing trace with hash -353088163, now seen corresponding path program 1 times [2021-06-11 15:50:02,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:02,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912236107] [2021-06-11 15:50:02,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:50:03,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:03,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:50:03,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:50:03,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912236107] [2021-06-11 15:50:03,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:50:03,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:50:03,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272551567] [2021-06-11 15:50:03,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:50:03,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:50:03,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:50:03,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:50:03,025 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 219 [2021-06-11 15:50:03,026 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,026 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:50:03,026 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 219 [2021-06-11 15:50:03,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:50:03,048 INFO L129 PetriNetUnfolder]: 10/58 cut-off events. [2021-06-11 15:50:03,048 INFO L130 PetriNetUnfolder]: For 24/33 co-relation queries the response was YES. [2021-06-11 15:50:03,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 58 events. 10/58 cut-off events. For 24/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 173 event pairs, 3 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 105. Up to 19 conditions per place. [2021-06-11 15:50:03,050 INFO L132 encePairwiseOnDemand]: 215/219 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-06-11 15:50:03,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 97 flow [2021-06-11 15:50:03,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:50:03,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:50:03,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 574 transitions. [2021-06-11 15:50:03,053 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8736681887366818 [2021-06-11 15:50:03,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 574 transitions. [2021-06-11 15:50:03,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 574 transitions. [2021-06-11 15:50:03,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:50:03,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 574 transitions. [2021-06-11 15:50:03,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,057 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,057 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 81 flow. Second operand 3 states and 574 transitions. [2021-06-11 15:50:03,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 97 flow [2021-06-11 15:50:03,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:50:03,059 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 97 flow [2021-06-11 15:50:03,059 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-06-11 15:50:03,059 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2021-06-11 15:50:03,059 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:50:03,059 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 97 flow [2021-06-11 15:50:03,060 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 97 flow [2021-06-11 15:50:03,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 97 flow [2021-06-11 15:50:03,066 INFO L129 PetriNetUnfolder]: 10/50 cut-off events. [2021-06-11 15:50:03,067 INFO L130 PetriNetUnfolder]: For 21/27 co-relation queries the response was YES. [2021-06-11 15:50:03,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 50 events. 10/50 cut-off events. For 21/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 158 event pairs, 3 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 96. Up to 19 conditions per place. [2021-06-11 15:50:03,069 INFO L151 LiptonReduction]: Number of co-enabled transitions 392 [2021-06-11 15:50:03,073 INFO L163 LiptonReduction]: Checked pairs total: 234 [2021-06-11 15:50:03,073 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:50:03,073 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-06-11 15:50:03,074 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 97 flow [2021-06-11 15:50:03,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,075 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:03,075 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:50:03,075 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 15:50:03,076 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:03,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:03,076 INFO L82 PathProgramCache]: Analyzing trace with hash 784304533, now seen corresponding path program 1 times [2021-06-11 15:50:03,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:03,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083037484] [2021-06-11 15:50:03,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:50:03,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:03,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:50:03,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:03,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:50:03,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:50:03,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083037484] [2021-06-11 15:50:03,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:50:03,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:50:03,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144016539] [2021-06-11 15:50:03,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:50:03,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:50:03,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:50:03,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:50:03,130 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 219 [2021-06-11 15:50:03,131 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,131 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:50:03,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 219 [2021-06-11 15:50:03,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:50:03,150 INFO L129 PetriNetUnfolder]: 4/52 cut-off events. [2021-06-11 15:50:03,150 INFO L130 PetriNetUnfolder]: For 55/106 co-relation queries the response was YES. [2021-06-11 15:50:03,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 52 events. 4/52 cut-off events. For 55/106 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 179 event pairs, 1 based on Foata normal form. 2/50 useless extension candidates. Maximal degree in co-relation 104. Up to 15 conditions per place. [2021-06-11 15:50:03,151 INFO L132 encePairwiseOnDemand]: 216/219 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-06-11 15:50:03,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 29 transitions, 109 flow [2021-06-11 15:50:03,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:50:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:50:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2021-06-11 15:50:03,153 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8721461187214612 [2021-06-11 15:50:03,154 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 573 transitions. [2021-06-11 15:50:03,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 573 transitions. [2021-06-11 15:50:03,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:50:03,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 573 transitions. [2021-06-11 15:50:03,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,157 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,157 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 97 flow. Second operand 3 states and 573 transitions. [2021-06-11 15:50:03,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 29 transitions, 109 flow [2021-06-11 15:50:03,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 29 transitions, 106 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:50:03,160 INFO L241 Difference]: Finished difference. Result has 42 places, 29 transitions, 105 flow [2021-06-11 15:50:03,160 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2021-06-11 15:50:03,160 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2021-06-11 15:50:03,160 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:50:03,160 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 29 transitions, 105 flow [2021-06-11 15:50:03,161 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 29 transitions, 105 flow [2021-06-11 15:50:03,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 29 transitions, 105 flow [2021-06-11 15:50:03,167 INFO L129 PetriNetUnfolder]: 4/52 cut-off events. [2021-06-11 15:50:03,168 INFO L130 PetriNetUnfolder]: For 43/61 co-relation queries the response was YES. [2021-06-11 15:50:03,168 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 52 events. 4/52 cut-off events. For 43/61 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 183 event pairs, 1 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 103. Up to 15 conditions per place. [2021-06-11 15:50:03,169 INFO L151 LiptonReduction]: Number of co-enabled transitions 392 [2021-06-11 15:50:03,232 INFO L163 LiptonReduction]: Checked pairs total: 234 [2021-06-11 15:50:03,232 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:50:03,232 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 72 [2021-06-11 15:50:03,234 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 105 flow [2021-06-11 15:50:03,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,235 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:03,235 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:50:03,235 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 15:50:03,235 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:03,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:03,235 INFO L82 PathProgramCache]: Analyzing trace with hash 521915910, now seen corresponding path program 1 times [2021-06-11 15:50:03,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:03,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207285708] [2021-06-11 15:50:03,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:50:03,299 INFO L142 QuantifierPusher]: treesize reduction 10, result has 63.0 percent of original size [2021-06-11 15:50:03,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 15:50:03,311 INFO L142 QuantifierPusher]: treesize reduction 10, result has 52.4 percent of original size [2021-06-11 15:50:03,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 15:50:03,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:03,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 15:50:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:50:03,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207285708] [2021-06-11 15:50:03,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:50:03,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:50:03,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722762964] [2021-06-11 15:50:03,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:50:03,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:50:03,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:50:03,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:50:03,332 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 219 [2021-06-11 15:50:03,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:50:03,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 219 [2021-06-11 15:50:03,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:50:03,425 INFO L129 PetriNetUnfolder]: 94/248 cut-off events. [2021-06-11 15:50:03,425 INFO L130 PetriNetUnfolder]: For 310/439 co-relation queries the response was YES. [2021-06-11 15:50:03,426 INFO L84 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 248 events. 94/248 cut-off events. For 310/439 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1339 event pairs, 49 based on Foata normal form. 3/217 useless extension candidates. Maximal degree in co-relation 594. Up to 145 conditions per place. [2021-06-11 15:50:03,427 INFO L132 encePairwiseOnDemand]: 213/219 looper letters, 7 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2021-06-11 15:50:03,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 144 flow [2021-06-11 15:50:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:50:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:50:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 698 transitions. [2021-06-11 15:50:03,430 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7968036529680366 [2021-06-11 15:50:03,430 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 698 transitions. [2021-06-11 15:50:03,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 698 transitions. [2021-06-11 15:50:03,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:50:03,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 698 transitions. [2021-06-11 15:50:03,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 174.5) internal successors, (698), 4 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,435 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,435 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 105 flow. Second operand 4 states and 698 transitions. [2021-06-11 15:50:03,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 144 flow [2021-06-11 15:50:03,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 139 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-11 15:50:03,438 INFO L241 Difference]: Finished difference. Result has 46 places, 34 transitions, 140 flow [2021-06-11 15:50:03,438 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2021-06-11 15:50:03,438 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2021-06-11 15:50:03,438 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:50:03,439 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 34 transitions, 140 flow [2021-06-11 15:50:03,439 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 34 transitions, 140 flow [2021-06-11 15:50:03,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 34 transitions, 140 flow [2021-06-11 15:50:03,461 INFO L129 PetriNetUnfolder]: 25/123 cut-off events. [2021-06-11 15:50:03,462 INFO L130 PetriNetUnfolder]: For 99/149 co-relation queries the response was YES. [2021-06-11 15:50:03,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 123 events. 25/123 cut-off events. For 99/149 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 587 event pairs, 3 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 264. Up to 33 conditions per place. [2021-06-11 15:50:03,464 INFO L151 LiptonReduction]: Number of co-enabled transitions 492 [2021-06-11 15:50:03,468 INFO L163 LiptonReduction]: Checked pairs total: 170 [2021-06-11 15:50:03,468 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:50:03,469 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31 [2021-06-11 15:50:03,469 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 140 flow [2021-06-11 15:50:03,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,470 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:03,470 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:50:03,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-11 15:50:03,470 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:03,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:03,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1681976252, now seen corresponding path program 2 times [2021-06-11 15:50:03,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:03,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211846453] [2021-06-11 15:50:03,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:50:03,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:03,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:50:03,570 INFO L142 QuantifierPusher]: treesize reduction 14, result has 51.7 percent of original size [2021-06-11 15:50:03,570 INFO L147 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size 11 [2021-06-11 15:50:03,586 INFO L142 QuantifierPusher]: treesize reduction 13, result has 53.6 percent of original size [2021-06-11 15:50:03,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 15:50:03,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:50:03,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211846453] [2021-06-11 15:50:03,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:50:03,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:50:03,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372669926] [2021-06-11 15:50:03,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:50:03,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:50:03,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:50:03,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:50:03,602 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 219 [2021-06-11 15:50:03,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:50:03,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 219 [2021-06-11 15:50:03,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:50:03,693 INFO L129 PetriNetUnfolder]: 83/228 cut-off events. [2021-06-11 15:50:03,693 INFO L130 PetriNetUnfolder]: For 340/421 co-relation queries the response was YES. [2021-06-11 15:50:03,695 INFO L84 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 228 events. 83/228 cut-off events. For 340/421 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1190 event pairs, 48 based on Foata normal form. 7/212 useless extension candidates. Maximal degree in co-relation 655. Up to 132 conditions per place. [2021-06-11 15:50:03,696 INFO L132 encePairwiseOnDemand]: 213/219 looper letters, 8 selfloop transitions, 11 changer transitions 0/41 dead transitions. [2021-06-11 15:50:03,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 41 transitions, 212 flow [2021-06-11 15:50:03,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:50:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:50:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 877 transitions. [2021-06-11 15:50:03,699 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8009132420091324 [2021-06-11 15:50:03,699 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 877 transitions. [2021-06-11 15:50:03,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 877 transitions. [2021-06-11 15:50:03,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:50:03,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 877 transitions. [2021-06-11 15:50:03,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.4) internal successors, (877), 5 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,704 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,704 INFO L185 Difference]: Start difference. First operand has 46 places, 34 transitions, 140 flow. Second operand 5 states and 877 transitions. [2021-06-11 15:50:03,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 41 transitions, 212 flow [2021-06-11 15:50:03,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 41 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 15:50:03,708 INFO L241 Difference]: Finished difference. Result has 53 places, 41 transitions, 222 flow [2021-06-11 15:50:03,708 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2021-06-11 15:50:03,708 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2021-06-11 15:50:03,708 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:50:03,708 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 41 transitions, 222 flow [2021-06-11 15:50:03,708 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 41 transitions, 222 flow [2021-06-11 15:50:03,709 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 41 transitions, 222 flow [2021-06-11 15:50:03,729 INFO L129 PetriNetUnfolder]: 43/140 cut-off events. [2021-06-11 15:50:03,729 INFO L130 PetriNetUnfolder]: For 289/334 co-relation queries the response was YES. [2021-06-11 15:50:03,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 140 events. 43/140 cut-off events. For 289/334 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 645 event pairs, 10 based on Foata normal form. 2/121 useless extension candidates. Maximal degree in co-relation 441. Up to 52 conditions per place. [2021-06-11 15:50:03,732 INFO L151 LiptonReduction]: Number of co-enabled transitions 618 [2021-06-11 15:50:03,740 INFO L163 LiptonReduction]: Checked pairs total: 248 [2021-06-11 15:50:03,740 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:50:03,740 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-06-11 15:50:03,740 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 222 flow [2021-06-11 15:50:03,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:03,741 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:03,741 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:50:03,741 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-11 15:50:03,741 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:03,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:03,742 INFO L82 PathProgramCache]: Analyzing trace with hash 582458604, now seen corresponding path program 1 times [2021-06-11 15:50:03,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:03,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324557982] [2021-06-11 15:50:03,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:50:03,826 INFO L142 QuantifierPusher]: treesize reduction 10, result has 61.5 percent of original size [2021-06-11 15:50:03,827 INFO L147 QuantifierPusher]: treesize reduction 5, result has 68.8 percent of original size 11 [2021-06-11 15:50:03,843 INFO L142 QuantifierPusher]: treesize reduction 15, result has 48.3 percent of original size [2021-06-11 15:50:03,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:50:03,853 INFO L142 QuantifierPusher]: treesize reduction 15, result has 50.0 percent of original size [2021-06-11 15:50:03,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 15:50:03,868 INFO L142 QuantifierPusher]: treesize reduction 4, result has 75.0 percent of original size [2021-06-11 15:50:03,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 15:50:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:50:03,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324557982] [2021-06-11 15:50:03,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:50:03,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:50:03,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215162824] [2021-06-11 15:50:03,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:50:03,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:50:03,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:50:03,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:50:03,881 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 219 [2021-06-11 15:50:03,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 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-06-11 15:50:03,882 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:50:03,882 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 219 [2021-06-11 15:50:03,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:50:04,066 INFO L129 PetriNetUnfolder]: 75/224 cut-off events. [2021-06-11 15:50:04,066 INFO L130 PetriNetUnfolder]: For 597/668 co-relation queries the response was YES. [2021-06-11 15:50:04,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 224 events. 75/224 cut-off events. For 597/668 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1225 event pairs, 4 based on Foata normal form. 15/218 useless extension candidates. Maximal degree in co-relation 734. Up to 82 conditions per place. [2021-06-11 15:50:04,068 INFO L132 encePairwiseOnDemand]: 213/219 looper letters, 13 selfloop transitions, 13 changer transitions 0/48 dead transitions. [2021-06-11 15:50:04,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 48 transitions, 307 flow [2021-06-11 15:50:04,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 15:50:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 15:50:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1033 transitions. [2021-06-11 15:50:04,072 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7861491628614916 [2021-06-11 15:50:04,072 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1033 transitions. [2021-06-11 15:50:04,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1033 transitions. [2021-06-11 15:50:04,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:50:04,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1033 transitions. [2021-06-11 15:50:04,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:04,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:04,077 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:04,077 INFO L185 Difference]: Start difference. First operand has 53 places, 41 transitions, 222 flow. Second operand 6 states and 1033 transitions. [2021-06-11 15:50:04,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 48 transitions, 307 flow [2021-06-11 15:50:04,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 295 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-06-11 15:50:04,079 INFO L241 Difference]: Finished difference. Result has 58 places, 45 transitions, 266 flow [2021-06-11 15:50:04,079 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2021-06-11 15:50:04,079 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2021-06-11 15:50:04,080 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:50:04,080 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 45 transitions, 266 flow [2021-06-11 15:50:04,080 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 45 transitions, 266 flow [2021-06-11 15:50:04,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 45 transitions, 266 flow [2021-06-11 15:50:04,104 INFO L129 PetriNetUnfolder]: 64/192 cut-off events. [2021-06-11 15:50:04,104 INFO L130 PetriNetUnfolder]: For 664/729 co-relation queries the response was YES. [2021-06-11 15:50:04,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 192 events. 64/192 cut-off events. For 664/729 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 998 event pairs, 10 based on Foata normal form. 2/163 useless extension candidates. Maximal degree in co-relation 667. Up to 73 conditions per place. [2021-06-11 15:50:04,108 INFO L151 LiptonReduction]: Number of co-enabled transitions 694 [2021-06-11 15:50:04,112 INFO L163 LiptonReduction]: Checked pairs total: 272 [2021-06-11 15:50:04,113 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:50:04,113 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-06-11 15:50:04,113 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 266 flow [2021-06-11 15:50:04,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 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-06-11 15:50:04,114 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:04,114 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:50:04,114 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 15:50:04,114 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:04,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:04,114 INFO L82 PathProgramCache]: Analyzing trace with hash 876285221, now seen corresponding path program 1 times [2021-06-11 15:50:04,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:04,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475117391] [2021-06-11 15:50:04,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:50:04,164 INFO L142 QuantifierPusher]: treesize reduction 10, result has 63.0 percent of original size [2021-06-11 15:50:04,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 15:50:04,175 INFO L142 QuantifierPusher]: treesize reduction 10, result has 66.7 percent of original size [2021-06-11 15:50:04,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 15:50:04,191 INFO L142 QuantifierPusher]: treesize reduction 10, result has 58.3 percent of original size [2021-06-11 15:50:04,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:50:04,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:04,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 15:50:04,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:04,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 15:50:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:50:04,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475117391] [2021-06-11 15:50:04,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:50:04,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:50:04,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624710974] [2021-06-11 15:50:04,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:50:04,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:50:04,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:50:04,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:50:04,236 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 219 [2021-06-11 15:50:04,237 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 266 flow. Second operand has 7 states, 7 states have (on average 165.85714285714286) internal successors, (1161), 7 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:04,237 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:50:04,237 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 219 [2021-06-11 15:50:04,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:50:04,349 INFO L129 PetriNetUnfolder]: 87/254 cut-off events. [2021-06-11 15:50:04,350 INFO L130 PetriNetUnfolder]: For 720/782 co-relation queries the response was YES. [2021-06-11 15:50:04,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 254 events. 87/254 cut-off events. For 720/782 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1382 event pairs, 7 based on Foata normal form. 12/245 useless extension candidates. Maximal degree in co-relation 960. Up to 121 conditions per place. [2021-06-11 15:50:04,353 INFO L132 encePairwiseOnDemand]: 213/219 looper letters, 18 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2021-06-11 15:50:04,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 356 flow [2021-06-11 15:50:04,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:50:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:50:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 841 transitions. [2021-06-11 15:50:04,356 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7680365296803653 [2021-06-11 15:50:04,356 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 841 transitions. [2021-06-11 15:50:04,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 841 transitions. [2021-06-11 15:50:04,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:50:04,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 841 transitions. [2021-06-11 15:50:04,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 168.2) internal successors, (841), 5 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:04,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:04,360 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:04,360 INFO L185 Difference]: Start difference. First operand has 58 places, 45 transitions, 266 flow. Second operand 5 states and 841 transitions. [2021-06-11 15:50:04,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 356 flow [2021-06-11 15:50:04,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 50 transitions, 342 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-06-11 15:50:04,364 INFO L241 Difference]: Finished difference. Result has 61 places, 48 transitions, 308 flow [2021-06-11 15:50:04,364 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=308, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2021-06-11 15:50:04,364 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2021-06-11 15:50:04,364 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:50:04,364 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 48 transitions, 308 flow [2021-06-11 15:50:04,364 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 48 transitions, 308 flow [2021-06-11 15:50:04,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 48 transitions, 308 flow [2021-06-11 15:50:04,389 INFO L129 PetriNetUnfolder]: 53/181 cut-off events. [2021-06-11 15:50:04,389 INFO L130 PetriNetUnfolder]: For 569/589 co-relation queries the response was YES. [2021-06-11 15:50:04,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 181 events. 53/181 cut-off events. For 569/589 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 893 event pairs, 11 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 662. Up to 66 conditions per place. [2021-06-11 15:50:04,393 INFO L151 LiptonReduction]: Number of co-enabled transitions 752 [2021-06-11 15:50:04,399 INFO L163 LiptonReduction]: Checked pairs total: 362 [2021-06-11 15:50:04,399 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:50:04,400 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 36 [2021-06-11 15:50:04,400 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 308 flow [2021-06-11 15:50:04,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 165.85714285714286) internal successors, (1161), 7 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:04,401 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:04,401 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:50:04,401 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-11 15:50:04,401 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:04,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:04,401 INFO L82 PathProgramCache]: Analyzing trace with hash -90109745, now seen corresponding path program 2 times [2021-06-11 15:50:04,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:04,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308905886] [2021-06-11 15:50:04,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:50:04,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:04,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:50:04,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:04,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:50:04,470 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.4 percent of original size [2021-06-11 15:50:04,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-06-11 15:50:04,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:04,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 15:50:04,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:04,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 15:50:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:50:04,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308905886] [2021-06-11 15:50:04,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:50:04,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:50:04,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035260383] [2021-06-11 15:50:04,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:50:04,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:50:04,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:50:04,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:50:04,519 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 219 [2021-06-11 15:50:04,519 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 308 flow. Second operand has 7 states, 7 states have (on average 166.85714285714286) internal successors, (1168), 7 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:04,519 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:50:04,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 219 [2021-06-11 15:50:04,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:50:04,657 INFO L129 PetriNetUnfolder]: 80/241 cut-off events. [2021-06-11 15:50:04,657 INFO L130 PetriNetUnfolder]: For 881/937 co-relation queries the response was YES. [2021-06-11 15:50:04,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 241 events. 80/241 cut-off events. For 881/937 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1305 event pairs, 9 based on Foata normal form. 12/234 useless extension candidates. Maximal degree in co-relation 987. Up to 86 conditions per place. [2021-06-11 15:50:04,660 INFO L132 encePairwiseOnDemand]: 214/219 looper letters, 14 selfloop transitions, 14 changer transitions 0/50 dead transitions. [2021-06-11 15:50:04,661 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 50 transitions, 380 flow [2021-06-11 15:50:04,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:50:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:50:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 846 transitions. [2021-06-11 15:50:04,664 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7726027397260274 [2021-06-11 15:50:04,664 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 846 transitions. [2021-06-11 15:50:04,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 846 transitions. [2021-06-11 15:50:04,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:50:04,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 846 transitions. [2021-06-11 15:50:04,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 169.2) internal successors, (846), 5 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-06-11 15:50:04,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:04,667 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:04,668 INFO L185 Difference]: Start difference. First operand has 61 places, 48 transitions, 308 flow. Second operand 5 states and 846 transitions. [2021-06-11 15:50:04,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 50 transitions, 380 flow [2021-06-11 15:50:04,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 50 transitions, 353 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-06-11 15:50:04,671 INFO L241 Difference]: Finished difference. Result has 63 places, 48 transitions, 322 flow [2021-06-11 15:50:04,672 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=322, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2021-06-11 15:50:04,672 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2021-06-11 15:50:04,672 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:50:04,672 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 48 transitions, 322 flow [2021-06-11 15:50:04,672 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 48 transitions, 322 flow [2021-06-11 15:50:04,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 48 transitions, 322 flow [2021-06-11 15:50:04,696 INFO L129 PetriNetUnfolder]: 50/169 cut-off events. [2021-06-11 15:50:04,697 INFO L130 PetriNetUnfolder]: For 894/932 co-relation queries the response was YES. [2021-06-11 15:50:04,698 INFO L84 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 169 events. 50/169 cut-off events. For 894/932 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 818 event pairs, 7 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 659. Up to 54 conditions per place. [2021-06-11 15:50:04,700 INFO L151 LiptonReduction]: Number of co-enabled transitions 750 [2021-06-11 15:50:04,706 INFO L163 LiptonReduction]: Checked pairs total: 355 [2021-06-11 15:50:04,706 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:50:04,706 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34 [2021-06-11 15:50:04,706 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 322 flow [2021-06-11 15:50:04,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 166.85714285714286) internal successors, (1168), 7 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:04,707 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:04,707 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:50:04,707 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-11 15:50:04,707 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:04,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:04,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1525232101, now seen corresponding path program 1 times [2021-06-11 15:50:04,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:04,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832802996] [2021-06-11 15:50:04,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:50:04,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:04,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:50:04,752 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:50:04,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:50:04,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:04,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:50:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:50:04,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832802996] [2021-06-11 15:50:04,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:50:04,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:50:04,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899014981] [2021-06-11 15:50:04,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:50:04,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:50:04,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:50:04,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:50:04,762 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 219 [2021-06-11 15:50:04,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 322 flow. Second operand has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:04,763 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:50:04,763 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 219 [2021-06-11 15:50:04,763 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:50:04,951 INFO L129 PetriNetUnfolder]: 686/1317 cut-off events. [2021-06-11 15:50:04,951 INFO L130 PetriNetUnfolder]: For 3553/4098 co-relation queries the response was YES. [2021-06-11 15:50:05,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4234 conditions, 1317 events. 686/1317 cut-off events. For 3553/4098 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 9378 event pairs, 217 based on Foata normal form. 170/1268 useless extension candidates. Maximal degree in co-relation 4208. Up to 769 conditions per place. [2021-06-11 15:50:05,015 INFO L132 encePairwiseOnDemand]: 212/219 looper letters, 13 selfloop transitions, 10 changer transitions 0/61 dead transitions. [2021-06-11 15:50:05,015 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 61 transitions, 394 flow [2021-06-11 15:50:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:50:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:50:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 912 transitions. [2021-06-11 15:50:05,018 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8328767123287671 [2021-06-11 15:50:05,018 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 912 transitions. [2021-06-11 15:50:05,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 912 transitions. [2021-06-11 15:50:05,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:50:05,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 912 transitions. [2021-06-11 15:50:05,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.4) internal successors, (912), 5 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:05,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:05,023 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:05,024 INFO L185 Difference]: Start difference. First operand has 63 places, 48 transitions, 322 flow. Second operand 5 states and 912 transitions. [2021-06-11 15:50:05,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 61 transitions, 394 flow [2021-06-11 15:50:05,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 364 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-06-11 15:50:05,031 INFO L241 Difference]: Finished difference. Result has 66 places, 57 transitions, 379 flow [2021-06-11 15:50:05,031 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=379, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2021-06-11 15:50:05,033 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places. [2021-06-11 15:50:05,033 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:50:05,033 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 57 transitions, 379 flow [2021-06-11 15:50:05,033 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 57 transitions, 379 flow [2021-06-11 15:50:05,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 57 transitions, 379 flow [2021-06-11 15:50:05,143 INFO L129 PetriNetUnfolder]: 579/1052 cut-off events. [2021-06-11 15:50:05,143 INFO L130 PetriNetUnfolder]: For 2588/2866 co-relation queries the response was YES. [2021-06-11 15:50:05,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3807 conditions, 1052 events. 579/1052 cut-off events. For 2588/2866 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 6922 event pairs, 232 based on Foata normal form. 4/870 useless extension candidates. Maximal degree in co-relation 3780. Up to 716 conditions per place. [2021-06-11 15:50:05,164 INFO L151 LiptonReduction]: Number of co-enabled transitions 984 [2021-06-11 15:50:05,173 INFO L163 LiptonReduction]: Checked pairs total: 285 [2021-06-11 15:50:05,173 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:50:05,173 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 140 [2021-06-11 15:50:05,175 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 379 flow [2021-06-11 15:50:05,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:05,176 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:05,176 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:50:05,176 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-11 15:50:05,176 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:05,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:05,176 INFO L82 PathProgramCache]: Analyzing trace with hash 348611685, now seen corresponding path program 1 times [2021-06-11 15:50:05,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:05,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502674866] [2021-06-11 15:50:05,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:50:05,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:05,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:50:05,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:05,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:50:05,244 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:50:05,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:50:05,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:05,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:50:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:50:05,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502674866] [2021-06-11 15:50:05,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:50:05,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:50:05,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213807721] [2021-06-11 15:50:05,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:50:05,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:50:05,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:50:05,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:50:05,256 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 219 [2021-06-11 15:50:05,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 379 flow. Second operand has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:05,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:50:05,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 219 [2021-06-11 15:50:05,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:50:05,445 INFO L129 PetriNetUnfolder]: 463/982 cut-off events. [2021-06-11 15:50:05,445 INFO L130 PetriNetUnfolder]: For 4264/7288 co-relation queries the response was YES. [2021-06-11 15:50:05,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4197 conditions, 982 events. 463/982 cut-off events. For 4264/7288 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 6955 event pairs, 44 based on Foata normal form. 349/1170 useless extension candidates. Maximal degree in co-relation 4168. Up to 677 conditions per place. [2021-06-11 15:50:05,458 INFO L132 encePairwiseOnDemand]: 212/219 looper letters, 13 selfloop transitions, 19 changer transitions 0/70 dead transitions. [2021-06-11 15:50:05,459 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 70 transitions, 519 flow [2021-06-11 15:50:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:50:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:50:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1277 transitions. [2021-06-11 15:50:05,462 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8330071754729289 [2021-06-11 15:50:05,462 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1277 transitions. [2021-06-11 15:50:05,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1277 transitions. [2021-06-11 15:50:05,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:50:05,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1277 transitions. [2021-06-11 15:50:05,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 182.42857142857142) internal successors, (1277), 7 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:05,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:05,468 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:05,468 INFO L185 Difference]: Start difference. First operand has 66 places, 57 transitions, 379 flow. Second operand 7 states and 1277 transitions. [2021-06-11 15:50:05,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 70 transitions, 519 flow [2021-06-11 15:50:05,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 70 transitions, 514 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:50:05,476 INFO L241 Difference]: Finished difference. Result has 74 places, 66 transitions, 520 flow [2021-06-11 15:50:05,476 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=520, PETRI_PLACES=74, PETRI_TRANSITIONS=66} [2021-06-11 15:50:05,476 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2021-06-11 15:50:05,477 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:50:05,477 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 66 transitions, 520 flow [2021-06-11 15:50:05,477 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 66 transitions, 520 flow [2021-06-11 15:50:05,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 66 transitions, 520 flow [2021-06-11 15:50:05,573 INFO L129 PetriNetUnfolder]: 426/860 cut-off events. [2021-06-11 15:50:05,573 INFO L130 PetriNetUnfolder]: For 3813/4596 co-relation queries the response was YES. [2021-06-11 15:50:05,580 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4265 conditions, 860 events. 426/860 cut-off events. For 3813/4596 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 5945 event pairs, 55 based on Foata normal form. 18/743 useless extension candidates. Maximal degree in co-relation 4234. Up to 598 conditions per place. [2021-06-11 15:50:05,591 INFO L151 LiptonReduction]: Number of co-enabled transitions 1128 [2021-06-11 15:50:05,600 INFO L163 LiptonReduction]: Checked pairs total: 332 [2021-06-11 15:50:05,600 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:50:05,600 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 123 [2021-06-11 15:50:05,601 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 66 transitions, 520 flow [2021-06-11 15:50:05,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:05,601 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:05,601 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:50:05,602 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-11 15:50:05,602 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:05,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:05,602 INFO L82 PathProgramCache]: Analyzing trace with hash 889850722, now seen corresponding path program 1 times [2021-06-11 15:50:05,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:05,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104742581] [2021-06-11 15:50:05,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:50:05,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:05,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:50:05,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:05,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:50:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:50:05,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104742581] [2021-06-11 15:50:05,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:50:05,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:50:05,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258812882] [2021-06-11 15:50:05,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:50:05,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:50:05,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:50:05,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:50:05,662 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 219 [2021-06-11 15:50:05,663 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 66 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:05,663 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:50:05,663 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 219 [2021-06-11 15:50:05,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:50:05,878 INFO L129 PetriNetUnfolder]: 738/1457 cut-off events. [2021-06-11 15:50:05,878 INFO L130 PetriNetUnfolder]: For 7434/10828 co-relation queries the response was YES. [2021-06-11 15:50:05,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7292 conditions, 1457 events. 738/1457 cut-off events. For 7434/10828 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 10658 event pairs, 75 based on Foata normal form. 41/1229 useless extension candidates. Maximal degree in co-relation 7259. Up to 1073 conditions per place. [2021-06-11 15:50:05,897 INFO L132 encePairwiseOnDemand]: 216/219 looper letters, 3 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2021-06-11 15:50:05,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 66 transitions, 532 flow [2021-06-11 15:50:05,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:50:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:50:05,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2021-06-11 15:50:05,900 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8721461187214612 [2021-06-11 15:50:05,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 573 transitions. [2021-06-11 15:50:05,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 573 transitions. [2021-06-11 15:50:05,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:50:05,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 573 transitions. [2021-06-11 15:50:05,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:05,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:05,903 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:05,904 INFO L185 Difference]: Start difference. First operand has 74 places, 66 transitions, 520 flow. Second operand 3 states and 573 transitions. [2021-06-11 15:50:05,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 66 transitions, 532 flow [2021-06-11 15:50:05,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 66 transitions, 482 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-06-11 15:50:05,947 INFO L241 Difference]: Finished difference. Result has 74 places, 66 transitions, 481 flow [2021-06-11 15:50:05,947 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=481, PETRI_PLACES=74, PETRI_TRANSITIONS=66} [2021-06-11 15:50:05,947 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2021-06-11 15:50:05,947 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:50:05,947 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 66 transitions, 481 flow [2021-06-11 15:50:05,948 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 66 transitions, 481 flow [2021-06-11 15:50:05,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 66 transitions, 481 flow [2021-06-11 15:50:06,115 INFO L129 PetriNetUnfolder]: 735/1442 cut-off events. [2021-06-11 15:50:06,115 INFO L130 PetriNetUnfolder]: For 6786/7336 co-relation queries the response was YES. [2021-06-11 15:50:06,124 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6398 conditions, 1442 events. 735/1442 cut-off events. For 6786/7336 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 10739 event pairs, 95 based on Foata normal form. 23/1232 useless extension candidates. Maximal degree in co-relation 6367. Up to 926 conditions per place. [2021-06-11 15:50:06,141 INFO L151 LiptonReduction]: Number of co-enabled transitions 1128 [2021-06-11 15:50:06,152 INFO L163 LiptonReduction]: Checked pairs total: 332 [2021-06-11 15:50:06,152 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:50:06,152 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 205 [2021-06-11 15:50:06,152 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 66 transitions, 481 flow [2021-06-11 15:50:06,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:06,153 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:06,153 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-06-11 15:50:06,153 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-11 15:50:06,153 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:06,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:06,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1966323385, now seen corresponding path program 1 times [2021-06-11 15:50:06,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:06,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976619713] [2021-06-11 15:50:06,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:50:06,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:06,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:50:06,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:06,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:50:06,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:06,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:50:06,220 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:50:06,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:50:06,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:06,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:50:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:50:06,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976619713] [2021-06-11 15:50:06,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:50:06,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:50:06,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031876646] [2021-06-11 15:50:06,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:50:06,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:50:06,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:50:06,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:50:06,233 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 219 [2021-06-11 15:50:06,234 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 66 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:06,234 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:50:06,234 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 219 [2021-06-11 15:50:06,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:50:06,438 INFO L129 PetriNetUnfolder]: 527/1102 cut-off events. [2021-06-11 15:50:06,439 INFO L130 PetriNetUnfolder]: For 8660/14498 co-relation queries the response was YES. [2021-06-11 15:50:06,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5529 conditions, 1102 events. 527/1102 cut-off events. For 8660/14498 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 7919 event pairs, 4 based on Foata normal form. 543/1414 useless extension candidates. Maximal degree in co-relation 5496. Up to 739 conditions per place. [2021-06-11 15:50:06,452 INFO L132 encePairwiseOnDemand]: 212/219 looper letters, 7 selfloop transitions, 28 changer transitions 4/71 dead transitions. [2021-06-11 15:50:06,453 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 71 transitions, 604 flow [2021-06-11 15:50:06,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 15:50:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 15:50:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1642 transitions. [2021-06-11 15:50:06,457 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8330796549974632 [2021-06-11 15:50:06,457 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1642 transitions. [2021-06-11 15:50:06,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1642 transitions. [2021-06-11 15:50:06,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:50:06,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1642 transitions. [2021-06-11 15:50:06,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 182.44444444444446) internal successors, (1642), 9 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:06,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:06,477 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:06,477 INFO L185 Difference]: Start difference. First operand has 74 places, 66 transitions, 481 flow. Second operand 9 states and 1642 transitions. [2021-06-11 15:50:06,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 71 transitions, 604 flow [2021-06-11 15:50:06,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 71 transitions, 586 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-06-11 15:50:06,490 INFO L241 Difference]: Finished difference. Result has 80 places, 67 transitions, 564 flow [2021-06-11 15:50:06,490 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=564, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2021-06-11 15:50:06,490 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places. [2021-06-11 15:50:06,490 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:50:06,490 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 67 transitions, 564 flow [2021-06-11 15:50:06,490 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 67 transitions, 564 flow [2021-06-11 15:50:06,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 67 transitions, 564 flow [2021-06-11 15:50:06,588 INFO L129 PetriNetUnfolder]: 491/1049 cut-off events. [2021-06-11 15:50:06,589 INFO L130 PetriNetUnfolder]: For 7060/7867 co-relation queries the response was YES. [2021-06-11 15:50:06,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5651 conditions, 1049 events. 491/1049 cut-off events. For 7060/7867 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 7841 event pairs, 4 based on Foata normal form. 16/860 useless extension candidates. Maximal degree in co-relation 5618. Up to 687 conditions per place. [2021-06-11 15:50:06,611 INFO L151 LiptonReduction]: Number of co-enabled transitions 1180 [2021-06-11 15:50:06,620 INFO L163 LiptonReduction]: Checked pairs total: 275 [2021-06-11 15:50:06,620 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:50:06,620 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 130 [2021-06-11 15:50:06,621 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 564 flow [2021-06-11 15:50:06,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:06,621 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:06,621 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:50:06,621 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-11 15:50:06,621 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:06,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:06,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1384510265, now seen corresponding path program 1 times [2021-06-11 15:50:06,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:06,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478311413] [2021-06-11 15:50:06,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:50:06,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:06,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:50:06,674 INFO L142 QuantifierPusher]: treesize reduction 7, result has 74.1 percent of original size [2021-06-11 15:50:06,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 15:50:06,690 INFO L142 QuantifierPusher]: treesize reduction 7, result has 76.7 percent of original size [2021-06-11 15:50:06,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 15:50:06,725 INFO L142 QuantifierPusher]: treesize reduction 7, result has 76.7 percent of original size [2021-06-11 15:50:06,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 15:50:06,744 INFO L142 QuantifierPusher]: treesize reduction 8, result has 80.0 percent of original size [2021-06-11 15:50:06,745 INFO L147 QuantifierPusher]: treesize reduction 9, result has 71.9 percent of original size 23 [2021-06-11 15:50:06,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:06,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:50:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:50:06,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478311413] [2021-06-11 15:50:06,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:50:06,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:50:06,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176940283] [2021-06-11 15:50:06,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:50:06,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:50:06,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:50:06,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:50:06,760 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 219 [2021-06-11 15:50:06,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 564 flow. Second operand has 6 states, 6 states have (on average 169.16666666666666) internal successors, (1015), 6 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:06,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:50:06,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 219 [2021-06-11 15:50:06,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:50:07,194 INFO L129 PetriNetUnfolder]: 1309/2923 cut-off events. [2021-06-11 15:50:07,195 INFO L130 PetriNetUnfolder]: For 22347/25769 co-relation queries the response was YES. [2021-06-11 15:50:07,217 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15149 conditions, 2923 events. 1309/2923 cut-off events. For 22347/25769 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 27847 event pairs, 39 based on Foata normal form. 125/2659 useless extension candidates. Maximal degree in co-relation 15114. Up to 1749 conditions per place. [2021-06-11 15:50:07,234 INFO L132 encePairwiseOnDemand]: 212/219 looper letters, 16 selfloop transitions, 18 changer transitions 4/88 dead transitions. [2021-06-11 15:50:07,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 88 transitions, 834 flow [2021-06-11 15:50:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 15:50:07,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 15:50:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1032 transitions. [2021-06-11 15:50:07,237 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7853881278538812 [2021-06-11 15:50:07,237 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1032 transitions. [2021-06-11 15:50:07,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1032 transitions. [2021-06-11 15:50:07,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:50:07,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1032 transitions. [2021-06-11 15:50:07,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 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-06-11 15:50:07,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:07,242 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:07,242 INFO L185 Difference]: Start difference. First operand has 80 places, 67 transitions, 564 flow. Second operand 6 states and 1032 transitions. [2021-06-11 15:50:07,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 88 transitions, 834 flow [2021-06-11 15:50:07,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 88 transitions, 737 flow, removed 34 selfloop flow, removed 4 redundant places. [2021-06-11 15:50:07,548 INFO L241 Difference]: Finished difference. Result has 85 places, 79 transitions, 635 flow [2021-06-11 15:50:07,548 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=635, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2021-06-11 15:50:07,548 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 41 predicate places. [2021-06-11 15:50:07,548 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:50:07,549 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 79 transitions, 635 flow [2021-06-11 15:50:07,549 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 79 transitions, 635 flow [2021-06-11 15:50:07,549 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 79 transitions, 635 flow [2021-06-11 15:50:07,798 INFO L129 PetriNetUnfolder]: 1219/2696 cut-off events. [2021-06-11 15:50:07,798 INFO L130 PetriNetUnfolder]: For 10185/10662 co-relation queries the response was YES. [2021-06-11 15:50:07,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10133 conditions, 2696 events. 1219/2696 cut-off events. For 10185/10662 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 25343 event pairs, 29 based on Foata normal form. 54/2372 useless extension candidates. Maximal degree in co-relation 10096. Up to 784 conditions per place. [2021-06-11 15:50:07,856 INFO L151 LiptonReduction]: Number of co-enabled transitions 1572 [2021-06-11 15:50:07,868 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 15:50:07,868 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:50:07,868 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 320 [2021-06-11 15:50:07,871 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 635 flow [2021-06-11 15:50:07,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 169.16666666666666) internal successors, (1015), 6 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:07,872 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:07,872 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:50:07,872 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-11 15:50:07,872 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:07,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:07,872 INFO L82 PathProgramCache]: Analyzing trace with hash -901967739, now seen corresponding path program 2 times [2021-06-11 15:50:07,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:07,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617668940] [2021-06-11 15:50:07,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:50:07,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:07,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:50:07,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:07,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:50:07,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:07,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:50:07,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:07,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:50:07,954 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:50:07,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:50:07,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:07,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:50:07,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-06-11 15:50:07,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617668940] [2021-06-11 15:50:07,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:50:07,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 15:50:07,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132055436] [2021-06-11 15:50:07,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:50:07,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:50:07,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:50:07,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:50:07,970 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 219 [2021-06-11 15:50:07,971 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 635 flow. Second operand has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:07,971 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:50:07,971 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 219 [2021-06-11 15:50:07,971 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:50:08,431 INFO L129 PetriNetUnfolder]: 1166/2609 cut-off events. [2021-06-11 15:50:08,431 INFO L130 PetriNetUnfolder]: For 14947/23061 co-relation queries the response was YES. [2021-06-11 15:50:08,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11476 conditions, 2609 events. 1166/2609 cut-off events. For 14947/23061 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 24508 event pairs, 9 based on Foata normal form. 1542/3785 useless extension candidates. Maximal degree in co-relation 11437. Up to 770 conditions per place. [2021-06-11 15:50:08,474 INFO L132 encePairwiseOnDemand]: 212/219 looper letters, 2 selfloop transitions, 33 changer transitions 4/81 dead transitions. [2021-06-11 15:50:08,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 81 transitions, 716 flow [2021-06-11 15:50:08,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 15:50:08,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 15:50:08,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1999 transitions. [2021-06-11 15:50:08,479 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8298048982980489 [2021-06-11 15:50:08,479 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1999 transitions. [2021-06-11 15:50:08,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1999 transitions. [2021-06-11 15:50:08,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:50:08,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1999 transitions. [2021-06-11 15:50:08,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 181.72727272727272) internal successors, (1999), 11 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:08,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 219.0) internal successors, (2628), 12 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:08,488 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 219.0) internal successors, (2628), 12 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:08,488 INFO L185 Difference]: Start difference. First operand has 85 places, 79 transitions, 635 flow. Second operand 11 states and 1999 transitions. [2021-06-11 15:50:08,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 81 transitions, 716 flow [2021-06-11 15:50:08,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 81 transitions, 651 flow, removed 8 selfloop flow, removed 6 redundant places. [2021-06-11 15:50:08,615 INFO L241 Difference]: Finished difference. Result has 92 places, 77 transitions, 611 flow [2021-06-11 15:50:08,616 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=611, PETRI_PLACES=92, PETRI_TRANSITIONS=77} [2021-06-11 15:50:08,616 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2021-06-11 15:50:08,616 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:50:08,616 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 77 transitions, 611 flow [2021-06-11 15:50:08,616 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 77 transitions, 611 flow [2021-06-11 15:50:08,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 77 transitions, 611 flow [2021-06-11 15:50:08,832 INFO L129 PetriNetUnfolder]: 1105/2479 cut-off events. [2021-06-11 15:50:08,832 INFO L130 PetriNetUnfolder]: For 9217/10370 co-relation queries the response was YES. [2021-06-11 15:50:08,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10797 conditions, 2479 events. 1105/2479 cut-off events. For 9217/10370 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 23635 event pairs, 7 based on Foata normal form. 23/2143 useless extension candidates. Maximal degree in co-relation 10760. Up to 735 conditions per place. [2021-06-11 15:50:08,884 INFO L151 LiptonReduction]: Number of co-enabled transitions 1542 [2021-06-11 15:50:08,908 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 15:50:08,908 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:50:08,908 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 292 [2021-06-11 15:50:08,909 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 77 transitions, 611 flow [2021-06-11 15:50:08,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:08,910 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:08,910 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:50:08,910 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-11 15:50:08,910 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:08,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:08,911 INFO L82 PathProgramCache]: Analyzing trace with hash -155993539, now seen corresponding path program 1 times [2021-06-11 15:50:08,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:08,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085608708] [2021-06-11 15:50:08,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:50:08,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:08,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:50:08,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:08,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:50:08,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:08,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:50:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:50:08,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085608708] [2021-06-11 15:50:08,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:50:08,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:50:08,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002100015] [2021-06-11 15:50:08,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:50:08,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:50:08,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:50:08,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:50:08,976 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 219 [2021-06-11 15:50:08,977 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 77 transitions, 611 flow. Second operand has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:08,977 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:50:08,977 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 219 [2021-06-11 15:50:08,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:50:09,302 INFO L129 PetriNetUnfolder]: 1384/3077 cut-off events. [2021-06-11 15:50:09,303 INFO L130 PetriNetUnfolder]: For 12088/13954 co-relation queries the response was YES. [2021-06-11 15:50:09,320 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13477 conditions, 3077 events. 1384/3077 cut-off events. For 12088/13954 co-relation queries the response was YES. Maximal size of possible extension queue 757. Compared 30015 event pairs, 4 based on Foata normal form. 31/2601 useless extension candidates. Maximal degree in co-relation 13438. Up to 940 conditions per place. [2021-06-11 15:50:09,324 INFO L132 encePairwiseOnDemand]: 216/219 looper letters, 3 selfloop transitions, 2 changer transitions 18/78 dead transitions. [2021-06-11 15:50:09,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 78 transitions, 629 flow [2021-06-11 15:50:09,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:50:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:50:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 754 transitions. [2021-06-11 15:50:09,327 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.860730593607306 [2021-06-11 15:50:09,327 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 754 transitions. [2021-06-11 15:50:09,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 754 transitions. [2021-06-11 15:50:09,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:50:09,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 754 transitions. [2021-06-11 15:50:09,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 188.5) internal successors, (754), 4 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:09,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:09,331 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:09,331 INFO L185 Difference]: Start difference. First operand has 91 places, 77 transitions, 611 flow. Second operand 4 states and 754 transitions. [2021-06-11 15:50:09,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 78 transitions, 629 flow [2021-06-11 15:50:09,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 78 transitions, 518 flow, removed 25 selfloop flow, removed 10 redundant places. [2021-06-11 15:50:09,537 INFO L241 Difference]: Finished difference. Result has 86 places, 60 transitions, 381 flow [2021-06-11 15:50:09,537 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=381, PETRI_PLACES=86, PETRI_TRANSITIONS=60} [2021-06-11 15:50:09,537 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 42 predicate places. [2021-06-11 15:50:09,537 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:50:09,537 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 60 transitions, 381 flow [2021-06-11 15:50:09,538 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 60 transitions, 381 flow [2021-06-11 15:50:09,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 60 transitions, 381 flow [2021-06-11 15:50:09,599 INFO L129 PetriNetUnfolder]: 372/914 cut-off events. [2021-06-11 15:50:09,600 INFO L130 PetriNetUnfolder]: For 1828/1932 co-relation queries the response was YES. [2021-06-11 15:50:09,603 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3202 conditions, 914 events. 372/914 cut-off events. For 1828/1932 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 7337 event pairs, 0 based on Foata normal form. 14/783 useless extension candidates. Maximal degree in co-relation 3170. Up to 246 conditions per place. [2021-06-11 15:50:09,608 INFO L151 LiptonReduction]: Number of co-enabled transitions 774 [2021-06-11 15:50:09,613 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 15:50:09,613 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:50:09,613 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 76 [2021-06-11 15:50:09,614 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 60 transitions, 381 flow [2021-06-11 15:50:09,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:09,614 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:09,615 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:50:09,615 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-11 15:50:09,615 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:09,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:09,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1032690855, now seen corresponding path program 2 times [2021-06-11 15:50:09,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:09,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761176945] [2021-06-11 15:50:09,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:50:09,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:50:09,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:50:09,678 INFO L142 QuantifierPusher]: treesize reduction 14, result has 56.3 percent of original size [2021-06-11 15:50:09,678 INFO L147 QuantifierPusher]: treesize reduction 4, result has 77.8 percent of original size 14 [2021-06-11 15:50:09,697 INFO L142 QuantifierPusher]: treesize reduction 18, result has 48.6 percent of original size [2021-06-11 15:50:09,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 15:50:09,710 INFO L142 QuantifierPusher]: treesize reduction 18, result has 37.9 percent of original size [2021-06-11 15:50:09,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 15:50:09,721 INFO L142 QuantifierPusher]: treesize reduction 13, result has 53.6 percent of original size [2021-06-11 15:50:09,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 15:50:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:50:09,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761176945] [2021-06-11 15:50:09,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:50:09,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:50:09,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282880415] [2021-06-11 15:50:09,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:50:09,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:50:09,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:50:09,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:50:09,738 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 219 [2021-06-11 15:50:09,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 60 transitions, 381 flow. Second operand has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:09,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:50:09,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 219 [2021-06-11 15:50:09,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:50:09,900 INFO L129 PetriNetUnfolder]: 384/991 cut-off events. [2021-06-11 15:50:09,901 INFO L130 PetriNetUnfolder]: For 2993/3235 co-relation queries the response was YES. [2021-06-11 15:50:09,904 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3524 conditions, 991 events. 384/991 cut-off events. For 2993/3235 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 8038 event pairs, 0 based on Foata normal form. 33/867 useless extension candidates. Maximal degree in co-relation 3490. Up to 260 conditions per place. [2021-06-11 15:50:09,905 INFO L132 encePairwiseOnDemand]: 213/219 looper letters, 5 selfloop transitions, 5 changer transitions 12/62 dead transitions. [2021-06-11 15:50:09,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 62 transitions, 433 flow [2021-06-11 15:50:09,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 15:50:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 15:50:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1013 transitions. [2021-06-11 15:50:09,908 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7709284627092846 [2021-06-11 15:50:09,909 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1013 transitions. [2021-06-11 15:50:09,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1013 transitions. [2021-06-11 15:50:09,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:50:09,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1013 transitions. [2021-06-11 15:50:09,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:09,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:09,913 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:09,913 INFO L185 Difference]: Start difference. First operand has 80 places, 60 transitions, 381 flow. Second operand 6 states and 1013 transitions. [2021-06-11 15:50:09,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 62 transitions, 433 flow [2021-06-11 15:50:09,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 62 transitions, 411 flow, removed 7 selfloop flow, removed 6 redundant places. [2021-06-11 15:50:09,940 INFO L241 Difference]: Finished difference. Result has 81 places, 50 transitions, 316 flow [2021-06-11 15:50:09,940 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=316, PETRI_PLACES=81, PETRI_TRANSITIONS=50} [2021-06-11 15:50:09,941 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2021-06-11 15:50:09,941 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:50:09,941 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 50 transitions, 316 flow [2021-06-11 15:50:09,941 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 50 transitions, 316 flow [2021-06-11 15:50:09,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 50 transitions, 316 flow [2021-06-11 15:50:09,955 INFO L129 PetriNetUnfolder]: 45/165 cut-off events. [2021-06-11 15:50:09,955 INFO L130 PetriNetUnfolder]: For 300/322 co-relation queries the response was YES. [2021-06-11 15:50:09,956 INFO L84 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 165 events. 45/165 cut-off events. For 300/322 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 808 event pairs, 0 based on Foata normal form. 2/161 useless extension candidates. Maximal degree in co-relation 544. Up to 38 conditions per place. [2021-06-11 15:50:09,957 INFO L151 LiptonReduction]: Number of co-enabled transitions 258 [2021-06-11 15:50:09,959 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 15:50:09,959 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:50:09,960 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-06-11 15:50:09,961 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 50 transitions, 316 flow [2021-06-11 15:50:09,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:50:09,961 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:50:09,961 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:50:09,962 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-11 15:50:09,962 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:50:09,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:50:09,962 INFO L82 PathProgramCache]: Analyzing trace with hash -334180703, now seen corresponding path program 3 times [2021-06-11 15:50:09,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:50:09,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968573457] [2021-06-11 15:50:09,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:50:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:50:09,999 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:50:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:50:10,044 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:50:10,076 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 15:50:10,076 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 15:50:10,077 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-11 15:50:10,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 03:50:10 BasicIcfg [2021-06-11 15:50:10,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 15:50:10,172 INFO L168 Benchmark]: Toolchain (without parser) took 28873.49 ms. Allocated memory was 327.2 MB in the beginning and 692.1 MB in the end (delta: 364.9 MB). Free memory was 288.8 MB in the beginning and 317.7 MB in the end (delta: -28.9 MB). Peak memory consumption was 337.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:50:10,172 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 327.2 MB. Free memory is still 307.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:50:10,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1054.16 ms. Allocated memory is still 327.2 MB. Free memory was 288.6 MB in the beginning and 284.4 MB in the end (delta: 4.3 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.0 GB. [2021-06-11 15:50:10,172 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.01 ms. Allocated memory is still 327.2 MB. Free memory was 284.4 MB in the beginning and 282.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:50:10,172 INFO L168 Benchmark]: Boogie Preprocessor took 71.68 ms. Allocated memory is still 327.2 MB. Free memory was 282.3 MB in the beginning and 279.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-11 15:50:10,172 INFO L168 Benchmark]: RCFGBuilder took 2885.41 ms. Allocated memory is still 327.2 MB. Free memory was 279.1 MB in the beginning and 226.5 MB in the end (delta: 52.6 MB). Peak memory consumption was 132.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:50:10,173 INFO L168 Benchmark]: TraceAbstraction took 24724.44 ms. Allocated memory was 327.2 MB in the beginning and 692.1 MB in the end (delta: 364.9 MB). Free memory was 225.4 MB in the beginning and 317.7 MB in the end (delta: -92.2 MB). Peak memory consumption was 271.6 MB. Max. memory is 16.0 GB. [2021-06-11 15:50:10,173 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.59 ms. Allocated memory is still 327.2 MB. Free memory is still 307.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 1054.16 ms. Allocated memory is still 327.2 MB. Free memory was 288.6 MB in the beginning and 284.4 MB in the end (delta: 4.3 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 130.01 ms. Allocated memory is still 327.2 MB. Free memory was 284.4 MB in the beginning and 282.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 71.68 ms. Allocated memory is still 327.2 MB. Free memory was 282.3 MB in the beginning and 279.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2885.41 ms. Allocated memory is still 327.2 MB. Free memory was 279.1 MB in the beginning and 226.5 MB in the end (delta: 52.6 MB). Peak memory consumption was 132.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 24724.44 ms. Allocated memory was 327.2 MB in the beginning and 692.1 MB in the end (delta: 364.9 MB). Free memory was 225.4 MB in the beginning and 317.7 MB in the end (delta: -92.2 MB). Peak memory consumption was 271.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6903.8ms, 123 PlacesBefore, 44 PlacesAfterwards, 112 TransitionsBefore, 32 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 8 FixpointIterations, 40 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 100 TotalNumberOfCompositions, 6997 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3840, positive: 3642, positive conditional: 3642, positive unconditional: 0, negative: 198, negative conditional: 198, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3840, positive: 3642, positive conditional: 0, positive unconditional: 3642, negative: 198, negative conditional: 0, negative unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3840, positive: 3642, positive conditional: 0, positive unconditional: 3642, negative: 198, negative conditional: 0, negative unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2167, positive: 2119, positive conditional: 0, positive unconditional: 2119, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2167, positive: 2083, positive conditional: 0, positive unconditional: 2083, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 84, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 902, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 816, negative conditional: 0, negative unconditional: 816, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3840, positive: 1523, positive conditional: 0, positive unconditional: 1523, negative: 150, negative conditional: 0, negative unconditional: 150, unknown: 2167, unknown conditional: 0, unknown unconditional: 2167] , Statistics on independence cache: Total cache size (in pairs): 2167, Positive cache size: 2119, Positive conditional cache size: 0, Positive unconditional cache size: 2119, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9396.2ms, 40 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 948 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 295, positive: 245, positive conditional: 245, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 295, positive: 245, positive conditional: 4, positive unconditional: 241, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 295, positive: 245, positive conditional: 4, positive unconditional: 241, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, positive: 35, positive conditional: 2, positive unconditional: 33, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 43, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 224, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 207, negative conditional: 0, negative unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 295, positive: 210, positive conditional: 2, positive unconditional: 208, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 43, unknown conditional: 2, unknown unconditional: 41] , Statistics on independence cache: Total cache size (in pairs): 2210, Positive cache size: 2154, Positive conditional cache size: 2, Positive unconditional cache size: 2152, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 267.1ms, 42 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 713 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 253, positive: 210, positive conditional: 210, positive unconditional: 0, negative: 43, negative conditional: 43, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 253, positive: 210, positive conditional: 0, positive unconditional: 210, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 253, positive: 210, positive conditional: 0, positive unconditional: 210, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 104, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 253, positive: 194, positive conditional: 0, positive unconditional: 194, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 2231, Positive cache size: 2170, Positive conditional cache size: 2, Positive unconditional cache size: 2168, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, Eliminated conditions: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0ms, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 292 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, positive: 79, positive conditional: 0, positive unconditional: 79, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, positive: 79, positive conditional: 0, positive unconditional: 79, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 96, positive: 75, positive conditional: 0, positive unconditional: 75, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 2235, Positive cache size: 2174, Positive conditional cache size: 2, Positive unconditional cache size: 2172, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.1ms, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 234 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92, positive: 79, positive conditional: 0, positive unconditional: 79, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92, positive: 79, positive conditional: 0, positive unconditional: 79, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 92, positive: 79, positive conditional: 0, positive unconditional: 79, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2235, Positive cache size: 2174, Positive conditional cache size: 2, Positive unconditional cache size: 2172, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.2ms, 42 PlacesBefore, 42 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 234 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, positive: 56, positive conditional: 56, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 8, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 60, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 2243, Positive cache size: 2180, Positive conditional cache size: 2, Positive unconditional cache size: 2178, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.6ms, 46 PlacesBefore, 46 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 170 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, positive: 68, positive conditional: 68, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, positive: 68, positive conditional: 2, positive unconditional: 66, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, positive: 68, positive conditional: 2, positive unconditional: 66, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 76, positive: 68, positive conditional: 2, positive unconditional: 66, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2243, Positive cache size: 2180, Positive conditional cache size: 2, Positive unconditional cache size: 2178, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.2ms, 53 PlacesBefore, 53 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 248 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 106, positive: 95, positive conditional: 95, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 106, positive: 95, positive conditional: 14, positive unconditional: 81, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 95, positive conditional: 14, positive unconditional: 81, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 1, positive unconditional: 2, 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: 106, positive: 92, positive conditional: 13, positive unconditional: 79, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2246, Positive cache size: 2183, Positive conditional cache size: 3, Positive unconditional cache size: 2180, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.6ms, 58 PlacesBefore, 58 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 694 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 272 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 120, positive: 109, positive conditional: 109, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 120, positive: 109, positive conditional: 27, positive unconditional: 82, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 120, positive: 109, positive conditional: 27, positive unconditional: 82, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, positive: 109, positive conditional: 27, positive unconditional: 82, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2246, Positive cache size: 2183, Positive conditional cache size: 3, Positive unconditional cache size: 2180, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 37 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35.1ms, 61 PlacesBefore, 61 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 752 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 362 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, positive: 159, positive conditional: 159, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 173, positive: 159, positive conditional: 37, positive unconditional: 122, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 173, positive: 159, positive conditional: 37, positive unconditional: 122, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 173, positive: 158, positive conditional: 37, positive unconditional: 121, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2247, Positive cache size: 2184, Positive conditional cache size: 3, Positive unconditional cache size: 2181, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.5ms, 63 PlacesBefore, 63 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 750 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 355 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, positive: 165, positive conditional: 165, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 179, positive: 165, positive conditional: 50, positive unconditional: 115, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 179, positive: 165, positive conditional: 50, positive unconditional: 115, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 179, positive: 165, positive conditional: 50, positive unconditional: 115, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2247, Positive cache size: 2184, Positive conditional cache size: 3, Positive unconditional cache size: 2181, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 139.9ms, 66 PlacesBefore, 66 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 984 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 285 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133, positive: 124, positive conditional: 124, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 133, positive: 124, positive conditional: 47, positive unconditional: 77, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 133, positive: 124, positive conditional: 47, positive unconditional: 77, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 133, positive: 124, positive conditional: 47, positive unconditional: 77, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2247, Positive cache size: 2184, Positive conditional cache size: 3, Positive unconditional cache size: 2181, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 123.4ms, 74 PlacesBefore, 74 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 1128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 332 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, positive: 162, positive conditional: 162, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 171, positive: 162, positive conditional: 104, positive unconditional: 58, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 171, positive: 162, positive conditional: 104, positive unconditional: 58, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 171, positive: 162, positive conditional: 104, positive unconditional: 58, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2247, Positive cache size: 2184, Positive conditional cache size: 3, Positive unconditional cache size: 2181, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 204.2ms, 74 PlacesBefore, 74 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 1128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 332 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 157, positive: 148, positive conditional: 148, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 157, positive: 148, positive conditional: 92, positive unconditional: 56, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 157, positive: 148, positive conditional: 92, positive unconditional: 56, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 2, 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: 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: 157, positive: 145, positive conditional: 90, positive unconditional: 55, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2250, Positive cache size: 2187, Positive conditional cache size: 5, Positive unconditional cache size: 2182, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 129.6ms, 80 PlacesBefore, 80 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 275 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, positive: 134, positive conditional: 134, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 141, positive: 134, positive conditional: 83, positive unconditional: 51, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 141, positive: 134, positive conditional: 83, positive unconditional: 51, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 141, positive: 133, positive conditional: 83, positive unconditional: 50, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2251, Positive cache size: 2188, Positive conditional cache size: 5, Positive unconditional cache size: 2183, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 319.5ms, 85 PlacesBefore, 85 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1572 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 2251, Positive cache size: 2188, Positive conditional cache size: 5, Positive unconditional cache size: 2183, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 291.6ms, 92 PlacesBefore, 91 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1542 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 2251, Positive cache size: 2188, Positive conditional cache size: 5, Positive unconditional cache size: 2183, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 75.6ms, 86 PlacesBefore, 80 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 774 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 2251, Positive cache size: 2188, Positive conditional cache size: 5, Positive unconditional cache size: 2183, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.5ms, 81 PlacesBefore, 80 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 2251, Positive cache size: 2188, Positive conditional cache size: 5, Positive unconditional cache size: 2183, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1269; [L845] FCALL, FORK 0 pthread_create(&t1269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L846] 0 pthread_t t1270; [L847] FCALL, FORK 0 pthread_create(&t1270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L848] 0 pthread_t t1271; [L849] FCALL, FORK 0 pthread_create(&t1271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L850] 0 pthread_t t1272; [L851] FCALL, FORK 0 pthread_create(&t1272, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L783] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L786] 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) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] 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) [L786] 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) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 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 [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 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 [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L857] 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) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] 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) [L857] 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) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 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 [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 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 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] 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) [L868] 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) [L869] 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)) [L869] 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)) [L870] 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)) [L870] 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)) [L871] 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)) [L871] 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)) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 24499.4ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 4215.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6999.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 73 SDtfs, 35 SDslu, 31 SDs, 0 SdLazy, 418 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 559.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 659.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=635occurred in iteration=15, InterpolantAutomatonStates: 93, 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: 58.3ms SsaConstructionTime, 446.6ms SatisfiabilityAnalysisTime, 1220.1ms InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 283 ConstructedInterpolants, 0 QuantifiedInterpolants, 1745 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...