/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:34:08,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:34:08,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:34:08,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:34:08,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:34:08,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:34:08,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:34:08,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:34:08,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:34:08,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:34:08,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:34:08,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:34:08,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:34:08,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:34:08,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:34:08,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:34:08,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:34:08,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:34:08,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:34:08,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:34:08,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:34:08,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:34:08,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:34:08,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:34:08,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:34:08,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:34:08,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:34:08,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:34:08,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:34:08,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:34:08,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:34:08,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:34:08,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:34:08,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:34:08,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:34:08,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:34:08,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:34:08,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:34:08,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:34:08,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:34:08,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:34:08,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 14:34:08,570 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:34:08,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:34:08,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:34:08,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:34:08,572 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:34:08,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:34:08,572 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:34:08,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:34:08,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:34:08,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:34:08,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:34:08,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:34:08,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:34:08,573 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:34:08,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:34:08,573 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:34:08,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:34:08,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:34:08,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:34:08,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:34:08,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:34:08,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:34:08,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:34:08,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:34:08,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:34:08,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:34:08,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:34:08,575 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:34:08,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:34:08,575 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:34:08,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:34:08,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:34:08,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:34:08,891 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:34:08,893 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:34:08,894 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2021-03-25 14:34:08,954 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/017878b77/17dc87ee1289451dbb8586d9576a4f75/FLAG42a458e55 [2021-03-25 14:34:09,471 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:34:09,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2021-03-25 14:34:09,482 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/017878b77/17dc87ee1289451dbb8586d9576a4f75/FLAG42a458e55 [2021-03-25 14:34:09,943 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/017878b77/17dc87ee1289451dbb8586d9576a4f75 [2021-03-25 14:34:09,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:34:09,946 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:34:09,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:34:09,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:34:09,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:34:09,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:34:09" (1/1) ... [2021-03-25 14:34:09,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1908953f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:09, skipping insertion in model container [2021-03-25 14:34:09,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:34:09" (1/1) ... [2021-03-25 14:34:09,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:34:10,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:34:10,143 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/mix045_pso.opt.i[948,961] [2021-03-25 14:34:10,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:34:10,357 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:34:10,368 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/mix045_pso.opt.i[948,961] [2021-03-25 14:34:10,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:34:10,477 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:34:10,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:10 WrapperNode [2021-03-25 14:34:10,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:34:10,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:34:10,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:34:10,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:34:10,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:10" (1/1) ... [2021-03-25 14:34:10,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:10" (1/1) ... [2021-03-25 14:34:10,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:34:10,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:34:10,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:34:10,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:34:10,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:10" (1/1) ... [2021-03-25 14:34:10,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:10" (1/1) ... [2021-03-25 14:34:10,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:10" (1/1) ... [2021-03-25 14:34:10,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:10" (1/1) ... [2021-03-25 14:34:10,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:10" (1/1) ... [2021-03-25 14:34:10,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:10" (1/1) ... [2021-03-25 14:34:10,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:10" (1/1) ... [2021-03-25 14:34:10,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:34:10,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:34:10,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:34:10,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:34:10,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:34:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:34:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:34:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:34:10,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:34:10,654 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:34:10,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:34:10,654 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:34:10,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:34:10,654 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:34:10,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:34:10,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:34:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:34:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:34:10,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:34:10,656 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:34:12,184 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:34:12,184 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:34:12,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:34:12 BoogieIcfgContainer [2021-03-25 14:34:12,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:34:12,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:34:12,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:34:12,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:34:12,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:34:09" (1/3) ... [2021-03-25 14:34:12,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e95c4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:34:12, skipping insertion in model container [2021-03-25 14:34:12,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:34:10" (2/3) ... [2021-03-25 14:34:12,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e95c4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:34:12, skipping insertion in model container [2021-03-25 14:34:12,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:34:12" (3/3) ... [2021-03-25 14:34:12,192 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_pso.opt.i [2021-03-25 14:34:12,197 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:34:12,201 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:34:12,201 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:34:12,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,227 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,227 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,227 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,227 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,228 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,228 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,229 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,229 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,232 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,232 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,233 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,233 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,233 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,233 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,233 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,234 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,238 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,238 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,240 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,240 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,242 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,243 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,243 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:34:12,245 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:34:12,261 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 14:34:12,277 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:34:12,278 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:34:12,278 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:34:12,278 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:34:12,278 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:34:12,278 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:34:12,278 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:34:12,278 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:34:12,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2021-03-25 14:34:12,318 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-25 14:34:12,318 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:34:12,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-25 14:34:12,322 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 100 transitions, 215 flow [2021-03-25 14:34:12,326 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 203 flow [2021-03-25 14:34:12,327 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:12,338 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-25 14:34:12,340 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-25 14:34:12,342 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 203 flow [2021-03-25 14:34:12,357 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-25 14:34:12,357 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:34:12,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-25 14:34:12,360 INFO L142 LiptonReduction]: Number of co-enabled transitions 1738 [2021-03-25 14:34:13,581 WARN L205 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-25 14:34:13,895 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-25 14:34:15,368 WARN L205 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-25 14:34:16,007 WARN L205 SmtUtils]: Spent 637.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 14:34:17,044 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:34:17,383 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:34:17,497 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:34:18,640 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 14:34:18,937 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 14:34:20,170 WARN L205 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 267 DAG size of output: 266 [2021-03-25 14:34:20,732 WARN L205 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 14:34:20,972 INFO L154 LiptonReduction]: Checked pairs total: 2726 [2021-03-25 14:34:20,972 INFO L156 LiptonReduction]: Total number of compositions: 67 [2021-03-25 14:34:20,974 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8648 [2021-03-25 14:34:20,986 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 14:34:20,987 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:34:20,987 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:20,987 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:20,987 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:20,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:20,993 INFO L82 PathProgramCache]: Analyzing trace with hash 429548733, now seen corresponding path program 1 times [2021-03-25 14:34:21,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:21,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292843069] [2021-03-25 14:34:21,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:21,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:21,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:21,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:21,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:21,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292843069] [2021-03-25 14:34:21,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:21,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:34:21,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177628198] [2021-03-25 14:34:21,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:34:21,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:21,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:34:21,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:34:21,260 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 167 [2021-03-25 14:34:21,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:21,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:21,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 167 [2021-03-25 14:34:21,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:21,334 INFO L129 PetriNetUnfolder]: 23/102 cut-off events. [2021-03-25 14:34:21,335 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:34:21,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 102 events. 23/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 3 based on Foata normal form. 5/99 useless extension candidates. Maximal degree in co-relation 139. Up to 37 conditions per place. [2021-03-25 14:34:21,338 INFO L132 encePairwiseOnDemand]: 163/167 looper letters, 7 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2021-03-25 14:34:21,339 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 113 flow [2021-03-25 14:34:21,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:34:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:34:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2021-03-25 14:34:21,356 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8902195608782435 [2021-03-25 14:34:21,357 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2021-03-25 14:34:21,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2021-03-25 14:34:21,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:21,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2021-03-25 14:34:21,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:21,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:21,383 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:21,385 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 3 states and 446 transitions. [2021-03-25 14:34:21,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 113 flow [2021-03-25 14:34:21,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 110 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:34:21,390 INFO L241 Difference]: Finished difference. Result has 46 places, 34 transitions, 78 flow [2021-03-25 14:34:21,392 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2021-03-25 14:34:21,392 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2021-03-25 14:34:21,393 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:21,393 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 34 transitions, 78 flow [2021-03-25 14:34:21,394 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 34 transitions, 78 flow [2021-03-25 14:34:21,394 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 78 flow [2021-03-25 14:34:21,406 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2021-03-25 14:34:21,407 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:34:21,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:34:21,407 INFO L142 LiptonReduction]: Number of co-enabled transitions 254 [2021-03-25 14:34:21,851 WARN L205 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 14:34:22,193 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 14:34:22,770 WARN L205 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:34:23,397 WARN L205 SmtUtils]: Spent 625.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:34:24,665 INFO L154 LiptonReduction]: Checked pairs total: 1054 [2021-03-25 14:34:24,665 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-25 14:34:24,665 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3273 [2021-03-25 14:34:24,666 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-03-25 14:34:24,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:24,667 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:24,667 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:24,667 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:34:24,667 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:24,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:24,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1980972199, now seen corresponding path program 1 times [2021-03-25 14:34:24,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:24,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434180077] [2021-03-25 14:34:24,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:24,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:24,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:24,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:24,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:24,824 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:34:24,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:34:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:24,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434180077] [2021-03-25 14:34:24,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:24,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:34:24,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419508200] [2021-03-25 14:34:24,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:34:24,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:24,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:34:24,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:34:24,842 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 178 [2021-03-25 14:34:24,843 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:24,843 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:24,845 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 178 [2021-03-25 14:34:24,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:24,869 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-25 14:34:24,869 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:34:24,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 35 events. 3/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 1 based on Foata normal form. 1/33 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2021-03-25 14:34:24,870 INFO L132 encePairwiseOnDemand]: 174/178 looper letters, 3 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2021-03-25 14:34:24,870 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 72 flow [2021-03-25 14:34:24,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:34:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:34:24,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2021-03-25 14:34:24,872 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8782771535580525 [2021-03-25 14:34:24,872 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2021-03-25 14:34:24,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2021-03-25 14:34:24,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:24,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2021-03-25 14:34:24,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:24,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:24,876 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:24,876 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 469 transitions. [2021-03-25 14:34:24,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 72 flow [2021-03-25 14:34:24,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 25 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:34:24,877 INFO L241 Difference]: Finished difference. Result has 33 places, 25 transitions, 71 flow [2021-03-25 14:34:24,877 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2021-03-25 14:34:24,880 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -16 predicate places. [2021-03-25 14:34:24,880 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:24,880 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 71 flow [2021-03-25 14:34:24,880 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 71 flow [2021-03-25 14:34:24,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 71 flow [2021-03-25 14:34:24,886 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-25 14:34:24,886 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:34:24,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 31 events. 3/31 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 42. Up to 10 conditions per place. [2021-03-25 14:34:24,887 INFO L142 LiptonReduction]: Number of co-enabled transitions 238 [2021-03-25 14:34:25,606 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-25 14:34:25,739 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-25 14:34:26,033 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-25 14:34:26,169 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-25 14:34:26,172 INFO L154 LiptonReduction]: Checked pairs total: 633 [2021-03-25 14:34:26,172 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:34:26,172 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1292 [2021-03-25 14:34:26,173 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 67 flow [2021-03-25 14:34:26,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,174 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:26,174 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:26,174 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:34:26,174 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:26,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:26,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1508873391, now seen corresponding path program 1 times [2021-03-25 14:34:26,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:26,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247490242] [2021-03-25 14:34:26,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:26,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:26,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:26,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:26,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247490242] [2021-03-25 14:34:26,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:26,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:34:26,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176884871] [2021-03-25 14:34:26,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:34:26,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:26,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:34:26,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:34:26,260 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 180 [2021-03-25 14:34:26,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:26,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 180 [2021-03-25 14:34:26,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:26,273 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-25 14:34:26,273 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-25 14:34:26,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 33 events. 3/33 cut-off events. For 6/6 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/31 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-25 14:34:26,273 INFO L132 encePairwiseOnDemand]: 177/180 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-03-25 14:34:26,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 73 flow [2021-03-25 14:34:26,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:34:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:34:26,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2021-03-25 14:34:26,275 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8851851851851852 [2021-03-25 14:34:26,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 478 transitions. [2021-03-25 14:34:26,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions. [2021-03-25 14:34:26,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:26,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions. [2021-03-25 14:34:26,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,279 INFO L185 Difference]: Start difference. First operand has 31 places, 23 transitions, 67 flow. Second operand 3 states and 478 transitions. [2021-03-25 14:34:26,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 73 flow [2021-03-25 14:34:26,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 70 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:34:26,280 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 72 flow [2021-03-25 14:34:26,280 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2021-03-25 14:34:26,280 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -16 predicate places. [2021-03-25 14:34:26,280 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:26,280 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-25 14:34:26,281 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-25 14:34:26,281 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 72 flow [2021-03-25 14:34:26,285 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2021-03-25 14:34:26,285 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 14:34:26,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2021-03-25 14:34:26,285 INFO L142 LiptonReduction]: Number of co-enabled transitions 236 [2021-03-25 14:34:26,287 INFO L154 LiptonReduction]: Checked pairs total: 198 [2021-03-25 14:34:26,287 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:26,287 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-25 14:34:26,288 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 72 flow [2021-03-25 14:34:26,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,288 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:26,288 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:26,289 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:34:26,289 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:26,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:26,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1510579461, now seen corresponding path program 1 times [2021-03-25 14:34:26,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:26,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097822009] [2021-03-25 14:34:26,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:26,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:26,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:34:26,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:26,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:34:26,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:26,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:34:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:26,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097822009] [2021-03-25 14:34:26,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:26,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:34:26,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161001240] [2021-03-25 14:34:26,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:34:26,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:26,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:34:26,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:34:26,375 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 180 [2021-03-25 14:34:26,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:26,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 180 [2021-03-25 14:34:26,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:26,443 INFO L129 PetriNetUnfolder]: 47/123 cut-off events. [2021-03-25 14:34:26,443 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-03-25 14:34:26,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 123 events. 47/123 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 534 event pairs, 17 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 257. Up to 77 conditions per place. [2021-03-25 14:34:26,449 INFO L132 encePairwiseOnDemand]: 175/180 looper letters, 8 selfloop transitions, 5 changer transitions 0/29 dead transitions. [2021-03-25 14:34:26,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 113 flow [2021-03-25 14:34:26,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:34:26,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:34:26,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2021-03-25 14:34:26,452 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7861111111111111 [2021-03-25 14:34:26,452 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2021-03-25 14:34:26,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2021-03-25 14:34:26,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:26,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2021-03-25 14:34:26,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,457 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,457 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 72 flow. Second operand 4 states and 566 transitions. [2021-03-25 14:34:26,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 113 flow [2021-03-25 14:34:26,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 107 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:34:26,459 INFO L241 Difference]: Finished difference. Result has 36 places, 27 transitions, 101 flow [2021-03-25 14:34:26,459 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2021-03-25 14:34:26,459 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -13 predicate places. [2021-03-25 14:34:26,459 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:26,459 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 27 transitions, 101 flow [2021-03-25 14:34:26,460 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 27 transitions, 101 flow [2021-03-25 14:34:26,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 27 transitions, 101 flow [2021-03-25 14:34:26,469 INFO L129 PetriNetUnfolder]: 7/43 cut-off events. [2021-03-25 14:34:26,469 INFO L130 PetriNetUnfolder]: For 25/28 co-relation queries the response was YES. [2021-03-25 14:34:26,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 43 events. 7/43 cut-off events. For 25/28 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 3 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 87. Up to 15 conditions per place. [2021-03-25 14:34:26,470 INFO L142 LiptonReduction]: Number of co-enabled transitions 278 [2021-03-25 14:34:26,515 INFO L154 LiptonReduction]: Checked pairs total: 162 [2021-03-25 14:34:26,516 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:26,516 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 57 [2021-03-25 14:34:26,516 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 101 flow [2021-03-25 14:34:26,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,517 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:26,517 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:26,517 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:34:26,517 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:26,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:26,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1185198741, now seen corresponding path program 1 times [2021-03-25 14:34:26,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:26,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032015500] [2021-03-25 14:34:26,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:26,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:26,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:34:26,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:26,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 14:34:26,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:26,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 14:34:26,654 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.1 percent of original size [2021-03-25 14:34:26,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-25 14:34:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:26,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032015500] [2021-03-25 14:34:26,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:26,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:34:26,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887683906] [2021-03-25 14:34:26,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:34:26,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:26,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:34:26,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:34:26,682 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 180 [2021-03-25 14:34:26,683 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,683 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:26,683 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 180 [2021-03-25 14:34:26,683 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:26,763 INFO L129 PetriNetUnfolder]: 55/134 cut-off events. [2021-03-25 14:34:26,763 INFO L130 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2021-03-25 14:34:26,764 INFO L84 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 134 events. 55/134 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 553 event pairs, 10 based on Foata normal form. 2/128 useless extension candidates. Maximal degree in co-relation 341. Up to 74 conditions per place. [2021-03-25 14:34:26,765 INFO L132 encePairwiseOnDemand]: 173/180 looper letters, 10 selfloop transitions, 9 changer transitions 0/35 dead transitions. [2021-03-25 14:34:26,765 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 160 flow [2021-03-25 14:34:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:34:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:34:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2021-03-25 14:34:26,768 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.78 [2021-03-25 14:34:26,768 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2021-03-25 14:34:26,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2021-03-25 14:34:26,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:26,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2021-03-25 14:34:26,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,773 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,773 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 101 flow. Second operand 5 states and 702 transitions. [2021-03-25 14:34:26,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 160 flow [2021-03-25 14:34:26,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 14:34:26,775 INFO L241 Difference]: Finished difference. Result has 42 places, 32 transitions, 151 flow [2021-03-25 14:34:26,775 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2021-03-25 14:34:26,775 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2021-03-25 14:34:26,775 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:26,776 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 151 flow [2021-03-25 14:34:26,776 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 151 flow [2021-03-25 14:34:26,776 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 151 flow [2021-03-25 14:34:26,791 INFO L129 PetriNetUnfolder]: 28/89 cut-off events. [2021-03-25 14:34:26,791 INFO L130 PetriNetUnfolder]: For 105/109 co-relation queries the response was YES. [2021-03-25 14:34:26,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 89 events. 28/89 cut-off events. For 105/109 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 9 based on Foata normal form. 2/79 useless extension candidates. Maximal degree in co-relation 240. Up to 34 conditions per place. [2021-03-25 14:34:26,793 INFO L142 LiptonReduction]: Number of co-enabled transitions 322 [2021-03-25 14:34:26,795 INFO L154 LiptonReduction]: Checked pairs total: 148 [2021-03-25 14:34:26,795 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:26,796 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-25 14:34:26,796 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 151 flow [2021-03-25 14:34:26,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,797 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:26,797 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:26,797 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:34:26,798 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:26,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:26,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1626306817, now seen corresponding path program 2 times [2021-03-25 14:34:26,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:26,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283770985] [2021-03-25 14:34:26,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:26,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:26,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:34:26,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:26,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:34:26,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:26,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:34:26,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:26,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:34:26,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:26,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283770985] [2021-03-25 14:34:26,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:26,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:34:26,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627894919] [2021-03-25 14:34:26,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:34:26,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:26,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:34:26,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:34:26,892 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 180 [2021-03-25 14:34:26,894 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 136.83333333333334) internal successors, (821), 6 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,894 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:26,894 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 180 [2021-03-25 14:34:26,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:26,978 INFO L129 PetriNetUnfolder]: 59/140 cut-off events. [2021-03-25 14:34:26,979 INFO L130 PetriNetUnfolder]: For 204/207 co-relation queries the response was YES. [2021-03-25 14:34:26,980 INFO L84 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 140 events. 59/140 cut-off events. For 204/207 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 586 event pairs, 10 based on Foata normal form. 5/137 useless extension candidates. Maximal degree in co-relation 487. Up to 82 conditions per place. [2021-03-25 14:34:26,981 INFO L132 encePairwiseOnDemand]: 173/180 looper letters, 11 selfloop transitions, 13 changer transitions 0/40 dead transitions. [2021-03-25 14:34:26,981 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 244 flow [2021-03-25 14:34:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:34:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:34:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 696 transitions. [2021-03-25 14:34:26,984 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2021-03-25 14:34:26,984 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 696 transitions. [2021-03-25 14:34:26,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 696 transitions. [2021-03-25 14:34:26,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:26,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 696 transitions. [2021-03-25 14:34:26,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.2) internal successors, (696), 5 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,988 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:26,988 INFO L185 Difference]: Start difference. First operand has 42 places, 32 transitions, 151 flow. Second operand 5 states and 696 transitions. [2021-03-25 14:34:26,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 244 flow [2021-03-25 14:34:26,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 230 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-25 14:34:26,991 INFO L241 Difference]: Finished difference. Result has 46 places, 39 transitions, 223 flow [2021-03-25 14:34:26,991 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2021-03-25 14:34:26,991 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2021-03-25 14:34:26,991 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:26,991 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 223 flow [2021-03-25 14:34:26,992 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 39 transitions, 223 flow [2021-03-25 14:34:26,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 223 flow [2021-03-25 14:34:27,006 INFO L129 PetriNetUnfolder]: 28/89 cut-off events. [2021-03-25 14:34:27,007 INFO L130 PetriNetUnfolder]: For 193/204 co-relation queries the response was YES. [2021-03-25 14:34:27,007 INFO L84 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 89 events. 28/89 cut-off events. For 193/204 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 10 based on Foata normal form. 4/83 useless extension candidates. Maximal degree in co-relation 272. Up to 33 conditions per place. [2021-03-25 14:34:27,008 INFO L142 LiptonReduction]: Number of co-enabled transitions 362 [2021-03-25 14:34:27,015 INFO L154 LiptonReduction]: Checked pairs total: 263 [2021-03-25 14:34:27,015 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:27,015 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-25 14:34:27,021 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 223 flow [2021-03-25 14:34:27,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 136.83333333333334) internal successors, (821), 6 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:27,021 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:27,021 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:27,021 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:34:27,021 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:27,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:27,022 INFO L82 PathProgramCache]: Analyzing trace with hash -463580543, now seen corresponding path program 3 times [2021-03-25 14:34:27,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:27,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074007872] [2021-03-25 14:34:27,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:27,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:27,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:34:27,128 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-03-25 14:34:27,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 14:34:27,143 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-25 14:34:27,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 14:34:27,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:27,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:34:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:27,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074007872] [2021-03-25 14:34:27,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:27,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:34:27,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662496237] [2021-03-25 14:34:27,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:34:27,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:27,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:34:27,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:34:27,163 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 180 [2021-03-25 14:34:27,164 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:27,164 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:27,164 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 180 [2021-03-25 14:34:27,164 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:27,262 INFO L129 PetriNetUnfolder]: 58/153 cut-off events. [2021-03-25 14:34:27,262 INFO L130 PetriNetUnfolder]: For 370/373 co-relation queries the response was YES. [2021-03-25 14:34:27,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 153 events. 58/153 cut-off events. For 370/373 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 697 event pairs, 6 based on Foata normal form. 9/154 useless extension candidates. Maximal degree in co-relation 595. Up to 67 conditions per place. [2021-03-25 14:34:27,265 INFO L132 encePairwiseOnDemand]: 174/180 looper letters, 12 selfloop transitions, 16 changer transitions 0/44 dead transitions. [2021-03-25 14:34:27,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 313 flow [2021-03-25 14:34:27,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:34:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:34:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 838 transitions. [2021-03-25 14:34:27,268 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7759259259259259 [2021-03-25 14:34:27,268 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 838 transitions. [2021-03-25 14:34:27,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 838 transitions. [2021-03-25 14:34:27,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:27,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 838 transitions. [2021-03-25 14:34:27,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.66666666666666) internal successors, (838), 6 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:27,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:27,273 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:27,273 INFO L185 Difference]: Start difference. First operand has 46 places, 39 transitions, 223 flow. Second operand 6 states and 838 transitions. [2021-03-25 14:34:27,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 313 flow [2021-03-25 14:34:27,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 303 flow, removed 5 selfloop flow, removed 0 redundant places. [2021-03-25 14:34:27,278 INFO L241 Difference]: Finished difference. Result has 52 places, 41 transitions, 280 flow [2021-03-25 14:34:27,278 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=280, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2021-03-25 14:34:27,278 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2021-03-25 14:34:27,278 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:27,279 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 41 transitions, 280 flow [2021-03-25 14:34:27,279 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 41 transitions, 280 flow [2021-03-25 14:34:27,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 280 flow [2021-03-25 14:34:27,290 INFO L129 PetriNetUnfolder]: 28/92 cut-off events. [2021-03-25 14:34:27,290 INFO L130 PetriNetUnfolder]: For 266/275 co-relation queries the response was YES. [2021-03-25 14:34:27,291 INFO L84 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 92 events. 28/92 cut-off events. For 266/275 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 8 based on Foata normal form. 4/86 useless extension candidates. Maximal degree in co-relation 331. Up to 33 conditions per place. [2021-03-25 14:34:27,292 INFO L142 LiptonReduction]: Number of co-enabled transitions 384 [2021-03-25 14:34:27,296 INFO L154 LiptonReduction]: Checked pairs total: 356 [2021-03-25 14:34:27,296 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:27,296 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-25 14:34:27,298 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 280 flow [2021-03-25 14:34:27,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:27,299 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:27,299 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:27,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:34:27,299 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:27,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:27,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1636540286, now seen corresponding path program 1 times [2021-03-25 14:34:27,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:27,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026780686] [2021-03-25 14:34:27,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:27,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:27,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:34:27,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:27,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:34:27,414 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.4 percent of original size [2021-03-25 14:34:27,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-25 14:34:27,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:27,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:34:27,459 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-03-25 14:34:27,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 14:34:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:27,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026780686] [2021-03-25 14:34:27,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:27,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:34:27,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059119413] [2021-03-25 14:34:27,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:34:27,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:27,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:34:27,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:34:27,473 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 180 [2021-03-25 14:34:27,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 133.85714285714286) internal successors, (937), 7 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:27,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:27,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 180 [2021-03-25 14:34:27,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:27,597 INFO L129 PetriNetUnfolder]: 55/149 cut-off events. [2021-03-25 14:34:27,597 INFO L130 PetriNetUnfolder]: For 465/468 co-relation queries the response was YES. [2021-03-25 14:34:27,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 149 events. 55/149 cut-off events. For 465/468 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 661 event pairs, 5 based on Foata normal form. 5/146 useless extension candidates. Maximal degree in co-relation 671. Up to 55 conditions per place. [2021-03-25 14:34:27,600 INFO L132 encePairwiseOnDemand]: 173/180 looper letters, 14 selfloop transitions, 14 changer transitions 0/44 dead transitions. [2021-03-25 14:34:27,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 44 transitions, 359 flow [2021-03-25 14:34:27,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:34:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:34:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2021-03-25 14:34:27,602 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7577777777777778 [2021-03-25 14:34:27,603 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 682 transitions. [2021-03-25 14:34:27,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 682 transitions. [2021-03-25 14:34:27,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:27,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 682 transitions. [2021-03-25 14:34:27,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:27,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:27,606 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:27,606 INFO L185 Difference]: Start difference. First operand has 52 places, 41 transitions, 280 flow. Second operand 5 states and 682 transitions. [2021-03-25 14:34:27,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 44 transitions, 359 flow [2021-03-25 14:34:27,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 44 transitions, 342 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-03-25 14:34:27,611 INFO L241 Difference]: Finished difference. Result has 54 places, 41 transitions, 303 flow [2021-03-25 14:34:27,611 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=303, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2021-03-25 14:34:27,611 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2021-03-25 14:34:27,611 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:27,612 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 41 transitions, 303 flow [2021-03-25 14:34:27,612 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 41 transitions, 303 flow [2021-03-25 14:34:27,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 41 transitions, 303 flow [2021-03-25 14:34:27,623 INFO L129 PetriNetUnfolder]: 26/87 cut-off events. [2021-03-25 14:34:27,623 INFO L130 PetriNetUnfolder]: For 287/296 co-relation queries the response was YES. [2021-03-25 14:34:27,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 87 events. 26/87 cut-off events. For 287/296 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 321 event pairs, 7 based on Foata normal form. 4/82 useless extension candidates. Maximal degree in co-relation 328. Up to 30 conditions per place. [2021-03-25 14:34:27,625 INFO L142 LiptonReduction]: Number of co-enabled transitions 382 [2021-03-25 14:34:27,629 INFO L154 LiptonReduction]: Checked pairs total: 350 [2021-03-25 14:34:27,629 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:27,629 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-25 14:34:27,629 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 303 flow [2021-03-25 14:34:27,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 133.85714285714286) internal successors, (937), 7 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:27,630 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:27,630 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:27,630 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:34:27,630 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:27,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:27,631 INFO L82 PathProgramCache]: Analyzing trace with hash 2142134654, now seen corresponding path program 1 times [2021-03-25 14:34:27,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:27,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270141047] [2021-03-25 14:34:27,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:27,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:27,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:27,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:27,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:27,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:27,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:27,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270141047] [2021-03-25 14:34:27,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:27,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:34:27,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969652512] [2021-03-25 14:34:27,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:34:27,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:27,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:34:27,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:34:27,692 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 180 [2021-03-25 14:34:27,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:27,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:27,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 180 [2021-03-25 14:34:27,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:27,760 INFO L129 PetriNetUnfolder]: 127/292 cut-off events. [2021-03-25 14:34:27,760 INFO L130 PetriNetUnfolder]: For 635/740 co-relation queries the response was YES. [2021-03-25 14:34:27,762 INFO L84 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 292 events. 127/292 cut-off events. For 635/740 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1649 event pairs, 39 based on Foata normal form. 58/297 useless extension candidates. Maximal degree in co-relation 948. Up to 154 conditions per place. [2021-03-25 14:34:27,763 INFO L132 encePairwiseOnDemand]: 174/180 looper letters, 12 selfloop transitions, 8 changer transitions 0/52 dead transitions. [2021-03-25 14:34:27,763 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 365 flow [2021-03-25 14:34:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:34:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:34:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 765 transitions. [2021-03-25 14:34:27,766 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.85 [2021-03-25 14:34:27,766 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 765 transitions. [2021-03-25 14:34:27,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 765 transitions. [2021-03-25 14:34:27,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:27,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 765 transitions. [2021-03-25 14:34:27,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:27,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:27,771 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:27,771 INFO L185 Difference]: Start difference. First operand has 54 places, 41 transitions, 303 flow. Second operand 5 states and 765 transitions. [2021-03-25 14:34:27,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 365 flow [2021-03-25 14:34:27,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 335 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-03-25 14:34:27,776 INFO L241 Difference]: Finished difference. Result has 57 places, 48 transitions, 341 flow [2021-03-25 14:34:27,776 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=341, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2021-03-25 14:34:27,776 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2021-03-25 14:34:27,776 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:27,776 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 48 transitions, 341 flow [2021-03-25 14:34:27,776 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 48 transitions, 341 flow [2021-03-25 14:34:27,777 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 48 transitions, 341 flow [2021-03-25 14:34:27,810 INFO L129 PetriNetUnfolder]: 101/250 cut-off events. [2021-03-25 14:34:27,810 INFO L130 PetriNetUnfolder]: For 600/645 co-relation queries the response was YES. [2021-03-25 14:34:27,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 250 events. 101/250 cut-off events. For 600/645 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1393 event pairs, 21 based on Foata normal form. 18/248 useless extension candidates. Maximal degree in co-relation 939. Up to 108 conditions per place. [2021-03-25 14:34:27,814 INFO L142 LiptonReduction]: Number of co-enabled transitions 470 [2021-03-25 14:34:27,999 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 14:34:28,399 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-25 14:34:28,530 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-25 14:34:28,542 INFO L154 LiptonReduction]: Checked pairs total: 425 [2021-03-25 14:34:28,543 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:34:28,543 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 767 [2021-03-25 14:34:28,543 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 345 flow [2021-03-25 14:34:28,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:28,544 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:28,544 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:28,544 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:34:28,544 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:28,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:28,544 INFO L82 PathProgramCache]: Analyzing trace with hash -125433117, now seen corresponding path program 1 times [2021-03-25 14:34:28,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:28,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734163264] [2021-03-25 14:34:28,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:28,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:28,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:28,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:28,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:28,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:28,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:28,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:28,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:28,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:28,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734163264] [2021-03-25 14:34:28,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:28,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:34:28,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546255262] [2021-03-25 14:34:28,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:34:28,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:28,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:34:28,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:34:28,599 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 181 [2021-03-25 14:34:28,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 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-03-25 14:34:28,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:28,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 181 [2021-03-25 14:34:28,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:28,672 INFO L129 PetriNetUnfolder]: 79/214 cut-off events. [2021-03-25 14:34:28,672 INFO L130 PetriNetUnfolder]: For 843/1525 co-relation queries the response was YES. [2021-03-25 14:34:28,674 INFO L84 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 214 events. 79/214 cut-off events. For 843/1525 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1103 event pairs, 4 based on Foata normal form. 113/299 useless extension candidates. Maximal degree in co-relation 831. Up to 114 conditions per place. [2021-03-25 14:34:28,675 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 8 selfloop transitions, 15 changer transitions 3/52 dead transitions. [2021-03-25 14:34:28,675 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 52 transitions, 384 flow [2021-03-25 14:34:28,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:34:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:34:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1078 transitions. [2021-03-25 14:34:28,678 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.850828729281768 [2021-03-25 14:34:28,678 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1078 transitions. [2021-03-25 14:34:28,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1078 transitions. [2021-03-25 14:34:28,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:28,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1078 transitions. [2021-03-25 14:34:28,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:28,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:28,683 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:28,683 INFO L185 Difference]: Start difference. First operand has 57 places, 48 transitions, 345 flow. Second operand 7 states and 1078 transitions. [2021-03-25 14:34:28,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 52 transitions, 384 flow [2021-03-25 14:34:28,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 52 transitions, 365 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-25 14:34:28,686 INFO L241 Difference]: Finished difference. Result has 62 places, 47 transitions, 350 flow [2021-03-25 14:34:28,687 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=350, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2021-03-25 14:34:28,687 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2021-03-25 14:34:28,687 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:28,688 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 47 transitions, 350 flow [2021-03-25 14:34:28,688 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 47 transitions, 350 flow [2021-03-25 14:34:28,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 47 transitions, 350 flow [2021-03-25 14:34:28,704 INFO L129 PetriNetUnfolder]: 44/139 cut-off events. [2021-03-25 14:34:28,705 INFO L130 PetriNetUnfolder]: For 551/654 co-relation queries the response was YES. [2021-03-25 14:34:28,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 139 events. 44/139 cut-off events. For 551/654 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 689 event pairs, 5 based on Foata normal form. 8/133 useless extension candidates. Maximal degree in co-relation 603. Up to 76 conditions per place. [2021-03-25 14:34:28,707 INFO L142 LiptonReduction]: Number of co-enabled transitions 520 [2021-03-25 14:34:28,714 INFO L154 LiptonReduction]: Checked pairs total: 306 [2021-03-25 14:34:28,714 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:34:28,714 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 27 [2021-03-25 14:34:28,716 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 334 flow [2021-03-25 14:34:28,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 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-03-25 14:34:28,716 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:28,716 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:28,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:34:28,716 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:28,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:28,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1994571909, now seen corresponding path program 1 times [2021-03-25 14:34:28,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:28,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481114653] [2021-03-25 14:34:28,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:28,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:28,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:28,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:28,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:28,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:28,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:28,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481114653] [2021-03-25 14:34:28,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:28,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:34:28,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177052060] [2021-03-25 14:34:28,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:34:28,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:28,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:34:28,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:34:28,788 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 181 [2021-03-25 14:34:28,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:28,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:28,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 181 [2021-03-25 14:34:28,789 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:28,830 INFO L129 PetriNetUnfolder]: 76/212 cut-off events. [2021-03-25 14:34:28,830 INFO L130 PetriNetUnfolder]: For 808/832 co-relation queries the response was YES. [2021-03-25 14:34:28,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 212 events. 76/212 cut-off events. For 808/832 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1033 event pairs, 8 based on Foata normal form. 14/216 useless extension candidates. Maximal degree in co-relation 919. Up to 97 conditions per place. [2021-03-25 14:34:28,833 INFO L132 encePairwiseOnDemand]: 178/181 looper letters, 4 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2021-03-25 14:34:28,833 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 41 transitions, 303 flow [2021-03-25 14:34:28,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:34:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:34:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 643 transitions. [2021-03-25 14:34:28,836 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.888121546961326 [2021-03-25 14:34:28,836 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 643 transitions. [2021-03-25 14:34:28,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 643 transitions. [2021-03-25 14:34:28,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:28,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 643 transitions. [2021-03-25 14:34:28,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:28,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:28,839 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:28,839 INFO L185 Difference]: Start difference. First operand has 62 places, 45 transitions, 334 flow. Second operand 4 states and 643 transitions. [2021-03-25 14:34:28,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 41 transitions, 303 flow [2021-03-25 14:34:28,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 41 transitions, 281 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-03-25 14:34:28,842 INFO L241 Difference]: Finished difference. Result has 58 places, 40 transitions, 268 flow [2021-03-25 14:34:28,843 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=268, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2021-03-25 14:34:28,843 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2021-03-25 14:34:28,843 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:28,843 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 40 transitions, 268 flow [2021-03-25 14:34:28,843 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 40 transitions, 268 flow [2021-03-25 14:34:28,844 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 40 transitions, 268 flow [2021-03-25 14:34:28,861 INFO L129 PetriNetUnfolder]: 54/166 cut-off events. [2021-03-25 14:34:28,862 INFO L130 PetriNetUnfolder]: For 331/342 co-relation queries the response was YES. [2021-03-25 14:34:28,863 INFO L84 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 166 events. 54/166 cut-off events. For 331/342 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 787 event pairs, 8 based on Foata normal form. 7/167 useless extension candidates. Maximal degree in co-relation 606. Up to 50 conditions per place. [2021-03-25 14:34:28,864 INFO L142 LiptonReduction]: Number of co-enabled transitions 350 [2021-03-25 14:34:28,867 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:34:28,867 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:28,867 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-25 14:34:28,867 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 268 flow [2021-03-25 14:34:28,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:28,868 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:28,868 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:28,868 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:34:28,868 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:28,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:28,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1160234617, now seen corresponding path program 2 times [2021-03-25 14:34:28,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:28,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955117868] [2021-03-25 14:34:28,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:28,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:28,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:28,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:28,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:28,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955117868] [2021-03-25 14:34:28,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:28,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:34:28,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809061667] [2021-03-25 14:34:28,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:34:28,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:28,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:34:28,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:34:28,918 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 181 [2021-03-25 14:34:28,918 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:28,918 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:28,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 181 [2021-03-25 14:34:28,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:28,961 INFO L129 PetriNetUnfolder]: 88/261 cut-off events. [2021-03-25 14:34:28,961 INFO L130 PetriNetUnfolder]: For 656/677 co-relation queries the response was YES. [2021-03-25 14:34:28,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 261 events. 88/261 cut-off events. For 656/677 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1445 event pairs, 13 based on Foata normal form. 16/265 useless extension candidates. Maximal degree in co-relation 991. Up to 86 conditions per place. [2021-03-25 14:34:28,963 INFO L132 encePairwiseOnDemand]: 178/181 looper letters, 3 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2021-03-25 14:34:28,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 40 transitions, 280 flow [2021-03-25 14:34:28,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:34:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:34:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2021-03-25 14:34:28,966 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8895027624309392 [2021-03-25 14:34:28,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 483 transitions. [2021-03-25 14:34:28,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 483 transitions. [2021-03-25 14:34:28,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:28,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 483 transitions. [2021-03-25 14:34:28,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:28,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:28,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:28,968 INFO L185 Difference]: Start difference. First operand has 58 places, 40 transitions, 268 flow. Second operand 3 states and 483 transitions. [2021-03-25 14:34:28,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 40 transitions, 280 flow [2021-03-25 14:34:28,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 40 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:34:28,973 INFO L241 Difference]: Finished difference. Result has 60 places, 40 transitions, 278 flow [2021-03-25 14:34:28,973 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2021-03-25 14:34:28,973 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2021-03-25 14:34:28,973 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:28,974 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 40 transitions, 278 flow [2021-03-25 14:34:28,974 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 40 transitions, 278 flow [2021-03-25 14:34:28,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 40 transitions, 278 flow [2021-03-25 14:34:29,002 INFO L129 PetriNetUnfolder]: 88/261 cut-off events. [2021-03-25 14:34:29,002 INFO L130 PetriNetUnfolder]: For 577/597 co-relation queries the response was YES. [2021-03-25 14:34:29,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 261 events. 88/261 cut-off events. For 577/597 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1454 event pairs, 12 based on Foata normal form. 11/260 useless extension candidates. Maximal degree in co-relation 992. Up to 86 conditions per place. [2021-03-25 14:34:29,006 INFO L142 LiptonReduction]: Number of co-enabled transitions 350 [2021-03-25 14:34:29,009 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:34:29,009 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:29,009 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 36 [2021-03-25 14:34:29,011 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 278 flow [2021-03-25 14:34:29,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:29,011 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:29,011 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:29,011 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:34:29,011 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:29,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:29,012 INFO L82 PathProgramCache]: Analyzing trace with hash -390612706, now seen corresponding path program 1 times [2021-03-25 14:34:29,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:29,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107600555] [2021-03-25 14:34:29,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:29,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:29,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:29,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:29,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:29,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:29,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:29,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:29,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:29,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:29,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:34:29,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107600555] [2021-03-25 14:34:29,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:29,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:34:29,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872013270] [2021-03-25 14:34:29,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:34:29,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:29,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:34:29,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:34:29,094 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 181 [2021-03-25 14:34:29,095 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 150.83333333333334) internal successors, (905), 6 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:29,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:29,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 181 [2021-03-25 14:34:29,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:29,178 INFO L129 PetriNetUnfolder]: 134/323 cut-off events. [2021-03-25 14:34:29,178 INFO L130 PetriNetUnfolder]: For 593/814 co-relation queries the response was YES. [2021-03-25 14:34:29,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 323 events. 134/323 cut-off events. For 593/814 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 1828 event pairs, 0 based on Foata normal form. 74/352 useless extension candidates. Maximal degree in co-relation 1237. Up to 129 conditions per place. [2021-03-25 14:34:29,180 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 5 selfloop transitions, 11 changer transitions 11/47 dead transitions. [2021-03-25 14:34:29,180 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 47 transitions, 354 flow [2021-03-25 14:34:29,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:34:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:34:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1072 transitions. [2021-03-25 14:34:29,184 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.846093133385951 [2021-03-25 14:34:29,184 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1072 transitions. [2021-03-25 14:34:29,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1072 transitions. [2021-03-25 14:34:29,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:29,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1072 transitions. [2021-03-25 14:34:29,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 153.14285714285714) internal successors, (1072), 7 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:29,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:29,188 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:29,189 INFO L185 Difference]: Start difference. First operand has 60 places, 40 transitions, 278 flow. Second operand 7 states and 1072 transitions. [2021-03-25 14:34:29,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 47 transitions, 354 flow [2021-03-25 14:34:29,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 47 transitions, 314 flow, removed 13 selfloop flow, removed 3 redundant places. [2021-03-25 14:34:29,192 INFO L241 Difference]: Finished difference. Result has 66 places, 34 transitions, 232 flow [2021-03-25 14:34:29,192 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=232, PETRI_PLACES=66, PETRI_TRANSITIONS=34} [2021-03-25 14:34:29,192 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2021-03-25 14:34:29,192 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:29,193 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 34 transitions, 232 flow [2021-03-25 14:34:29,193 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 34 transitions, 232 flow [2021-03-25 14:34:29,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 34 transitions, 232 flow [2021-03-25 14:34:29,202 INFO L129 PetriNetUnfolder]: 20/94 cut-off events. [2021-03-25 14:34:29,202 INFO L130 PetriNetUnfolder]: For 192/197 co-relation queries the response was YES. [2021-03-25 14:34:29,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 94 events. 20/94 cut-off events. For 192/197 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 374 event pairs, 0 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 372. Up to 39 conditions per place. [2021-03-25 14:34:29,204 INFO L142 LiptonReduction]: Number of co-enabled transitions 218 [2021-03-25 14:34:29,551 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:34:29,676 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:34:30,316 WARN L205 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 194 [2021-03-25 14:34:30,576 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 14:34:31,916 WARN L205 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 349 DAG size of output: 270 [2021-03-25 14:34:32,434 WARN L205 SmtUtils]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-25 14:34:32,439 INFO L154 LiptonReduction]: Checked pairs total: 45 [2021-03-25 14:34:32,439 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:34:32,440 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3247 [2021-03-25 14:34:32,440 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 30 transitions, 218 flow [2021-03-25 14:34:32,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 150.83333333333334) internal successors, (905), 6 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:32,440 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:32,440 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:32,441 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:34:32,441 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:32,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:32,441 INFO L82 PathProgramCache]: Analyzing trace with hash 581355546, now seen corresponding path program 1 times [2021-03-25 14:34:32,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:32,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459389458] [2021-03-25 14:34:32,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:34:32,472 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:34:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:34:32,511 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:34:32,534 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:34:32,535 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:34:32,535 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:34:32,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:34:32 BasicIcfg [2021-03-25 14:34:32,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:34:32,626 INFO L168 Benchmark]: Toolchain (without parser) took 22680.41 ms. Allocated memory was 375.4 MB in the beginning and 650.1 MB in the end (delta: 274.7 MB). Free memory was 338.5 MB in the beginning and 521.0 MB in the end (delta: -182.5 MB). Peak memory consumption was 95.3 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:32,627 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 375.4 MB. Free memory was 356.9 MB in the beginning and 356.9 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:34:32,627 INFO L168 Benchmark]: CACSL2BoogieTranslator took 530.81 ms. Allocated memory is still 375.4 MB. Free memory was 338.4 MB in the beginning and 334.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:32,627 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.07 ms. Allocated memory is still 375.4 MB. Free memory was 334.3 MB in the beginning and 331.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:32,627 INFO L168 Benchmark]: Boogie Preprocessor took 40.75 ms. Allocated memory is still 375.4 MB. Free memory was 331.2 MB in the beginning and 329.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:32,629 INFO L168 Benchmark]: RCFGBuilder took 1599.13 ms. Allocated memory is still 375.4 MB. Free memory was 329.1 MB in the beginning and 310.5 MB in the end (delta: 18.6 MB). Peak memory consumption was 167.5 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:32,629 INFO L168 Benchmark]: TraceAbstraction took 20438.23 ms. Allocated memory was 375.4 MB in the beginning and 650.1 MB in the end (delta: 274.7 MB). Free memory was 309.4 MB in the beginning and 521.0 MB in the end (delta: -211.6 MB). Peak memory consumption was 63.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:32,636 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.14 ms. Allocated memory is still 375.4 MB. Free memory was 356.9 MB in the beginning and 356.9 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 530.81 ms. Allocated memory is still 375.4 MB. Free memory was 338.4 MB in the beginning and 334.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 64.07 ms. Allocated memory is still 375.4 MB. Free memory was 334.3 MB in the beginning and 331.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 40.75 ms. Allocated memory is still 375.4 MB. Free memory was 331.2 MB in the beginning and 329.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1599.13 ms. Allocated memory is still 375.4 MB. Free memory was 329.1 MB in the beginning and 310.5 MB in the end (delta: 18.6 MB). Peak memory consumption was 167.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20438.23 ms. Allocated memory was 375.4 MB in the beginning and 650.1 MB in the end (delta: 274.7 MB). Free memory was 309.4 MB in the beginning and 521.0 MB in the end (delta: -211.6 MB). Peak memory consumption was 63.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8631.9ms, 105 PlacesBefore, 49 PlacesAfterwards, 97 TransitionsBefore, 40 TransitionsAfterwards, 1738 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, 2726 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1601, positive: 1527, positive conditional: 0, positive unconditional: 1527, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1156, positive: 1121, positive conditional: 0, positive unconditional: 1121, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1156, positive: 1121, positive conditional: 0, positive unconditional: 1121, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1156, positive: 1115, positive conditional: 0, positive unconditional: 1115, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 493, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 478, negative conditional: 0, negative unconditional: 478, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1601, positive: 406, positive conditional: 0, positive unconditional: 406, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 1156, unknown conditional: 0, unknown unconditional: 1156] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3271.4ms, 46 PlacesBefore, 32 PlacesAfterwards, 34 TransitionsBefore, 23 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1054 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 384, positive: 306, positive conditional: 0, positive unconditional: 306, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 55, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 55, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 441, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 397, negative conditional: 0, negative unconditional: 397, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 384, positive: 272, positive conditional: 0, positive unconditional: 272, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 55, unknown conditional: 0, unknown unconditional: 55] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1291.7ms, 33 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 633 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 196, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 95, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 95, negative conditional: 0, negative unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 196, positive: 146, positive conditional: 0, positive unconditional: 146, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 117, Positive conditional cache size: 0, Positive unconditional cache size: 117, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3ms, 33 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 198 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 71, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 55.8ms, 36 PlacesBefore, 36 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 162 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 44, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.6ms, 42 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 148 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, positive: 32, positive conditional: 0, positive unconditional: 32, 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): 161, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.0ms, 46 PlacesBefore, 46 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 263 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 71, positive conditional: 0, positive unconditional: 71, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, positive: 71, positive conditional: 0, positive unconditional: 71, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.1ms, 52 PlacesBefore, 52 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 356 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 109, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 109, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.2ms, 54 PlacesBefore, 54 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 350 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 108, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 766.3ms, 57 PlacesBefore, 57 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 425 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 77, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 77, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 129, Positive conditional cache size: 0, Positive unconditional cache size: 129, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.4ms, 62 PlacesBefore, 62 PlacesAfterwards, 47 TransitionsBefore, 45 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 306 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 103, positive: 91, positive conditional: 0, positive unconditional: 91, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 103, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 122, Positive conditional cache size: 0, Positive unconditional cache size: 122, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.7ms, 58 PlacesBefore, 58 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 122, Positive conditional cache size: 0, Positive unconditional cache size: 122, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35.3ms, 60 PlacesBefore, 60 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 122, Positive conditional cache size: 0, Positive unconditional cache size: 122, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3246.6ms, 66 PlacesBefore, 57 PlacesAfterwards, 34 TransitionsBefore, 30 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 45 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 45, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 76, Positive conditional cache size: 0, Positive unconditional cache size: 76, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1202; [L824] FCALL, FORK 0 pthread_create(&t1202, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1203; [L826] FCALL, FORK 0 pthread_create(&t1203, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1204; [L828] FCALL, FORK 0 pthread_create(&t1204, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 20261.5ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1120.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8701.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 46 SDtfs, 24 SDslu, 19 SDs, 0 SdLazy, 268 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 306.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 330.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=10, InterpolantAutomatonStates: 60, 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: 45.1ms SsaConstructionTime, 391.2ms SatisfiabilityAnalysisTime, 901.4ms InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 857 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...