/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 05:06:16,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 05:06:16,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 05:06:16,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 05:06:16,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 05:06:16,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 05:06:16,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 05:06:16,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 05:06:16,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 05:06:16,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 05:06:16,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 05:06:16,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 05:06:16,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 05:06:16,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 05:06:16,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 05:06:16,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 05:06:16,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 05:06:16,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 05:06:16,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 05:06:16,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 05:06:16,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 05:06:16,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 05:06:16,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 05:06:16,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 05:06:16,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 05:06:16,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 05:06:16,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 05:06:16,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 05:06:16,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 05:06:16,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 05:06:16,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 05:06:16,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 05:06:16,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 05:06:16,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 05:06:16,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 05:06:16,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 05:06:16,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 05:06:16,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 05:06:16,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 05:06:16,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 05:06:16,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 05:06:16,718 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf [2021-03-25 05:06:16,750 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 05:06:16,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 05:06:16,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 05:06:16,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 05:06:16,753 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 05:06:16,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 05:06:16,754 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 05:06:16,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 05:06:16,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 05:06:16,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 05:06:16,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 05:06:16,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 05:06:16,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 05:06:16,755 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 05:06:16,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 05:06:16,756 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 05:06:16,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 05:06:16,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 05:06:16,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 05:06:16,756 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 05:06:16,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 05:06:16,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 05:06:16,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 05:06:16,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 05:06:16,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 05:06:16,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 05:06:16,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 05:06:16,757 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 05:06:16,757 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 05:06:16,758 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 05:06:16,758 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 05:06:17,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 05:06:17,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 05:06:17,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 05:06:17,060 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 05:06:17,061 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 05:06:17,062 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.opt.i [2021-03-25 05:06:17,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72ba04852/0da12f093ca34e219288fbab4235907d/FLAG2022b91d1 [2021-03-25 05:06:17,684 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 05:06:17,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.opt.i [2021-03-25 05:06:17,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72ba04852/0da12f093ca34e219288fbab4235907d/FLAG2022b91d1 [2021-03-25 05:06:17,986 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72ba04852/0da12f093ca34e219288fbab4235907d [2021-03-25 05:06:17,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 05:06:17,989 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 05:06:17,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 05:06:17,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 05:06:17,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 05:06:17,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 05:06:17" (1/1) ... [2021-03-25 05:06:17,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ceee96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:06:17, skipping insertion in model container [2021-03-25 05:06:17,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 05:06:17" (1/1) ... [2021-03-25 05:06:18,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 05:06:18,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 05:06:18,191 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/safe023_power.opt.i[994,1007] [2021-03-25 05:06:18,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 05:06:18,346 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 05:06:18,356 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/safe023_power.opt.i[994,1007] [2021-03-25 05:06:18,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 05:06:18,511 INFO L208 MainTranslator]: Completed translation [2021-03-25 05:06:18,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:06:18 WrapperNode [2021-03-25 05:06:18,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 05:06:18,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 05:06:18,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 05:06:18,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 05:06:18,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:06:18" (1/1) ... [2021-03-25 05:06:18,550 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:06:18" (1/1) ... [2021-03-25 05:06:18,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 05:06:18,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 05:06:18,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 05:06:18,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 05:06:18,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:06:18" (1/1) ... [2021-03-25 05:06:18,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:06:18" (1/1) ... [2021-03-25 05:06:18,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:06:18" (1/1) ... [2021-03-25 05:06:18,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:06:18" (1/1) ... [2021-03-25 05:06:18,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:06:18" (1/1) ... [2021-03-25 05:06:18,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:06:18" (1/1) ... [2021-03-25 05:06:18,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:06:18" (1/1) ... [2021-03-25 05:06:18,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 05:06:18,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 05:06:18,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 05:06:18,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 05:06:18,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:06:18" (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 05:06:18,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 05:06:18,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 05:06:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 05:06:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 05:06:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 05:06:18,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 05:06:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 05:06:18,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 05:06:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 05:06:18,739 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 05:06:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 05:06:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 05:06:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 05:06:18,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 05:06:18,741 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 05:06:21,547 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 05:06:21,547 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 05:06:21,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 05:06:21 BoogieIcfgContainer [2021-03-25 05:06:21,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 05:06:21,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 05:06:21,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 05:06:21,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 05:06:21,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 05:06:17" (1/3) ... [2021-03-25 05:06:21,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c0e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 05:06:21, skipping insertion in model container [2021-03-25 05:06:21,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:06:18" (2/3) ... [2021-03-25 05:06:21,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c0e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 05:06:21, skipping insertion in model container [2021-03-25 05:06:21,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 05:06:21" (3/3) ... [2021-03-25 05:06:21,557 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_power.opt.i [2021-03-25 05:06:21,563 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 05:06:21,567 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 05:06:21,568 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 05:06:21,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,604 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,605 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,605 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,605 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,620 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,620 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,621 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,621 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,621 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,621 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,621 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,622 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,624 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,624 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,625 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,625 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,639 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,640 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,645 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,645 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,645 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,648 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,649 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:06:21,655 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 05:06:21,672 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 05:06:21,702 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 05:06:21,703 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 05:06:21,703 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 05:06:21,703 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 05:06:21,703 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 05:06:21,703 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 05:06:21,703 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 05:06:21,703 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 05:06:21,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2021-03-25 05:06:21,757 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-03-25 05:06:21,757 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:06:21,770 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-25 05:06:21,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 99 transitions, 213 flow [2021-03-25 05:06:21,776 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 96 transitions, 201 flow [2021-03-25 05:06:21,777 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:06:21,787 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 201 flow [2021-03-25 05:06:21,790 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 201 flow [2021-03-25 05:06:21,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 201 flow [2021-03-25 05:06:21,819 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-03-25 05:06:21,819 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:06:21,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-25 05:06:21,822 INFO L142 LiptonReduction]: Number of co-enabled transitions 1786 [2021-03-25 05:06:22,427 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 05:06:22,807 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 05:06:22,932 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 05:06:24,207 WARN L205 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-25 05:06:24,500 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 05:06:25,724 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-25 05:06:26,288 WARN L205 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 05:06:26,609 INFO L154 LiptonReduction]: Checked pairs total: 3300 [2021-03-25 05:06:26,610 INFO L156 LiptonReduction]: Total number of compositions: 62 [2021-03-25 05:06:26,611 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4835 [2021-03-25 05:06:26,617 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-25 05:06:26,617 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:06:26,618 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:06:26,618 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:06:26,618 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:06:26,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:06:26,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1498083627, now seen corresponding path program 1 times [2021-03-25 05:06:26,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:06:26,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889185617] [2021-03-25 05:06:26,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:06:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:06:26,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:26,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:06:26,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:26,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:06:26,874 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 05:06:26,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889185617] [2021-03-25 05:06:26,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:06:26,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:06:26,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029735160] [2021-03-25 05:06:26,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 05:06:26,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:06:26,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 05:06:26,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 05:06:26,894 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 161 [2021-03-25 05:06:26,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:26,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:06:26,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 161 [2021-03-25 05:06:26,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:06:27,085 INFO L129 PetriNetUnfolder]: 190/443 cut-off events. [2021-03-25 05:06:27,085 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:06:27,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 443 events. 190/443 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2572 event pairs, 40 based on Foata normal form. 32/457 useless extension candidates. Maximal degree in co-relation 733. Up to 223 conditions per place. [2021-03-25 05:06:27,095 INFO L132 encePairwiseOnDemand]: 157/161 looper letters, 15 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2021-03-25 05:06:27,095 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 131 flow [2021-03-25 05:06:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:06:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:06:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2021-03-25 05:06:27,113 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8923395445134575 [2021-03-25 05:06:27,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2021-03-25 05:06:27,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2021-03-25 05:06:27,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:06:27,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2021-03-25 05:06:27,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:27,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:27,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:27,132 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 3 states and 431 transitions. [2021-03-25 05:06:27,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 131 flow [2021-03-25 05:06:27,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 128 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 05:06:27,135 INFO L241 Difference]: Finished difference. Result has 46 places, 37 transitions, 84 flow [2021-03-25 05:06:27,138 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, 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=84, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2021-03-25 05:06:27,138 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2021-03-25 05:06:27,139 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:06:27,139 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 84 flow [2021-03-25 05:06:27,140 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 84 flow [2021-03-25 05:06:27,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 84 flow [2021-03-25 05:06:27,146 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-25 05:06:27,146 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:06:27,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 05:06:27,147 INFO L142 LiptonReduction]: Number of co-enabled transitions 402 [2021-03-25 05:06:27,776 WARN L205 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 188 [2021-03-25 05:06:28,038 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 05:06:29,268 WARN L205 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 268 DAG size of output: 267 [2021-03-25 05:06:29,843 WARN L205 SmtUtils]: Spent 574.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 05:06:30,682 WARN L205 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 189 [2021-03-25 05:06:30,932 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 05:06:31,480 WARN L205 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 272 [2021-03-25 05:06:32,034 WARN L205 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 272 [2021-03-25 05:06:32,355 INFO L154 LiptonReduction]: Checked pairs total: 1585 [2021-03-25 05:06:32,356 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-25 05:06:32,356 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5217 [2021-03-25 05:06:32,357 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 64 flow [2021-03-25 05:06:32,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:32,357 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:06:32,357 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:06:32,357 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 05:06:32,357 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:06:32,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:06:32,358 INFO L82 PathProgramCache]: Analyzing trace with hash 463185172, now seen corresponding path program 1 times [2021-03-25 05:06:32,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:06:32,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036960021] [2021-03-25 05:06:32,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:06:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:06:32,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:32,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:06:32,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:32,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:06:32,487 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 05:06:32,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 05:06:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:06:32,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036960021] [2021-03-25 05:06:32,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:06:32,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:06:32,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683987164] [2021-03-25 05:06:32,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:06:32,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:06:32,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:06:32,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:06:32,494 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 172 [2021-03-25 05:06:32,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:32,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:06:32,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 172 [2021-03-25 05:06:32,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:06:32,525 INFO L129 PetriNetUnfolder]: 1/30 cut-off events. [2021-03-25 05:06:32,526 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 05:06:32,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 30 events. 1/30 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 36. Up to 3 conditions per place. [2021-03-25 05:06:32,526 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 1 selfloop transitions, 2 changer transitions 5/29 dead transitions. [2021-03-25 05:06:32,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 80 flow [2021-03-25 05:06:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:06:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:06:32,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 747 transitions. [2021-03-25 05:06:32,529 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8686046511627907 [2021-03-25 05:06:32,529 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 747 transitions. [2021-03-25 05:06:32,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 747 transitions. [2021-03-25 05:06:32,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:06:32,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 747 transitions. [2021-03-25 05:06:32,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:32,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:32,534 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:32,536 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 64 flow. Second operand 5 states and 747 transitions. [2021-03-25 05:06:32,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 80 flow [2021-03-25 05:06:32,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 05:06:32,537 INFO L241 Difference]: Finished difference. Result has 39 places, 24 transitions, 62 flow [2021-03-25 05:06:32,537 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2021-03-25 05:06:32,537 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2021-03-25 05:06:32,537 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:06:32,537 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 24 transitions, 62 flow [2021-03-25 05:06:32,538 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 24 transitions, 62 flow [2021-03-25 05:06:32,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 62 flow [2021-03-25 05:06:32,542 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 05:06:32,542 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 05:06:32,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 0/24 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 05:06:32,543 INFO L142 LiptonReduction]: Number of co-enabled transitions 240 [2021-03-25 05:06:33,085 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-25 05:06:33,206 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-25 05:06:33,468 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-25 05:06:33,590 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-25 05:06:33,593 INFO L154 LiptonReduction]: Checked pairs total: 888 [2021-03-25 05:06:33,593 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 05:06:33,593 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1056 [2021-03-25 05:06:33,594 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2021-03-25 05:06:33,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:33,594 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:06:33,594 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:06:33,595 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 05:06:33,595 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:06:33,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:06:33,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1204665657, now seen corresponding path program 1 times [2021-03-25 05:06:33,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:06:33,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830828502] [2021-03-25 05:06:33,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:06:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:06:33,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:33,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:06:33,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:33,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:06:33,786 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 05:06:33,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830828502] [2021-03-25 05:06:33,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:06:33,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:06:33,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435072710] [2021-03-25 05:06:33,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 05:06:33,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:06:33,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 05:06:33,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 05:06:33,791 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 174 [2021-03-25 05:06:33,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:33,792 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:06:33,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 174 [2021-03-25 05:06:33,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:06:33,804 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 05:06:33,804 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 05:06:33,804 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 22 events. 0/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 05:06:33,804 INFO L132 encePairwiseOnDemand]: 171/174 looper letters, 1 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2021-03-25 05:06:33,805 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 22 transitions, 64 flow [2021-03-25 05:06:33,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:06:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:06:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-25 05:06:33,807 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8812260536398467 [2021-03-25 05:06:33,807 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-25 05:06:33,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-25 05:06:33,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:06:33,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-25 05:06:33,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:33,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:33,810 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:33,810 INFO L185 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 3 states and 460 transitions. [2021-03-25 05:06:33,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 22 transitions, 64 flow [2021-03-25 05:06:33,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 22 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 05:06:33,811 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 62 flow [2021-03-25 05:06:33,812 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-03-25 05:06:33,812 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -16 predicate places. [2021-03-25 05:06:33,812 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:06:33,812 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 62 flow [2021-03-25 05:06:33,813 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 62 flow [2021-03-25 05:06:33,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 62 flow [2021-03-25 05:06:33,817 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 05:06:33,817 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 05:06:33,817 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 22 events. 0/22 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 05:06:33,818 INFO L142 LiptonReduction]: Number of co-enabled transitions 238 [2021-03-25 05:06:33,820 INFO L154 LiptonReduction]: Checked pairs total: 284 [2021-03-25 05:06:33,820 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:06:33,820 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-03-25 05:06:33,824 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 62 flow [2021-03-25 05:06:33,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:33,824 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:06:33,824 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:06:33,824 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 05:06:33,824 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:06:33,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:06:33,825 INFO L82 PathProgramCache]: Analyzing trace with hash 862428655, now seen corresponding path program 1 times [2021-03-25 05:06:33,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:06:33,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942275524] [2021-03-25 05:06:33,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:06:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:06:33,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:33,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:06:33,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:33,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:06:33,973 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 05:06:33,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942275524] [2021-03-25 05:06:33,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:06:33,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:06:33,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261659324] [2021-03-25 05:06:33,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:06:33,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:06:33,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:06:33,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:06:33,975 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 174 [2021-03-25 05:06:33,976 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:33,976 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:06:33,976 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 174 [2021-03-25 05:06:33,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:06:33,997 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-25 05:06:33,997 INFO L130 PetriNetUnfolder]: For 9/11 co-relation queries the response was YES. [2021-03-25 05:06:33,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 29 events. 0/29 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 3/32 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-25 05:06:33,998 INFO L132 encePairwiseOnDemand]: 170/174 looper letters, 1 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2021-03-25 05:06:33,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 23 transitions, 77 flow [2021-03-25 05:06:33,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 05:06:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 05:06:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 595 transitions. [2021-03-25 05:06:34,000 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8548850574712644 [2021-03-25 05:06:34,000 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 595 transitions. [2021-03-25 05:06:34,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 595 transitions. [2021-03-25 05:06:34,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:06:34,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 595 transitions. [2021-03-25 05:06:34,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:34,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:34,004 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:34,004 INFO L185 Difference]: Start difference. First operand has 33 places, 22 transitions, 62 flow. Second operand 4 states and 595 transitions. [2021-03-25 05:06:34,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 23 transitions, 77 flow [2021-03-25 05:06:34,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 23 transitions, 71 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 05:06:34,005 INFO L241 Difference]: Finished difference. Result has 36 places, 22 transitions, 72 flow [2021-03-25 05:06:34,006 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2021-03-25 05:06:34,006 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -13 predicate places. [2021-03-25 05:06:34,006 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:06:34,006 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 22 transitions, 72 flow [2021-03-25 05:06:34,006 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 22 transitions, 72 flow [2021-03-25 05:06:34,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 22 transitions, 72 flow [2021-03-25 05:06:34,011 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 05:06:34,011 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-25 05:06:34,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 22 events. 0/22 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 05:06:34,012 INFO L142 LiptonReduction]: Number of co-enabled transitions 218 [2021-03-25 05:06:34,107 INFO L154 LiptonReduction]: Checked pairs total: 458 [2021-03-25 05:06:34,107 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:06:34,107 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 101 [2021-03-25 05:06:34,108 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 70 flow [2021-03-25 05:06:34,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:34,108 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:06:34,108 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:06:34,108 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 05:06:34,109 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:06:34,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:06:34,109 INFO L82 PathProgramCache]: Analyzing trace with hash 223329024, now seen corresponding path program 1 times [2021-03-25 05:06:34,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:06:34,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569798831] [2021-03-25 05:06:34,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:06:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:06:34,231 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 05:06:34,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 05:06:34,257 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 05:06:34,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 05:06:34,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:34,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 05:06:34,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:34,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 05:06:34,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:34,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 05:06:34,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:34,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 05:06:34,323 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 05:06:34,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569798831] [2021-03-25 05:06:34,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:06:34,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:06:34,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914548985] [2021-03-25 05:06:34,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 05:06:34,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:06:34,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 05:06:34,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-25 05:06:34,326 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 175 [2021-03-25 05:06:34,327 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 70 flow. Second operand has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:34,327 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:06:34,327 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 175 [2021-03-25 05:06:34,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:06:34,535 INFO L129 PetriNetUnfolder]: 140/280 cut-off events. [2021-03-25 05:06:34,535 INFO L130 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2021-03-25 05:06:34,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 280 events. 140/280 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1283 event pairs, 9 based on Foata normal form. 3/270 useless extension candidates. Maximal degree in co-relation 625. Up to 197 conditions per place. [2021-03-25 05:06:34,537 INFO L132 encePairwiseOnDemand]: 166/175 looper letters, 16 selfloop transitions, 13 changer transitions 0/39 dead transitions. [2021-03-25 05:06:34,537 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 170 flow [2021-03-25 05:06:34,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 05:06:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 05:06:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 775 transitions. [2021-03-25 05:06:34,540 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2021-03-25 05:06:34,540 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 775 transitions. [2021-03-25 05:06:34,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 775 transitions. [2021-03-25 05:06:34,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:06:34,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 775 transitions. [2021-03-25 05:06:34,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:34,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 175.0) internal successors, (1225), 7 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:34,545 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 175.0) internal successors, (1225), 7 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:34,545 INFO L185 Difference]: Start difference. First operand has 35 places, 21 transitions, 70 flow. Second operand 6 states and 775 transitions. [2021-03-25 05:06:34,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 170 flow [2021-03-25 05:06:34,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 155 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 05:06:34,547 INFO L241 Difference]: Finished difference. Result has 39 places, 32 transitions, 141 flow [2021-03-25 05:06:34,548 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2021-03-25 05:06:34,548 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2021-03-25 05:06:34,548 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:06:34,548 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 32 transitions, 141 flow [2021-03-25 05:06:34,548 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 32 transitions, 141 flow [2021-03-25 05:06:34,549 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 141 flow [2021-03-25 05:06:34,567 INFO L129 PetriNetUnfolder]: 24/98 cut-off events. [2021-03-25 05:06:34,567 INFO L130 PetriNetUnfolder]: For 45/51 co-relation queries the response was YES. [2021-03-25 05:06:34,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 98 events. 24/98 cut-off events. For 45/51 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 425 event pairs, 6 based on Foata normal form. 2/96 useless extension candidates. Maximal degree in co-relation 219. Up to 33 conditions per place. [2021-03-25 05:06:34,570 INFO L142 LiptonReduction]: Number of co-enabled transitions 284 [2021-03-25 05:06:35,189 WARN L205 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 05:06:35,442 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 05:06:36,708 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 05:06:37,246 WARN L205 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 05:06:37,252 INFO L154 LiptonReduction]: Checked pairs total: 351 [2021-03-25 05:06:37,253 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:06:37,253 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2705 [2021-03-25 05:06:37,253 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 143 flow [2021-03-25 05:06:37,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:37,254 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:06:37,254 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:06:37,254 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 05:06:37,254 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:06:37,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:06:37,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1539509039, now seen corresponding path program 1 times [2021-03-25 05:06:37,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:06:37,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464959020] [2021-03-25 05:06:37,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:06:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:06:37,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:37,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:06:37,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:37,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:06:37,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:37,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:06:37,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:37,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 05:06:37,340 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 05:06:37,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464959020] [2021-03-25 05:06:37,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:06:37,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:06:37,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310865361] [2021-03-25 05:06:37,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 05:06:37,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:06:37,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 05:06:37,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 05:06:37,342 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 176 [2021-03-25 05:06:37,343 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:37,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:06:37,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 176 [2021-03-25 05:06:37,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:06:37,515 INFO L129 PetriNetUnfolder]: 167/332 cut-off events. [2021-03-25 05:06:37,515 INFO L130 PetriNetUnfolder]: For 220/258 co-relation queries the response was YES. [2021-03-25 05:06:37,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 332 events. 167/332 cut-off events. For 220/258 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1613 event pairs, 23 based on Foata normal form. 14/335 useless extension candidates. Maximal degree in co-relation 945. Up to 218 conditions per place. [2021-03-25 05:06:37,518 INFO L132 encePairwiseOnDemand]: 165/176 looper letters, 17 selfloop transitions, 19 changer transitions 0/46 dead transitions. [2021-03-25 05:06:37,518 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 273 flow [2021-03-25 05:06:37,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 05:06:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 05:06:37,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 771 transitions. [2021-03-25 05:06:37,521 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7301136363636364 [2021-03-25 05:06:37,521 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 771 transitions. [2021-03-25 05:06:37,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 771 transitions. [2021-03-25 05:06:37,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:06:37,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 771 transitions. [2021-03-25 05:06:37,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:37,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:37,525 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:37,525 INFO L185 Difference]: Start difference. First operand has 39 places, 32 transitions, 143 flow. Second operand 6 states and 771 transitions. [2021-03-25 05:06:37,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 273 flow [2021-03-25 05:06:37,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 273 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 05:06:37,532 INFO L241 Difference]: Finished difference. Result has 46 places, 42 transitions, 278 flow [2021-03-25 05:06:37,532 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2021-03-25 05:06:37,532 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2021-03-25 05:06:37,532 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:06:37,532 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 42 transitions, 278 flow [2021-03-25 05:06:37,532 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 278 flow [2021-03-25 05:06:37,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 278 flow [2021-03-25 05:06:37,564 INFO L129 PetriNetUnfolder]: 68/166 cut-off events. [2021-03-25 05:06:37,564 INFO L130 PetriNetUnfolder]: For 206/264 co-relation queries the response was YES. [2021-03-25 05:06:37,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 166 events. 68/166 cut-off events. For 206/264 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 716 event pairs, 23 based on Foata normal form. 4/165 useless extension candidates. Maximal degree in co-relation 534. Up to 106 conditions per place. [2021-03-25 05:06:37,566 INFO L142 LiptonReduction]: Number of co-enabled transitions 344 [2021-03-25 05:06:38,264 WARN L205 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 05:06:38,532 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 05:06:39,733 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 05:06:40,389 WARN L205 SmtUtils]: Spent 654.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 05:06:41,001 WARN L205 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 05:06:41,260 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 05:06:42,564 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 302 DAG size of output: 257 [2021-03-25 05:06:43,185 WARN L205 SmtUtils]: Spent 618.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 05:06:43,195 INFO L154 LiptonReduction]: Checked pairs total: 346 [2021-03-25 05:06:43,195 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 05:06:43,195 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5663 [2021-03-25 05:06:43,195 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 282 flow [2021-03-25 05:06:43,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:43,196 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:06:43,196 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:06:43,196 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 05:06:43,196 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:06:43,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:06:43,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1630667577, now seen corresponding path program 1 times [2021-03-25 05:06:43,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:06:43,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975768688] [2021-03-25 05:06:43,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:06:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:06:43,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:43,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:06:43,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:43,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:06:43,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:43,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 05:06:43,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:43,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 05:06:43,355 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 05:06:43,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975768688] [2021-03-25 05:06:43,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:06:43,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:06:43,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994725710] [2021-03-25 05:06:43,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 05:06:43,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:06:43,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 05:06:43,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 05:06:43,357 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 178 [2021-03-25 05:06:43,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:43,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:06:43,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 178 [2021-03-25 05:06:43,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:06:43,783 INFO L129 PetriNetUnfolder]: 256/532 cut-off events. [2021-03-25 05:06:43,783 INFO L130 PetriNetUnfolder]: For 917/1007 co-relation queries the response was YES. [2021-03-25 05:06:43,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2002 conditions, 532 events. 256/532 cut-off events. For 917/1007 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3025 event pairs, 22 based on Foata normal form. 30/552 useless extension candidates. Maximal degree in co-relation 1984. Up to 311 conditions per place. [2021-03-25 05:06:43,788 INFO L132 encePairwiseOnDemand]: 165/178 looper letters, 42 selfloop transitions, 36 changer transitions 4/92 dead transitions. [2021-03-25 05:06:43,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 92 transitions, 798 flow [2021-03-25 05:06:43,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 05:06:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 05:06:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1141 transitions. [2021-03-25 05:06:43,792 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.712234706616729 [2021-03-25 05:06:43,792 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1141 transitions. [2021-03-25 05:06:43,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1141 transitions. [2021-03-25 05:06:43,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:06:43,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1141 transitions. [2021-03-25 05:06:43,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.77777777777777) internal successors, (1141), 9 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:43,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 178.0) internal successors, (1780), 10 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:43,798 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 178.0) internal successors, (1780), 10 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:43,799 INFO L185 Difference]: Start difference. First operand has 46 places, 42 transitions, 282 flow. Second operand 9 states and 1141 transitions. [2021-03-25 05:06:43,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 92 transitions, 798 flow [2021-03-25 05:06:43,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 92 transitions, 777 flow, removed 10 selfloop flow, removed 1 redundant places. [2021-03-25 05:06:43,806 INFO L241 Difference]: Finished difference. Result has 57 places, 71 transitions, 663 flow [2021-03-25 05:06:43,806 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=663, PETRI_PLACES=57, PETRI_TRANSITIONS=71} [2021-03-25 05:06:43,807 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2021-03-25 05:06:43,807 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:06:43,807 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 71 transitions, 663 flow [2021-03-25 05:06:43,807 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 71 transitions, 663 flow [2021-03-25 05:06:43,808 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 71 transitions, 663 flow [2021-03-25 05:06:43,874 INFO L129 PetriNetUnfolder]: 209/444 cut-off events. [2021-03-25 05:06:43,874 INFO L130 PetriNetUnfolder]: For 1198/1293 co-relation queries the response was YES. [2021-03-25 05:06:43,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1930 conditions, 444 events. 209/444 cut-off events. For 1198/1293 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2515 event pairs, 32 based on Foata normal form. 5/435 useless extension candidates. Maximal degree in co-relation 1909. Up to 270 conditions per place. [2021-03-25 05:06:43,880 INFO L142 LiptonReduction]: Number of co-enabled transitions 416 [2021-03-25 05:06:44,856 WARN L205 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-25 05:06:45,279 WARN L205 SmtUtils]: Spent 420.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2021-03-25 05:06:47,545 WARN L205 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 377 DAG size of output: 313 [2021-03-25 05:06:48,456 WARN L205 SmtUtils]: Spent 908.00 ms on a formula simplification that was a NOOP. DAG size: 305 [2021-03-25 05:06:49,208 WARN L205 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 05:06:49,536 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 05:06:51,147 WARN L205 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 05:06:51,820 WARN L205 SmtUtils]: Spent 671.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 05:06:52,582 WARN L205 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 05:06:52,991 WARN L205 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 05:06:54,667 WARN L205 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 05:06:55,420 WARN L205 SmtUtils]: Spent 751.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 05:06:56,298 WARN L205 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 05:06:56,679 WARN L205 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 05:06:58,464 WARN L205 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 05:06:59,279 WARN L205 SmtUtils]: Spent 813.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 05:06:59,306 INFO L154 LiptonReduction]: Checked pairs total: 606 [2021-03-25 05:06:59,306 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 05:06:59,306 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15499 [2021-03-25 05:06:59,307 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 71 transitions, 674 flow [2021-03-25 05:06:59,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:59,307 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:06:59,307 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:06:59,308 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 05:06:59,308 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:06:59,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:06:59,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1595428086, now seen corresponding path program 1 times [2021-03-25 05:06:59,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:06:59,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098387415] [2021-03-25 05:06:59,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:06:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:06:59,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:59,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:06:59,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:59,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:06:59,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:59,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:06:59,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:06:59,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 05:06:59,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:06:59,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098387415] [2021-03-25 05:06:59,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:06:59,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:06:59,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037357326] [2021-03-25 05:06:59,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 05:06:59,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:06:59,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 05:06:59,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 05:06:59,415 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182 [2021-03-25 05:06:59,416 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 71 transitions, 674 flow. Second operand has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:59,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:06:59,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182 [2021-03-25 05:06:59,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:06:59,757 INFO L129 PetriNetUnfolder]: 244/527 cut-off events. [2021-03-25 05:06:59,758 INFO L130 PetriNetUnfolder]: For 1711/1909 co-relation queries the response was YES. [2021-03-25 05:06:59,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2645 conditions, 527 events. 244/527 cut-off events. For 1711/1909 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3059 event pairs, 20 based on Foata normal form. 32/547 useless extension candidates. Maximal degree in co-relation 2622. Up to 301 conditions per place. [2021-03-25 05:06:59,763 INFO L132 encePairwiseOnDemand]: 169/182 looper letters, 42 selfloop transitions, 35 changer transitions 0/87 dead transitions. [2021-03-25 05:06:59,763 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 976 flow [2021-03-25 05:06:59,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 05:06:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 05:06:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 772 transitions. [2021-03-25 05:06:59,767 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.706959706959707 [2021-03-25 05:06:59,767 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 772 transitions. [2021-03-25 05:06:59,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 772 transitions. [2021-03-25 05:06:59,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:06:59,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 772 transitions. [2021-03-25 05:06:59,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:59,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:59,771 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:59,771 INFO L185 Difference]: Start difference. First operand has 57 places, 71 transitions, 674 flow. Second operand 6 states and 772 transitions. [2021-03-25 05:06:59,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 976 flow [2021-03-25 05:06:59,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 967 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-25 05:06:59,780 INFO L241 Difference]: Finished difference. Result has 63 places, 81 transitions, 922 flow [2021-03-25 05:06:59,781 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=922, PETRI_PLACES=63, PETRI_TRANSITIONS=81} [2021-03-25 05:06:59,781 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2021-03-25 05:06:59,781 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:06:59,781 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 81 transitions, 922 flow [2021-03-25 05:06:59,781 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 81 transitions, 922 flow [2021-03-25 05:06:59,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 81 transitions, 922 flow [2021-03-25 05:06:59,857 INFO L129 PetriNetUnfolder]: 213/503 cut-off events. [2021-03-25 05:06:59,857 INFO L130 PetriNetUnfolder]: For 2286/2364 co-relation queries the response was YES. [2021-03-25 05:06:59,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2476 conditions, 503 events. 213/503 cut-off events. For 2286/2364 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3072 event pairs, 25 based on Foata normal form. 8/497 useless extension candidates. Maximal degree in co-relation 2452. Up to 296 conditions per place. [2021-03-25 05:06:59,864 INFO L142 LiptonReduction]: Number of co-enabled transitions 454 [2021-03-25 05:06:59,894 INFO L154 LiptonReduction]: Checked pairs total: 497 [2021-03-25 05:06:59,894 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:06:59,894 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 113 [2021-03-25 05:06:59,894 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 81 transitions, 922 flow [2021-03-25 05:06:59,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:06:59,895 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:06:59,895 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:06:59,895 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 05:06:59,895 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:06:59,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:06:59,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1279037142, now seen corresponding path program 1 times [2021-03-25 05:06:59,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:06:59,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514919915] [2021-03-25 05:06:59,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:06:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:07:00,069 INFO L142 QuantifierPusher]: treesize reduction 30, result has 38.8 percent of original size [2021-03-25 05:07:00,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 05:07:00,091 INFO L142 QuantifierPusher]: treesize reduction 30, result has 42.3 percent of original size [2021-03-25 05:07:00,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 05:07:00,117 INFO L142 QuantifierPusher]: treesize reduction 23, result has 55.8 percent of original size [2021-03-25 05:07:00,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 05:07:00,168 INFO L142 QuantifierPusher]: treesize reduction 49, result has 53.3 percent of original size [2021-03-25 05:07:00,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-03-25 05:07:00,234 INFO L142 QuantifierPusher]: treesize reduction 31, result has 49.2 percent of original size [2021-03-25 05:07:00,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 05:07:00,280 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.7 percent of original size [2021-03-25 05:07:00,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 05:07:00,299 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 05:07:00,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514919915] [2021-03-25 05:07:00,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:07:00,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 05:07:00,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903599204] [2021-03-25 05:07:00,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 05:07:00,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:07:00,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 05:07:00,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-25 05:07:00,303 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 182 [2021-03-25 05:07:00,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 81 transitions, 922 flow. Second operand has 8 states, 8 states have (on average 117.875) internal successors, (943), 8 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:00,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:07:00,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 182 [2021-03-25 05:07:00,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:07:00,800 INFO L129 PetriNetUnfolder]: 262/559 cut-off events. [2021-03-25 05:07:00,800 INFO L130 PetriNetUnfolder]: For 2968/3187 co-relation queries the response was YES. [2021-03-25 05:07:00,802 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3229 conditions, 559 events. 262/559 cut-off events. For 2968/3187 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3227 event pairs, 35 based on Foata normal form. 23/576 useless extension candidates. Maximal degree in co-relation 3203. Up to 417 conditions per place. [2021-03-25 05:07:00,807 INFO L132 encePairwiseOnDemand]: 170/182 looper letters, 63 selfloop transitions, 30 changer transitions 0/103 dead transitions. [2021-03-25 05:07:00,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 103 transitions, 1371 flow [2021-03-25 05:07:00,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 05:07:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 05:07:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 741 transitions. [2021-03-25 05:07:00,811 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2021-03-25 05:07:00,811 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 741 transitions. [2021-03-25 05:07:00,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 741 transitions. [2021-03-25 05:07:00,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:07:00,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 741 transitions. [2021-03-25 05:07:00,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:00,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:00,816 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:00,816 INFO L185 Difference]: Start difference. First operand has 63 places, 81 transitions, 922 flow. Second operand 6 states and 741 transitions. [2021-03-25 05:07:00,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 103 transitions, 1371 flow [2021-03-25 05:07:00,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 103 transitions, 1359 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 05:07:00,826 INFO L241 Difference]: Finished difference. Result has 67 places, 93 transitions, 1191 flow [2021-03-25 05:07:00,827 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1191, PETRI_PLACES=67, PETRI_TRANSITIONS=93} [2021-03-25 05:07:00,827 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2021-03-25 05:07:00,827 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:07:00,827 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 93 transitions, 1191 flow [2021-03-25 05:07:00,827 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 93 transitions, 1191 flow [2021-03-25 05:07:00,828 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 93 transitions, 1191 flow [2021-03-25 05:07:00,917 INFO L129 PetriNetUnfolder]: 231/519 cut-off events. [2021-03-25 05:07:00,918 INFO L130 PetriNetUnfolder]: For 2858/2970 co-relation queries the response was YES. [2021-03-25 05:07:00,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2807 conditions, 519 events. 231/519 cut-off events. For 2858/2970 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3077 event pairs, 21 based on Foata normal form. 12/515 useless extension candidates. Maximal degree in co-relation 2781. Up to 317 conditions per place. [2021-03-25 05:07:00,926 INFO L142 LiptonReduction]: Number of co-enabled transitions 506 [2021-03-25 05:07:00,959 INFO L154 LiptonReduction]: Checked pairs total: 581 [2021-03-25 05:07:00,960 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:07:00,960 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 133 [2021-03-25 05:07:00,960 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 93 transitions, 1191 flow [2021-03-25 05:07:00,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 117.875) internal successors, (943), 8 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:00,961 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:07:00,961 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:07:00,961 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 05:07:00,961 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:07:00,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:07:00,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1793110099, now seen corresponding path program 1 times [2021-03-25 05:07:00,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:07:00,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752381434] [2021-03-25 05:07:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:07:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:07:01,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:01,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:07:01,062 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 05:07:01,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 05:07:01,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:01,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:07:01,073 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 05:07:01,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752381434] [2021-03-25 05:07:01,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:07:01,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:07:01,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408473501] [2021-03-25 05:07:01,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:07:01,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:07:01,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:07:01,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:07:01,075 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 182 [2021-03-25 05:07:01,075 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 93 transitions, 1191 flow. Second operand has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:01,076 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:07:01,076 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 182 [2021-03-25 05:07:01,076 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:07:01,246 INFO L129 PetriNetUnfolder]: 329/731 cut-off events. [2021-03-25 05:07:01,246 INFO L130 PetriNetUnfolder]: For 3379/3634 co-relation queries the response was YES. [2021-03-25 05:07:01,250 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 731 events. 329/731 cut-off events. For 3379/3634 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 4806 event pairs, 71 based on Foata normal form. 168/863 useless extension candidates. Maximal degree in co-relation 3098. Up to 331 conditions per place. [2021-03-25 05:07:01,254 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 10 selfloop transitions, 8 changer transitions 0/84 dead transitions. [2021-03-25 05:07:01,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 84 transitions, 961 flow [2021-03-25 05:07:01,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:07:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:07:01,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 793 transitions. [2021-03-25 05:07:01,258 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8714285714285714 [2021-03-25 05:07:01,258 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 793 transitions. [2021-03-25 05:07:01,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 793 transitions. [2021-03-25 05:07:01,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:07:01,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 793 transitions. [2021-03-25 05:07:01,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 158.6) internal successors, (793), 5 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:01,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:01,262 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:01,262 INFO L185 Difference]: Start difference. First operand has 67 places, 93 transitions, 1191 flow. Second operand 5 states and 793 transitions. [2021-03-25 05:07:01,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 84 transitions, 961 flow [2021-03-25 05:07:01,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 924 flow, removed 1 selfloop flow, removed 6 redundant places. [2021-03-25 05:07:01,273 INFO L241 Difference]: Finished difference. Result has 68 places, 81 transitions, 936 flow [2021-03-25 05:07:01,274 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=936, PETRI_PLACES=68, PETRI_TRANSITIONS=81} [2021-03-25 05:07:01,274 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2021-03-25 05:07:01,274 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:07:01,274 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 81 transitions, 936 flow [2021-03-25 05:07:01,274 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 81 transitions, 936 flow [2021-03-25 05:07:01,275 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 81 transitions, 936 flow [2021-03-25 05:07:01,377 INFO L129 PetriNetUnfolder]: 338/745 cut-off events. [2021-03-25 05:07:01,377 INFO L130 PetriNetUnfolder]: For 3574/3813 co-relation queries the response was YES. [2021-03-25 05:07:01,381 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3556 conditions, 745 events. 338/745 cut-off events. For 3574/3813 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 4915 event pairs, 77 based on Foata normal form. 55/752 useless extension candidates. Maximal degree in co-relation 3529. Up to 321 conditions per place. [2021-03-25 05:07:01,388 INFO L142 LiptonReduction]: Number of co-enabled transitions 692 [2021-03-25 05:07:01,743 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-25 05:07:01,871 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-03-25 05:07:02,407 WARN L205 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2021-03-25 05:07:02,622 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-03-25 05:07:03,606 WARN L205 SmtUtils]: Spent 982.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 05:07:04,066 WARN L205 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 05:07:06,043 WARN L205 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 05:07:07,004 WARN L205 SmtUtils]: Spent 959.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 05:07:08,061 WARN L205 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 259 DAG size of output: 165 [2021-03-25 05:07:08,421 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-25 05:07:10,745 WARN L205 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 365 DAG size of output: 245 [2021-03-25 05:07:11,548 WARN L205 SmtUtils]: Spent 800.00 ms on a formula simplification that was a NOOP. DAG size: 228 [2021-03-25 05:07:11,566 INFO L154 LiptonReduction]: Checked pairs total: 43 [2021-03-25 05:07:11,566 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 05:07:11,566 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10292 [2021-03-25 05:07:11,567 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 81 transitions, 938 flow [2021-03-25 05:07:11,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:11,567 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:07:11,567 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:07:11,567 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 05:07:11,567 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:07:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:07:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash 166022545, now seen corresponding path program 1 times [2021-03-25 05:07:11,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:07:11,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575191527] [2021-03-25 05:07:11,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:07:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:07:11,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:11,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:07:11,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:11,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:07:11,643 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 05:07:11,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 05:07:11,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:11,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:07:11,659 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 05:07:11,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575191527] [2021-03-25 05:07:11,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:07:11,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:07:11,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041137744] [2021-03-25 05:07:11,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 05:07:11,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:07:11,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 05:07:11,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 05:07:11,661 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 185 [2021-03-25 05:07:11,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 81 transitions, 938 flow. Second operand has 5 states, 5 states have (on average 158.8) internal successors, (794), 5 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:11,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:07:11,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 185 [2021-03-25 05:07:11,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:07:11,838 INFO L129 PetriNetUnfolder]: 169/486 cut-off events. [2021-03-25 05:07:11,838 INFO L130 PetriNetUnfolder]: For 2641/3340 co-relation queries the response was YES. [2021-03-25 05:07:11,841 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2377 conditions, 486 events. 169/486 cut-off events. For 2641/3340 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 3402 event pairs, 20 based on Foata normal form. 320/778 useless extension candidates. Maximal degree in co-relation 2348. Up to 245 conditions per place. [2021-03-25 05:07:11,844 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 7 selfloop transitions, 15 changer transitions 3/86 dead transitions. [2021-03-25 05:07:11,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 86 transitions, 969 flow [2021-03-25 05:07:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 05:07:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 05:07:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1131 transitions. [2021-03-25 05:07:11,847 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8733590733590734 [2021-03-25 05:07:11,847 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1131 transitions. [2021-03-25 05:07:11,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1131 transitions. [2021-03-25 05:07:11,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:07:11,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1131 transitions. [2021-03-25 05:07:11,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 161.57142857142858) internal successors, (1131), 7 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:11,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:11,853 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:11,853 INFO L185 Difference]: Start difference. First operand has 68 places, 81 transitions, 938 flow. Second operand 7 states and 1131 transitions. [2021-03-25 05:07:11,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 86 transitions, 969 flow [2021-03-25 05:07:11,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 86 transitions, 959 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-25 05:07:11,862 INFO L241 Difference]: Finished difference. Result has 76 places, 83 transitions, 958 flow [2021-03-25 05:07:11,862 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=958, PETRI_PLACES=76, PETRI_TRANSITIONS=83} [2021-03-25 05:07:11,862 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2021-03-25 05:07:11,862 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:07:11,862 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 83 transitions, 958 flow [2021-03-25 05:07:11,862 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 83 transitions, 958 flow [2021-03-25 05:07:11,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 83 transitions, 958 flow [2021-03-25 05:07:11,920 INFO L129 PetriNetUnfolder]: 161/478 cut-off events. [2021-03-25 05:07:11,921 INFO L130 PetriNetUnfolder]: For 2720/3064 co-relation queries the response was YES. [2021-03-25 05:07:11,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2486 conditions, 478 events. 161/478 cut-off events. For 2720/3064 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 3406 event pairs, 14 based on Foata normal form. 39/493 useless extension candidates. Maximal degree in co-relation 2455. Up to 235 conditions per place. [2021-03-25 05:07:11,928 INFO L142 LiptonReduction]: Number of co-enabled transitions 780 [2021-03-25 05:07:11,936 INFO L154 LiptonReduction]: Checked pairs total: 3 [2021-03-25 05:07:11,937 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:07:11,937 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 75 [2021-03-25 05:07:11,937 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 82 transitions, 944 flow [2021-03-25 05:07:11,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 158.8) internal successors, (794), 5 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:11,938 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:07:11,938 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:07:11,938 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 05:07:11,938 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:07:11,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:07:11,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1655880329, now seen corresponding path program 1 times [2021-03-25 05:07:11,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:07:11,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475399572] [2021-03-25 05:07:11,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:07:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:07:12,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:12,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:07:12,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:12,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:07:12,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:12,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:07:12,037 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 05:07:12,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 05:07:12,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:12,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:07:12,053 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 05:07:12,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475399572] [2021-03-25 05:07:12,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:07:12,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:07:12,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057058201] [2021-03-25 05:07:12,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 05:07:12,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:07:12,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 05:07:12,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 05:07:12,055 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 185 [2021-03-25 05:07:12,056 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 82 transitions, 944 flow. Second operand has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:12,056 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:07:12,056 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 185 [2021-03-25 05:07:12,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:07:12,254 INFO L129 PetriNetUnfolder]: 133/414 cut-off events. [2021-03-25 05:07:12,255 INFO L130 PetriNetUnfolder]: For 3026/4173 co-relation queries the response was YES. [2021-03-25 05:07:12,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2314 conditions, 414 events. 133/414 cut-off events. For 3026/4173 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 2972 event pairs, 11 based on Foata normal form. 273/661 useless extension candidates. Maximal degree in co-relation 2281. Up to 226 conditions per place. [2021-03-25 05:07:12,260 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 2 selfloop transitions, 19 changer transitions 3/83 dead transitions. [2021-03-25 05:07:12,260 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 83 transitions, 983 flow [2021-03-25 05:07:12,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 05:07:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 05:07:12,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1448 transitions. [2021-03-25 05:07:12,265 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8696696696696696 [2021-03-25 05:07:12,265 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1448 transitions. [2021-03-25 05:07:12,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1448 transitions. [2021-03-25 05:07:12,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:07:12,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1448 transitions. [2021-03-25 05:07:12,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 160.88888888888889) internal successors, (1448), 9 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 05:07:12,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:12,271 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:12,271 INFO L185 Difference]: Start difference. First operand has 76 places, 82 transitions, 944 flow. Second operand 9 states and 1448 transitions. [2021-03-25 05:07:12,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 83 transitions, 983 flow [2021-03-25 05:07:12,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 83 transitions, 907 flow, removed 25 selfloop flow, removed 4 redundant places. [2021-03-25 05:07:12,283 INFO L241 Difference]: Finished difference. Result has 83 places, 80 transitions, 890 flow [2021-03-25 05:07:12,283 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=890, PETRI_PLACES=83, PETRI_TRANSITIONS=80} [2021-03-25 05:07:12,283 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2021-03-25 05:07:12,284 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:07:12,284 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 80 transitions, 890 flow [2021-03-25 05:07:12,284 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 80 transitions, 890 flow [2021-03-25 05:07:12,285 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 80 transitions, 890 flow [2021-03-25 05:07:12,341 INFO L129 PetriNetUnfolder]: 129/411 cut-off events. [2021-03-25 05:07:12,341 INFO L130 PetriNetUnfolder]: For 2100/2285 co-relation queries the response was YES. [2021-03-25 05:07:12,343 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2002 conditions, 411 events. 129/411 cut-off events. For 2100/2285 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3020 event pairs, 8 based on Foata normal form. 24/413 useless extension candidates. Maximal degree in co-relation 1969. Up to 110 conditions per place. [2021-03-25 05:07:12,347 INFO L142 LiptonReduction]: Number of co-enabled transitions 768 [2021-03-25 05:07:12,495 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-03-25 05:07:12,623 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-03-25 05:07:12,885 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 05:07:13,172 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 05:07:14,327 WARN L205 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-03-25 05:07:14,826 WARN L205 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-25 05:07:17,247 WARN L205 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 05:07:18,371 WARN L205 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 05:07:19,630 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 247 DAG size of output: 194 [2021-03-25 05:07:20,090 WARN L205 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 05:07:22,757 WARN L205 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 348 DAG size of output: 272 [2021-03-25 05:07:23,866 WARN L205 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 05:07:23,872 INFO L154 LiptonReduction]: Checked pairs total: 137 [2021-03-25 05:07:23,872 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 05:07:23,873 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11589 [2021-03-25 05:07:23,873 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 858 flow [2021-03-25 05:07:23,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:23,874 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:07:23,874 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 05:07:23,874 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 05:07:23,874 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:07:23,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:07:23,874 INFO L82 PathProgramCache]: Analyzing trace with hash -208497094, now seen corresponding path program 1 times [2021-03-25 05:07:23,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:07:23,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127392568] [2021-03-25 05:07:23,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:07:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:07:23,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:23,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:07:23,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:23,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:07:24,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:24,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:07:24,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:24,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:07:24,045 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 05:07:24,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127392568] [2021-03-25 05:07:24,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:07:24,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:07:24,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230625683] [2021-03-25 05:07:24,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 05:07:24,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:07:24,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 05:07:24,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 05:07:24,048 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 188 [2021-03-25 05:07:24,049 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 858 flow. Second operand has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:24,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:07:24,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 188 [2021-03-25 05:07:24,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:07:24,478 INFO L129 PetriNetUnfolder]: 105/277 cut-off events. [2021-03-25 05:07:24,478 INFO L130 PetriNetUnfolder]: For 1888/2147 co-relation queries the response was YES. [2021-03-25 05:07:24,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1620 conditions, 277 events. 105/277 cut-off events. For 1888/2147 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1523 event pairs, 7 based on Foata normal form. 51/324 useless extension candidates. Maximal degree in co-relation 1585. Up to 127 conditions per place. [2021-03-25 05:07:24,482 INFO L132 encePairwiseOnDemand]: 174/188 looper letters, 46 selfloop transitions, 22 changer transitions 6/88 dead transitions. [2021-03-25 05:07:24,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 88 transitions, 1188 flow [2021-03-25 05:07:24,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 05:07:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 05:07:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1039 transitions. [2021-03-25 05:07:24,488 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6908244680851063 [2021-03-25 05:07:24,488 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1039 transitions. [2021-03-25 05:07:24,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1039 transitions. [2021-03-25 05:07:24,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:07:24,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1039 transitions. [2021-03-25 05:07:24,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:24,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:24,494 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:24,494 INFO L185 Difference]: Start difference. First operand has 79 places, 74 transitions, 858 flow. Second operand 8 states and 1039 transitions. [2021-03-25 05:07:24,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 88 transitions, 1188 flow [2021-03-25 05:07:24,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 88 transitions, 1113 flow, removed 26 selfloop flow, removed 11 redundant places. [2021-03-25 05:07:24,503 INFO L241 Difference]: Finished difference. Result has 72 places, 75 transitions, 918 flow [2021-03-25 05:07:24,504 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=918, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2021-03-25 05:07:24,504 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 23 predicate places. [2021-03-25 05:07:24,504 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:07:24,504 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 75 transitions, 918 flow [2021-03-25 05:07:24,504 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 75 transitions, 918 flow [2021-03-25 05:07:24,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 75 transitions, 918 flow [2021-03-25 05:07:24,541 INFO L129 PetriNetUnfolder]: 93/244 cut-off events. [2021-03-25 05:07:24,542 INFO L130 PetriNetUnfolder]: For 1159/1292 co-relation queries the response was YES. [2021-03-25 05:07:24,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 244 events. 93/244 cut-off events. For 1159/1292 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1310 event pairs, 10 based on Foata normal form. 13/254 useless extension candidates. Maximal degree in co-relation 1212. Up to 114 conditions per place. [2021-03-25 05:07:24,545 INFO L142 LiptonReduction]: Number of co-enabled transitions 348 [2021-03-25 05:07:25,927 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 219 DAG size of output: 162 [2021-03-25 05:07:26,379 WARN L205 SmtUtils]: Spent 450.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-25 05:07:29,251 WARN L205 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 322 DAG size of output: 263 [2021-03-25 05:07:30,108 WARN L205 SmtUtils]: Spent 855.00 ms on a formula simplification that was a NOOP. DAG size: 248 [2021-03-25 05:07:30,314 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2021-03-25 05:07:30,723 WARN L205 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 85 [2021-03-25 05:07:31,013 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2021-03-25 05:07:31,470 WARN L205 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 85 [2021-03-25 05:07:31,549 INFO L154 LiptonReduction]: Checked pairs total: 8 [2021-03-25 05:07:31,549 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 05:07:31,549 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7045 [2021-03-25 05:07:31,549 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 935 flow [2021-03-25 05:07:31,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:31,550 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:07:31,550 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:07:31,550 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 05:07:31,550 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:07:31,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:07:31,551 INFO L82 PathProgramCache]: Analyzing trace with hash -141321757, now seen corresponding path program 1 times [2021-03-25 05:07:31,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:07:31,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225026623] [2021-03-25 05:07:31,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:07:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:07:31,630 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-25 05:07:31,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 05:07:31,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:31,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 05:07:31,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:31,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 05:07:31,731 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-03-25 05:07:31,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 05:07:31,750 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-25 05:07:31,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 05:07:31,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:07:31,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225026623] [2021-03-25 05:07:31,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:07:31,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:07:31,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853563040] [2021-03-25 05:07:31,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 05:07:31,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:07:31,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 05:07:31,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 05:07:31,763 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 191 [2021-03-25 05:07:31,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 935 flow. Second operand has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:31,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:07:31,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 191 [2021-03-25 05:07:31,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:07:32,330 INFO L129 PetriNetUnfolder]: 141/380 cut-off events. [2021-03-25 05:07:32,331 INFO L130 PetriNetUnfolder]: For 2214/2924 co-relation queries the response was YES. [2021-03-25 05:07:32,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2035 conditions, 380 events. 141/380 cut-off events. For 2214/2924 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2340 event pairs, 16 based on Foata normal form. 71/447 useless extension candidates. Maximal degree in co-relation 2004. Up to 168 conditions per place. [2021-03-25 05:07:32,334 INFO L132 encePairwiseOnDemand]: 175/191 looper letters, 34 selfloop transitions, 11 changer transitions 45/104 dead transitions. [2021-03-25 05:07:32,334 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 104 transitions, 1464 flow [2021-03-25 05:07:32,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 05:07:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 05:07:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 897 transitions. [2021-03-25 05:07:32,339 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6709050112191474 [2021-03-25 05:07:32,339 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 897 transitions. [2021-03-25 05:07:32,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 897 transitions. [2021-03-25 05:07:32,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:07:32,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 897 transitions. [2021-03-25 05:07:32,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.14285714285714) internal successors, (897), 7 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:32,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:32,343 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:32,344 INFO L185 Difference]: Start difference. First operand has 72 places, 75 transitions, 935 flow. Second operand 7 states and 897 transitions. [2021-03-25 05:07:32,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 104 transitions, 1464 flow [2021-03-25 05:07:32,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 104 transitions, 1409 flow, removed 23 selfloop flow, removed 2 redundant places. [2021-03-25 05:07:32,353 INFO L241 Difference]: Finished difference. Result has 79 places, 58 transitions, 698 flow [2021-03-25 05:07:32,353 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=698, PETRI_PLACES=79, PETRI_TRANSITIONS=58} [2021-03-25 05:07:32,354 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 30 predicate places. [2021-03-25 05:07:32,354 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:07:32,354 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 58 transitions, 698 flow [2021-03-25 05:07:32,354 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 58 transitions, 698 flow [2021-03-25 05:07:32,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 58 transitions, 698 flow [2021-03-25 05:07:32,383 INFO L129 PetriNetUnfolder]: 75/205 cut-off events. [2021-03-25 05:07:32,383 INFO L130 PetriNetUnfolder]: For 1110/1149 co-relation queries the response was YES. [2021-03-25 05:07:32,384 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 205 events. 75/205 cut-off events. For 1110/1149 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1021 event pairs, 10 based on Foata normal form. 8/210 useless extension candidates. Maximal degree in co-relation 1010. Up to 93 conditions per place. [2021-03-25 05:07:32,386 INFO L142 LiptonReduction]: Number of co-enabled transitions 262 [2021-03-25 05:07:32,387 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 05:07:32,387 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:07:32,388 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34 [2021-03-25 05:07:32,388 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 698 flow [2021-03-25 05:07:32,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:32,388 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:07:32,388 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:07:32,389 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 05:07:32,389 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:07:32,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:07:32,389 INFO L82 PathProgramCache]: Analyzing trace with hash 335304081, now seen corresponding path program 1 times [2021-03-25 05:07:32,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:07:32,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042335973] [2021-03-25 05:07:32,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:07:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:07:32,503 INFO L142 QuantifierPusher]: treesize reduction 30, result has 34.8 percent of original size [2021-03-25 05:07:32,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 05:07:32,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:32,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 05:07:32,544 INFO L142 QuantifierPusher]: treesize reduction 26, result has 61.2 percent of original size [2021-03-25 05:07:32,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 05:07:32,599 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-03-25 05:07:32,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 05:07:32,620 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-25 05:07:32,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 05:07:32,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:07:32,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042335973] [2021-03-25 05:07:32,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:07:32,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:07:32,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413989456] [2021-03-25 05:07:32,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 05:07:32,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:07:32,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 05:07:32,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 05:07:32,637 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 191 [2021-03-25 05:07:32,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 698 flow. Second operand has 7 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:32,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:07:32,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 191 [2021-03-25 05:07:32,638 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:07:33,019 INFO L129 PetriNetUnfolder]: 96/273 cut-off events. [2021-03-25 05:07:33,019 INFO L130 PetriNetUnfolder]: For 1441/1503 co-relation queries the response was YES. [2021-03-25 05:07:33,021 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1457 conditions, 273 events. 96/273 cut-off events. For 1441/1503 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1528 event pairs, 16 based on Foata normal form. 21/290 useless extension candidates. Maximal degree in co-relation 1423. Up to 114 conditions per place. [2021-03-25 05:07:33,022 INFO L132 encePairwiseOnDemand]: 184/191 looper letters, 31 selfloop transitions, 2 changer transitions 25/72 dead transitions. [2021-03-25 05:07:33,022 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 72 transitions, 982 flow [2021-03-25 05:07:33,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 05:07:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 05:07:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions. [2021-03-25 05:07:33,026 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6352530541012217 [2021-03-25 05:07:33,026 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 728 transitions. [2021-03-25 05:07:33,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions. [2021-03-25 05:07:33,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:07:33,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions. [2021-03-25 05:07:33,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:33,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:33,031 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:33,031 INFO L185 Difference]: Start difference. First operand has 74 places, 58 transitions, 698 flow. Second operand 6 states and 728 transitions. [2021-03-25 05:07:33,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 72 transitions, 982 flow [2021-03-25 05:07:33,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 72 transitions, 871 flow, removed 28 selfloop flow, removed 11 redundant places. [2021-03-25 05:07:33,039 INFO L241 Difference]: Finished difference. Result has 70 places, 47 transitions, 478 flow [2021-03-25 05:07:33,039 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=478, PETRI_PLACES=70, PETRI_TRANSITIONS=47} [2021-03-25 05:07:33,039 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2021-03-25 05:07:33,039 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:07:33,039 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 47 transitions, 478 flow [2021-03-25 05:07:33,039 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 47 transitions, 478 flow [2021-03-25 05:07:33,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 47 transitions, 478 flow [2021-03-25 05:07:33,065 INFO L129 PetriNetUnfolder]: 70/194 cut-off events. [2021-03-25 05:07:33,066 INFO L130 PetriNetUnfolder]: For 721/729 co-relation queries the response was YES. [2021-03-25 05:07:33,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 194 events. 70/194 cut-off events. For 721/729 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1020 event pairs, 5 based on Foata normal form. 5/198 useless extension candidates. Maximal degree in co-relation 853. Up to 85 conditions per place. [2021-03-25 05:07:33,068 INFO L142 LiptonReduction]: Number of co-enabled transitions 208 [2021-03-25 05:07:33,069 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 05:07:33,069 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:07:33,069 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-03-25 05:07:33,070 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 478 flow [2021-03-25 05:07:33,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:33,071 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:07:33,071 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 05:07:33,071 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 05:07:33,071 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:07:33,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:07:33,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1105759108, now seen corresponding path program 1 times [2021-03-25 05:07:33,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:07:33,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028542153] [2021-03-25 05:07:33,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:07:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:07:33,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:33,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:07:33,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:33,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 05:07:33,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:33,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 05:07:33,213 INFO L142 QuantifierPusher]: treesize reduction 14, result has 50.0 percent of original size [2021-03-25 05:07:33,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 05:07:33,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:33,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 05:07:33,245 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 05:07:33,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028542153] [2021-03-25 05:07:33,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:07:33,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:07:33,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774552251] [2021-03-25 05:07:33,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 05:07:33,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:07:33,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 05:07:33,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 05:07:33,248 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 191 [2021-03-25 05:07:33,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 478 flow. Second operand has 7 states, 7 states have (on average 124.42857142857143) internal successors, (871), 7 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:33,258 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:07:33,258 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 191 [2021-03-25 05:07:33,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:07:33,638 INFO L129 PetriNetUnfolder]: 85/238 cut-off events. [2021-03-25 05:07:33,639 INFO L130 PetriNetUnfolder]: For 839/856 co-relation queries the response was YES. [2021-03-25 05:07:33,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 238 events. 85/238 cut-off events. For 839/856 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1296 event pairs, 4 based on Foata normal form. 14/249 useless extension candidates. Maximal degree in co-relation 1144. Up to 104 conditions per place. [2021-03-25 05:07:33,641 INFO L132 encePairwiseOnDemand]: 183/191 looper letters, 27 selfloop transitions, 11 changer transitions 23/75 dead transitions. [2021-03-25 05:07:33,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 75 transitions, 886 flow [2021-03-25 05:07:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 05:07:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 05:07:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 893 transitions. [2021-03-25 05:07:33,645 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6679132385938669 [2021-03-25 05:07:33,645 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 893 transitions. [2021-03-25 05:07:33,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 893 transitions. [2021-03-25 05:07:33,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:07:33,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 893 transitions. [2021-03-25 05:07:33,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.57142857142857) internal successors, (893), 7 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:33,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:33,649 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:33,649 INFO L185 Difference]: Start difference. First operand has 63 places, 47 transitions, 478 flow. Second operand 7 states and 893 transitions. [2021-03-25 05:07:33,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 75 transitions, 886 flow [2021-03-25 05:07:33,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 807 flow, removed 29 selfloop flow, removed 10 redundant places. [2021-03-25 05:07:33,655 INFO L241 Difference]: Finished difference. Result has 61 places, 44 transitions, 430 flow [2021-03-25 05:07:33,655 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=430, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2021-03-25 05:07:33,655 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2021-03-25 05:07:33,655 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:07:33,655 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 44 transitions, 430 flow [2021-03-25 05:07:33,656 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 44 transitions, 430 flow [2021-03-25 05:07:33,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 44 transitions, 430 flow [2021-03-25 05:07:33,674 INFO L129 PetriNetUnfolder]: 50/146 cut-off events. [2021-03-25 05:07:33,674 INFO L130 PetriNetUnfolder]: For 465/478 co-relation queries the response was YES. [2021-03-25 05:07:33,675 INFO L84 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 146 events. 50/146 cut-off events. For 465/478 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 662 event pairs, 2 based on Foata normal form. 6/150 useless extension candidates. Maximal degree in co-relation 630. Up to 64 conditions per place. [2021-03-25 05:07:33,676 INFO L142 LiptonReduction]: Number of co-enabled transitions 192 [2021-03-25 05:07:33,677 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 05:07:33,677 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:07:33,677 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-25 05:07:33,678 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 430 flow [2021-03-25 05:07:33,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 124.42857142857143) internal successors, (871), 7 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:33,678 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:07:33,678 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 05:07:33,678 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 05:07:33,678 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:07:33,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:07:33,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1753431276, now seen corresponding path program 1 times [2021-03-25 05:07:33,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:07:33,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141289983] [2021-03-25 05:07:33,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:07:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:07:33,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:33,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:07:33,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:33,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 05:07:33,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:33,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 05:07:33,849 INFO L142 QuantifierPusher]: treesize reduction 40, result has 55.6 percent of original size [2021-03-25 05:07:33,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 05:07:33,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:33,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 05:07:33,948 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-03-25 05:07:33,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 05:07:33,971 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-25 05:07:33,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 05:07:33,985 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 05:07:33,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141289983] [2021-03-25 05:07:33,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:07:33,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 05:07:33,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045954474] [2021-03-25 05:07:33,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 05:07:33,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:07:33,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 05:07:33,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 05:07:33,987 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 191 [2021-03-25 05:07:33,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 430 flow. Second operand has 9 states, 9 states have (on average 121.11111111111111) internal successors, (1090), 9 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:33,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:07:33,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 191 [2021-03-25 05:07:33,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:07:34,485 INFO L129 PetriNetUnfolder]: 69/206 cut-off events. [2021-03-25 05:07:34,485 INFO L130 PetriNetUnfolder]: For 660/682 co-relation queries the response was YES. [2021-03-25 05:07:34,486 INFO L84 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 206 events. 69/206 cut-off events. For 660/682 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1076 event pairs, 1 based on Foata normal form. 12/214 useless extension candidates. Maximal degree in co-relation 930. Up to 75 conditions per place. [2021-03-25 05:07:34,487 INFO L132 encePairwiseOnDemand]: 181/191 looper letters, 22 selfloop transitions, 14 changer transitions 13/63 dead transitions. [2021-03-25 05:07:34,487 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 706 flow [2021-03-25 05:07:34,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 05:07:34,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 05:07:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 994 transitions. [2021-03-25 05:07:34,491 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.650523560209424 [2021-03-25 05:07:34,491 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 994 transitions. [2021-03-25 05:07:34,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 994 transitions. [2021-03-25 05:07:34,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:07:34,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 994 transitions. [2021-03-25 05:07:34,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.25) internal successors, (994), 8 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:34,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 191.0) internal successors, (1719), 9 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:34,496 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 191.0) internal successors, (1719), 9 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:34,496 INFO L185 Difference]: Start difference. First operand has 59 places, 44 transitions, 430 flow. Second operand 8 states and 994 transitions. [2021-03-25 05:07:34,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 706 flow [2021-03-25 05:07:34,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 63 transitions, 664 flow, removed 4 selfloop flow, removed 7 redundant places. [2021-03-25 05:07:34,501 INFO L241 Difference]: Finished difference. Result has 62 places, 40 transitions, 392 flow [2021-03-25 05:07:34,501 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=392, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2021-03-25 05:07:34,501 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2021-03-25 05:07:34,501 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:07:34,502 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 40 transitions, 392 flow [2021-03-25 05:07:34,502 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 40 transitions, 392 flow [2021-03-25 05:07:34,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 40 transitions, 392 flow [2021-03-25 05:07:34,518 INFO L129 PetriNetUnfolder]: 42/129 cut-off events. [2021-03-25 05:07:34,519 INFO L130 PetriNetUnfolder]: For 384/393 co-relation queries the response was YES. [2021-03-25 05:07:34,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 129 events. 42/129 cut-off events. For 384/393 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 532 event pairs, 1 based on Foata normal form. 6/133 useless extension candidates. Maximal degree in co-relation 558. Up to 49 conditions per place. [2021-03-25 05:07:34,520 INFO L142 LiptonReduction]: Number of co-enabled transitions 152 [2021-03-25 05:07:34,521 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 05:07:34,521 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:07:34,521 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-25 05:07:34,522 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 392 flow [2021-03-25 05:07:34,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 121.11111111111111) internal successors, (1090), 9 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:34,522 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:07:34,522 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 05:07:34,523 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 05:07:34,523 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:07:34,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:07:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash 634400038, now seen corresponding path program 2 times [2021-03-25 05:07:34,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:07:34,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546395395] [2021-03-25 05:07:34,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:07:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:07:34,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:34,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:07:34,610 INFO L142 QuantifierPusher]: treesize reduction 4, result has 86.7 percent of original size [2021-03-25 05:07:34,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 05:07:34,643 INFO L142 QuantifierPusher]: treesize reduction 37, result has 46.4 percent of original size [2021-03-25 05:07:34,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 05:07:34,681 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-03-25 05:07:34,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 05:07:34,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:07:34,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:07:34,723 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 05:07:34,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546395395] [2021-03-25 05:07:34,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:07:34,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:07:34,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445671506] [2021-03-25 05:07:34,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 05:07:34,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:07:34,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 05:07:34,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 05:07:34,726 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 191 [2021-03-25 05:07:34,726 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 392 flow. Second operand has 7 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:34,727 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:07:34,727 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 191 [2021-03-25 05:07:34,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:07:34,982 INFO L129 PetriNetUnfolder]: 48/149 cut-off events. [2021-03-25 05:07:34,982 INFO L130 PetriNetUnfolder]: For 493/504 co-relation queries the response was YES. [2021-03-25 05:07:34,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 149 events. 48/149 cut-off events. For 493/504 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 659 event pairs, 9 based on Foata normal form. 10/157 useless extension candidates. Maximal degree in co-relation 689. Up to 56 conditions per place. [2021-03-25 05:07:34,984 INFO L132 encePairwiseOnDemand]: 184/191 looper letters, 19 selfloop transitions, 3 changer transitions 13/49 dead transitions. [2021-03-25 05:07:34,984 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 49 transitions, 545 flow [2021-03-25 05:07:34,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 05:07:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 05:07:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 890 transitions. [2021-03-25 05:07:34,987 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6656694091249065 [2021-03-25 05:07:34,987 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 890 transitions. [2021-03-25 05:07:34,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 890 transitions. [2021-03-25 05:07:34,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:07:34,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 890 transitions. [2021-03-25 05:07:34,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.14285714285714) internal successors, (890), 7 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:34,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:34,991 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:34,991 INFO L185 Difference]: Start difference. First operand has 60 places, 40 transitions, 392 flow. Second operand 7 states and 890 transitions. [2021-03-25 05:07:34,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 49 transitions, 545 flow [2021-03-25 05:07:34,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 484 flow, removed 6 selfloop flow, removed 9 redundant places. [2021-03-25 05:07:34,995 INFO L241 Difference]: Finished difference. Result has 59 places, 36 transitions, 299 flow [2021-03-25 05:07:34,995 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=7, PETRI_FLOW=299, PETRI_PLACES=59, PETRI_TRANSITIONS=36} [2021-03-25 05:07:34,995 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2021-03-25 05:07:34,995 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:07:34,995 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 36 transitions, 299 flow [2021-03-25 05:07:34,996 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 36 transitions, 299 flow [2021-03-25 05:07:34,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 36 transitions, 299 flow [2021-03-25 05:07:35,009 INFO L129 PetriNetUnfolder]: 38/113 cut-off events. [2021-03-25 05:07:35,009 INFO L130 PetriNetUnfolder]: For 286/297 co-relation queries the response was YES. [2021-03-25 05:07:35,010 INFO L84 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 113 events. 38/113 cut-off events. For 286/297 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 451 event pairs, 7 based on Foata normal form. 6/117 useless extension candidates. Maximal degree in co-relation 449. Up to 44 conditions per place. [2021-03-25 05:07:35,011 INFO L142 LiptonReduction]: Number of co-enabled transitions 106 [2021-03-25 05:07:35,011 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 05:07:35,012 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:07:35,012 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-03-25 05:07:35,012 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 299 flow [2021-03-25 05:07:35,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:07:35,012 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:07:35,013 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 05:07:35,013 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 05:07:35,013 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:07:35,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:07:35,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1895341315, now seen corresponding path program 1 times [2021-03-25 05:07:35,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:07:35,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29223814] [2021-03-25 05:07:35,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:07:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 05:07:35,064 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 05:07:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 05:07:35,126 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 05:07:35,168 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 05:07:35,168 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 05:07:35,169 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-25 05:07:35,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 05:07:35 BasicIcfg [2021-03-25 05:07:35,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 05:07:35,289 INFO L168 Benchmark]: Toolchain (without parser) took 77299.00 ms. Allocated memory was 362.8 MB in the beginning and 918.6 MB in the end (delta: 555.7 MB). Free memory was 326.1 MB in the beginning and 528.7 MB in the end (delta: -202.6 MB). Peak memory consumption was 355.1 MB. Max. memory is 16.0 GB. [2021-03-25 05:07:35,289 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 362.8 MB. Free memory was 344.6 MB in the beginning and 344.5 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 05:07:35,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.20 ms. Allocated memory is still 362.8 MB. Free memory was 325.9 MB in the beginning and 312.2 MB in the end (delta: 13.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.0 GB. [2021-03-25 05:07:35,293 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.11 ms. Allocated memory is still 362.8 MB. Free memory was 312.2 MB in the beginning and 309.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 05:07:35,293 INFO L168 Benchmark]: Boogie Preprocessor took 66.02 ms. Allocated memory is still 362.8 MB. Free memory was 309.1 MB in the beginning and 305.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 05:07:35,296 INFO L168 Benchmark]: RCFGBuilder took 2906.66 ms. Allocated memory is still 362.8 MB. Free memory was 305.9 MB in the beginning and 252.6 MB in the end (delta: 53.3 MB). Peak memory consumption was 187.4 MB. Max. memory is 16.0 GB. [2021-03-25 05:07:35,296 INFO L168 Benchmark]: TraceAbstraction took 73735.97 ms. Allocated memory was 362.8 MB in the beginning and 918.6 MB in the end (delta: 555.7 MB). Free memory was 251.6 MB in the beginning and 528.7 MB in the end (delta: -277.2 MB). Peak memory consumption was 278.6 MB. Max. memory is 16.0 GB. [2021-03-25 05:07:35,297 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.17 ms. Allocated memory is still 362.8 MB. Free memory was 344.6 MB in the beginning and 344.5 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 520.20 ms. Allocated memory is still 362.8 MB. Free memory was 325.9 MB in the beginning and 312.2 MB in the end (delta: 13.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 63.11 ms. Allocated memory is still 362.8 MB. Free memory was 312.2 MB in the beginning and 309.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 66.02 ms. Allocated memory is still 362.8 MB. Free memory was 309.1 MB in the beginning and 305.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2906.66 ms. Allocated memory is still 362.8 MB. Free memory was 305.9 MB in the beginning and 252.6 MB in the end (delta: 53.3 MB). Peak memory consumption was 187.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 73735.97 ms. Allocated memory was 362.8 MB in the beginning and 918.6 MB in the end (delta: 555.7 MB). Free memory was 251.6 MB in the beginning and 528.7 MB in the end (delta: -277.2 MB). Peak memory consumption was 278.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4819.4ms, 104 PlacesBefore, 49 PlacesAfterwards, 96 TransitionsBefore, 40 TransitionsAfterwards, 1786 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 62 TotalNumberOfCompositions, 3300 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1327, positive: 1239, positive conditional: 0, positive unconditional: 1239, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 780, positive: 753, positive conditional: 0, positive unconditional: 753, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 780, positive: 753, positive conditional: 0, positive unconditional: 753, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1327, positive: 486, positive conditional: 0, positive unconditional: 486, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 780, unknown conditional: 0, unknown unconditional: 780] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5216.0ms, 46 PlacesBefore, 36 PlacesAfterwards, 37 TransitionsBefore, 27 TransitionsAfterwards, 402 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1585 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 277, positive: 184, positive conditional: 0, positive unconditional: 184, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 277, positive: 137, positive conditional: 0, positive unconditional: 137, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 52, unknown conditional: 0, unknown unconditional: 52] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1055.7ms, 39 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 22 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 888 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 149, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 149, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3ms, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 284 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 58, positive: 37, positive conditional: 0, positive unconditional: 37, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 58, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 100.8ms, 36 PlacesBefore, 35 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 458 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 74, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 74, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2704.4ms, 39 PlacesBefore, 39 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 351 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 107, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 107, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5662.5ms, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 346 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 148, positive: 128, positive conditional: 0, positive unconditional: 128, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 148, positive: 124, positive conditional: 0, positive unconditional: 124, 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): 83, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15499.2ms, 57 PlacesBefore, 57 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 606 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 300, positive: 278, positive conditional: 0, positive unconditional: 278, negative: 22, negative conditional: 0, negative unconditional: 22, 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: 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] , Cache Queries: [ total: 300, positive: 272, positive conditional: 0, positive unconditional: 272, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 112.8ms, 63 PlacesBefore, 63 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 497 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 182, positive: 165, positive conditional: 0, positive unconditional: 165, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 182, positive: 162, positive conditional: 0, positive unconditional: 162, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 132.5ms, 67 PlacesBefore, 67 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 581 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 171, positive: 153, positive conditional: 0, positive unconditional: 153, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 171, positive: 153, positive conditional: 0, positive unconditional: 153, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10292.0ms, 68 PlacesBefore, 68 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 43 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 43, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 74.2ms, 76 PlacesBefore, 76 PlacesAfterwards, 83 TransitionsBefore, 82 TransitionsAfterwards, 780 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11588.6ms, 83 PlacesBefore, 79 PlacesAfterwards, 80 TransitionsBefore, 74 TransitionsAfterwards, 768 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 137 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 137, positive: 137, positive conditional: 0, positive unconditional: 137, 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 137, positive: 130, positive conditional: 0, positive unconditional: 130, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7044.7ms, 72 PlacesBefore, 72 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 8 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , 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: 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] , Cache Queries: [ total: 8, positive: 2, positive conditional: 0, positive unconditional: 2, 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): 55, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.4ms, 79 PlacesBefore, 74 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.9ms, 70 PlacesBefore, 63 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.8ms, 61 PlacesBefore, 59 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.4ms, 62 PlacesBefore, 60 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.0ms, 59 PlacesBefore, 56 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2324; [L855] FCALL, FORK 0 pthread_create(&t2324, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L856] 0 pthread_t t2325; [L857] FCALL, FORK 0 pthread_create(&t2325, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2326; [L859] FCALL, FORK 0 pthread_create(&t2326, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_p2_EAX = x [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L832] 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) [L832] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L832] 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) [L832] 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) [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 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 [L835] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L836] 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 [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L799] 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) [L799] 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) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 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 [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L865] 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) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] 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) [L865] 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) [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 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 [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L869] 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 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 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) [L876] 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) [L877] 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)) [L877] EXPR 0 !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) [L877] 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)) [L877] 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)) [L878] 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)) [L878] EXPR 0 !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) [L878] 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)) [L878] 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)) [L879] 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)) [L879] EXPR 0 !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) [L879] 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)) [L879] 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)) [L880] 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)) [L880] EXPR 0 !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) [L880] 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)) [L880] 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)) [L881] 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)) [L881] EXPR 0 !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) [L881] 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)) [L881] 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)) [L882] 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)) [L882] EXPR 0 !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) [L882] 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)) [L882] 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)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=60, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 73471.5ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 5381.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4911.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 74 SDtfs, 96 SDslu, 39 SDs, 0 SdLazy, 941 SolverSat, 332 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2073.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1842.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1191occurred in iteration=9, InterpolantAutomatonStates: 112, 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: 88.6ms SsaConstructionTime, 858.7ms SatisfiabilityAnalysisTime, 2268.4ms InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 265 ConstructedInterpolants, 0 QuantifiedInterpolants, 2075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...