/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 06:31:16,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 06:31:16,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 06:31:16,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 06:31:16,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 06:31:16,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 06:31:16,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 06:31:16,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 06:31:16,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 06:31:16,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 06:31:16,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 06:31:16,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 06:31:16,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 06:31:16,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 06:31:16,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 06:31:16,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 06:31:16,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 06:31:16,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 06:31:16,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 06:31:16,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 06:31:16,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 06:31:16,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 06:31:16,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 06:31:16,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 06:31:16,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 06:31:16,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 06:31:16,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 06:31:16,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 06:31:16,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 06:31:16,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 06:31:16,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 06:31:16,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 06:31:16,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 06:31:16,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 06:31:16,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 06:31:16,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 06:31:16,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 06:31:16,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 06:31:16,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 06:31:16,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 06:31:16,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 06:31:16,682 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-06-11 06:31:16,717 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 06:31:16,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 06:31:16,720 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 06:31:16,720 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 06:31:16,720 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 06:31:16,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 06:31:16,721 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 06:31:16,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 06:31:16,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 06:31:16,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 06:31:16,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 06:31:16,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 06:31:16,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 06:31:16,723 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 06:31:16,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 06:31:16,723 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 06:31:16,723 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 06:31:16,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 06:31:16,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 06:31:16,724 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 06:31:16,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 06:31:16,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 06:31:16,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 06:31:16,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 06:31:16,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 06:31:16,725 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 06:31:16,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 06:31:16,725 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 06:31:16,725 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 06:31:16,725 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-11 06:31:17,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 06:31:17,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 06:31:17,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 06:31:17,092 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 06:31:17,093 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 06:31:17,093 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2021-06-11 06:31:17,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8067026b5/4e5698dc7dfd43f5aa0b24f6debedb8f/FLAG46b3c72fb [2021-06-11 06:31:17,682 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 06:31:17,682 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2021-06-11 06:31:17,720 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8067026b5/4e5698dc7dfd43f5aa0b24f6debedb8f/FLAG46b3c72fb [2021-06-11 06:31:18,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8067026b5/4e5698dc7dfd43f5aa0b24f6debedb8f [2021-06-11 06:31:18,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 06:31:18,015 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 06:31:18,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 06:31:18,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 06:31:18,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 06:31:18,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:31:18" (1/1) ... [2021-06-11 06:31:18,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79697650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:31:18, skipping insertion in model container [2021-06-11 06:31:18,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:31:18" (1/1) ... [2021-06-11 06:31:18,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 06:31:18,087 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 06:31:18,251 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/safe001_pso.oepc.i[950,963] [2021-06-11 06:31:18,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:31:18,384 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 06:31:18,400 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/safe001_pso.oepc.i[950,963] [2021-06-11 06:31:18,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:31:18,524 INFO L208 MainTranslator]: Completed translation [2021-06-11 06:31:18,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:31:18 WrapperNode [2021-06-11 06:31:18,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 06:31:18,525 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 06:31:18,525 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 06:31:18,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 06:31:18,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:31:18" (1/1) ... [2021-06-11 06:31:18,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:31:18" (1/1) ... [2021-06-11 06:31:18,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 06:31:18,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 06:31:18,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 06:31:18,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 06:31:18,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:31:18" (1/1) ... [2021-06-11 06:31:18,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:31:18" (1/1) ... [2021-06-11 06:31:18,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:31:18" (1/1) ... [2021-06-11 06:31:18,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:31:18" (1/1) ... [2021-06-11 06:31:18,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:31:18" (1/1) ... [2021-06-11 06:31:18,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:31:18" (1/1) ... [2021-06-11 06:31:18,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:31:18" (1/1) ... [2021-06-11 06:31:18,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 06:31:18,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 06:31:18,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 06:31:18,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 06:31:18,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:31: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-06-11 06:31:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 06:31:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 06:31:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 06:31:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 06:31:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 06:31:18,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 06:31:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 06:31:18,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 06:31:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 06:31:18,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 06:31:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 06:31:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 06:31:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 06:31:18,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 06:31:18,694 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 06:31:20,574 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 06:31:20,574 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 06:31:20,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:31:20 BoogieIcfgContainer [2021-06-11 06:31:20,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 06:31:20,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 06:31:20,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 06:31:20,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 06:31:20,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 06:31:18" (1/3) ... [2021-06-11 06:31:20,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40442389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:31:20, skipping insertion in model container [2021-06-11 06:31:20,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:31:18" (2/3) ... [2021-06-11 06:31:20,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40442389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:31:20, skipping insertion in model container [2021-06-11 06:31:20,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:31:20" (3/3) ... [2021-06-11 06:31:20,583 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_pso.oepc.i [2021-06-11 06:31:20,588 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 06:31:20,592 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 06:31:20,593 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 06:31:20,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,621 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,621 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,621 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,621 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,625 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,625 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,625 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,625 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,626 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,626 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,626 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,627 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,630 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,630 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,630 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,631 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,635 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,635 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,635 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,638 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,639 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,641 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,642 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:31:20,642 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 06:31:20,659 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 06:31:20,677 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 06:31:20,677 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 06:31:20,677 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 06:31:20,677 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 06:31:20,677 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 06:31:20,678 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 06:31:20,678 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 06:31:20,678 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 06:31:20,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-06-11 06:31:20,718 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-06-11 06:31:20,719 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:31:20,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-06-11 06:31:20,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-06-11 06:31:20,735 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-06-11 06:31:20,736 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:31:20,748 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-06-11 06:31:20,753 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-06-11 06:31:20,758 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-06-11 06:31:20,788 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-06-11 06:31:20,788 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:31:20,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-06-11 06:31:20,793 INFO L151 LiptonReduction]: Number of co-enabled transitions 1686 [2021-06-11 06:31:20,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:20,911 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:20,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:20,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:31:20,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:31:21,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:21,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:21,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:21,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:21,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:21,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:21,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:21,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:21,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:21,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:21,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:21,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:21,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:21,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:21,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,564 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:21,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:31:21,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:31:21,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,677 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 06:31:21,677 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:31:21,702 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:21,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,933 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:21,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:31:21,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:31:21,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:21,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:22,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:22,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,216 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:22,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:31:22,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:31:22,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:22,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:22,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:22,407 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 06:31:22,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:22,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:22,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:22,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:22,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:22,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:22,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:22,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:22,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:22,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:22,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:22,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:22,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:22,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:23,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:23,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:23,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:23,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:23,361 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 06:31:23,769 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 06:31:23,915 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 06:31:23,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:23,933 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:23,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:23,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 06:31:23,937 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:23,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:23,939 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 06:31:23,940 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:31:23,942 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:23,945 INFO L147 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63 [2021-06-11 06:31:23,945 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:23,947 INFO L142 QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size [2021-06-11 06:31:23,948 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term [2021-06-11 06:31:23,948 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:31:23,950 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:23,953 INFO L147 QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50 [2021-06-11 06:31:23,954 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term [2021-06-11 06:31:23,954 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:31:23,955 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:23,959 INFO L147 QuantifierPusher]: treesize reduction 154, result has 42.1 percent of original size 112 [2021-06-11 06:31:24,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:24,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,244 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:24,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:31:24,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:31:24,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:24,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:24,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,450 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:24,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:31:24,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:31:24,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:24,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:24,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,596 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 06:31:24,669 INFO L142 QuantifierPusher]: treesize reduction 84, result has 91.2 percent of original size [2021-06-11 06:31:24,679 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:24,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 06:31:24,686 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:24,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 06:31:24,693 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:24,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,698 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 06:31:24,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:24,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 06:31:24,704 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:24,706 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 06:31:24,706 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 06:31:24,707 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:31:24,708 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,709 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 06:31:24,709 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:31:24,711 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,712 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 06:31:24,712 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:31:24,715 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,720 INFO L147 QuantifierPusher]: treesize reduction 178, result has 42.4 percent of original size 131 [2021-06-11 06:31:24,721 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:24,724 INFO L142 QuantifierPusher]: treesize reduction 178, result has 57.0 percent of original size [2021-06-11 06:31:24,726 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 2, 1] term [2021-06-11 06:31:24,727 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:31:24,730 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,731 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 4, 2, 2, 1] term [2021-06-11 06:31:24,731 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:31:24,733 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,734 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 4, 2, 2, 1] term [2021-06-11 06:31:24,734 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:31:24,739 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,752 INFO L147 QuantifierPusher]: treesize reduction 439, result has 22.0 percent of original size 124 [2021-06-11 06:31:24,753 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 3, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 06:31:24,753 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:31:24,758 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,759 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 3, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 06:31:24,760 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:31:24,762 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,763 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 3, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 06:31:24,763 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:31:24,766 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,772 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:24,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:24,775 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:24,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,778 INFO L147 QuantifierPusher]: treesize reduction 29, result has 3.3 percent of original size 1 [2021-06-11 06:31:24,779 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:24,780 INFO L142 QuantifierPusher]: treesize reduction 31, result has 75.0 percent of original size [2021-06-11 06:31:24,783 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 06:31:24,792 INFO L147 QuantifierPusher]: treesize reduction 1755, result has 8.4 percent of original size 160 [2021-06-11 06:31:24,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:24,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:24,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:25,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:25,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:25,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:25,197 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:25,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:25,199 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:25,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:25,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 06:31:25,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:31:25,201 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:25,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:25,203 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:25,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:25,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 06:31:25,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 06:31:25,205 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:25,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:25,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 06:31:25,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 06:31:25,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:25,440 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:25,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:25,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:31:25,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:31:25,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:25,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:26,040 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-06-11 06:31:26,192 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-11 06:31:26,478 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-06-11 06:31:26,617 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-11 06:31:26,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:26,628 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:26,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:26,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:31:26,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:31:26,663 INFO L163 LiptonReduction]: Checked pairs total: 4853 [2021-06-11 06:31:26,663 INFO L165 LiptonReduction]: Total number of compositions: 86 [2021-06-11 06:31:26,667 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5932 [2021-06-11 06:31:26,678 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2021-06-11 06:31:26,679 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:31:26,679 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:31:26,679 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-06-11 06:31:26,680 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:31:26,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:31:26,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1021376519, now seen corresponding path program 1 times [2021-06-11 06:31:26,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:31:26,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336764967] [2021-06-11 06:31:26,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:31:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:31:26,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:26,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 06:31:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:31:26,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336764967] [2021-06-11 06:31:26,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:31:26,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:31:26,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171504855] [2021-06-11 06:31:26,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:31:26,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:31:26,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:31:26,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:31:26,952 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2021-06-11 06:31:26,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:26,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:31:26,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2021-06-11 06:31:26,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:31:27,040 INFO L129 PetriNetUnfolder]: 49/134 cut-off events. [2021-06-11 06:31:27,040 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:31:27,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 134 events. 49/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 592 event pairs, 27 based on Foata normal form. 23/139 useless extension candidates. Maximal degree in co-relation 220. Up to 65 conditions per place. [2021-06-11 06:31:27,042 INFO L132 encePairwiseOnDemand]: 178/183 looper letters, 9 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2021-06-11 06:31:27,042 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 89 flow [2021-06-11 06:31:27,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:31:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:31:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2021-06-11 06:31:27,055 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.848816029143898 [2021-06-11 06:31:27,056 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2021-06-11 06:31:27,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2021-06-11 06:31:27,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:31:27,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2021-06-11 06:31:27,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:27,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:27,075 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:27,077 INFO L185 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 466 transitions. [2021-06-11 06:31:27,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 89 flow [2021-06-11 06:31:27,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 86 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 06:31:27,081 INFO L241 Difference]: Finished difference. Result has 34 places, 25 transitions, 60 flow [2021-06-11 06:31:27,083 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2021-06-11 06:31:27,084 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2021-06-11 06:31:27,084 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:31:27,084 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 60 flow [2021-06-11 06:31:27,085 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 60 flow [2021-06-11 06:31:27,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 60 flow [2021-06-11 06:31:27,090 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-06-11 06:31:27,090 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:31:27,091 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 06:31:27,091 INFO L151 LiptonReduction]: Number of co-enabled transitions 304 [2021-06-11 06:31:27,893 WARN L205 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2021-06-11 06:31:28,304 WARN L205 SmtUtils]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-06-11 06:31:29,729 WARN L205 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 315 DAG size of output: 271 [2021-06-11 06:31:30,386 WARN L205 SmtUtils]: Spent 655.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-06-11 06:31:30,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:30,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:31,424 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 245 DAG size of output: 204 [2021-06-11 06:31:31,721 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-06-11 06:31:33,568 WARN L205 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 335 DAG size of output: 288 [2021-06-11 06:31:34,407 WARN L205 SmtUtils]: Spent 837.00 ms on a formula simplification that was a NOOP. DAG size: 284 [2021-06-11 06:31:34,694 INFO L163 LiptonReduction]: Checked pairs total: 684 [2021-06-11 06:31:34,695 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 06:31:34,695 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7611 [2021-06-11 06:31:34,695 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-06-11 06:31:34,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:34,696 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:31:34,696 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:31:34,696 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 06:31:34,696 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:31:34,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:31:34,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1616601891, now seen corresponding path program 1 times [2021-06-11 06:31:34,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:31:34,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719518468] [2021-06-11 06:31:34,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:31:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:31:34,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:34,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:31:34,776 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-11 06:31:34,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 06:31:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:31:34,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719518468] [2021-06-11 06:31:34,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:31:34,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:31:34,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593628408] [2021-06-11 06:31:34,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:31:34,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:31:34,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:31:34,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:31:34,794 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 185 [2021-06-11 06:31:34,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:34,795 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:31:34,795 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 185 [2021-06-11 06:31:34,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:31:34,869 INFO L129 PetriNetUnfolder]: 1/26 cut-off events. [2021-06-11 06:31:34,869 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:31:34,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 26 events. 1/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 34. Up to 3 conditions per place. [2021-06-11 06:31:34,869 INFO L132 encePairwiseOnDemand]: 181/185 looper letters, 1 selfloop transitions, 2 changer transitions 5/26 dead transitions. [2021-06-11 06:31:34,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 74 flow [2021-06-11 06:31:34,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:31:34,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:31:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 737 transitions. [2021-06-11 06:31:34,873 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7967567567567567 [2021-06-11 06:31:34,873 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 737 transitions. [2021-06-11 06:31:34,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 737 transitions. [2021-06-11 06:31:34,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:31:34,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 737 transitions. [2021-06-11 06:31:34,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.4) internal successors, (737), 5 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:34,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:34,879 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:34,879 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 737 transitions. [2021-06-11 06:31:34,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 74 flow [2021-06-11 06:31:34,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:31:34,880 INFO L241 Difference]: Finished difference. Result has 36 places, 21 transitions, 56 flow [2021-06-11 06:31:34,880 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=56, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2021-06-11 06:31:34,881 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2021-06-11 06:31:34,881 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:31:34,881 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 56 flow [2021-06-11 06:31:34,881 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 21 transitions, 56 flow [2021-06-11 06:31:34,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2021-06-11 06:31:34,889 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-06-11 06:31:34,889 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:31:34,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 06:31:34,889 INFO L151 LiptonReduction]: Number of co-enabled transitions 214 [2021-06-11 06:31:34,913 INFO L163 LiptonReduction]: Checked pairs total: 240 [2021-06-11 06:31:34,913 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:31:34,914 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-06-11 06:31:34,916 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-06-11 06:31:34,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:34,916 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:31:34,916 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:31:34,917 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 06:31:34,917 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:31:34,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:31:34,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1534488291, now seen corresponding path program 1 times [2021-06-11 06:31:34,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:31:34,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428237771] [2021-06-11 06:31:34,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:31:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:31:34,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:34,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:31:34,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:34,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:31:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:31:34,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428237771] [2021-06-11 06:31:34,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:31:34,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:31:34,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339977624] [2021-06-11 06:31:34,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:31:34,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:31:34,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:31:34,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:31:34,990 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 185 [2021-06-11 06:31:34,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 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-06-11 06:31:34,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:31:34,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 185 [2021-06-11 06:31:34,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:31:35,024 INFO L129 PetriNetUnfolder]: 11/73 cut-off events. [2021-06-11 06:31:35,024 INFO L130 PetriNetUnfolder]: For 13/33 co-relation queries the response was YES. [2021-06-11 06:31:35,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 73 events. 11/73 cut-off events. For 13/33 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 321 event pairs, 1 based on Foata normal form. 5/76 useless extension candidates. Maximal degree in co-relation 121. Up to 15 conditions per place. [2021-06-11 06:31:35,025 INFO L132 encePairwiseOnDemand]: 180/185 looper letters, 8 selfloop transitions, 4 changer transitions 1/28 dead transitions. [2021-06-11 06:31:35,025 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 99 flow [2021-06-11 06:31:35,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:31:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:31:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2021-06-11 06:31:35,027 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8148648648648649 [2021-06-11 06:31:35,028 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 603 transitions. [2021-06-11 06:31:35,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 603 transitions. [2021-06-11 06:31:35,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:31:35,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 603 transitions. [2021-06-11 06:31:35,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,032 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,032 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 4 states and 603 transitions. [2021-06-11 06:31:35,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 99 flow [2021-06-11 06:31:35,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 28 transitions, 93 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:31:35,033 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 78 flow [2021-06-11 06:31:35,033 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-06-11 06:31:35,033 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2021-06-11 06:31:35,033 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:31:35,034 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 78 flow [2021-06-11 06:31:35,034 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 78 flow [2021-06-11 06:31:35,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 78 flow [2021-06-11 06:31:35,039 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-06-11 06:31:35,039 INFO L130 PetriNetUnfolder]: For 9/11 co-relation queries the response was YES. [2021-06-11 06:31:35,039 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 35 events. 3/35 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 87 event pairs, 1 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 60. Up to 10 conditions per place. [2021-06-11 06:31:35,040 INFO L151 LiptonReduction]: Number of co-enabled transitions 200 [2021-06-11 06:31:35,041 INFO L163 LiptonReduction]: Checked pairs total: 190 [2021-06-11 06:31:35,042 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:31:35,042 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-06-11 06:31:35,042 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 78 flow [2021-06-11 06:31:35,043 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-06-11 06:31:35,043 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:31:35,043 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:31:35,043 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 06:31:35,043 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:31:35,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:31:35,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1220303469, now seen corresponding path program 1 times [2021-06-11 06:31:35,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:31:35,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883058176] [2021-06-11 06:31:35,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:31:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:31:35,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:35,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:35,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:35,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:31:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:31:35,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883058176] [2021-06-11 06:31:35,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:31:35,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:31:35,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385740321] [2021-06-11 06:31:35,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:31:35,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:31:35,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:31:35,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:31:35,094 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 185 [2021-06-11 06:31:35,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,094 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:31:35,094 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 185 [2021-06-11 06:31:35,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:31:35,115 INFO L129 PetriNetUnfolder]: 4/53 cut-off events. [2021-06-11 06:31:35,115 INFO L130 PetriNetUnfolder]: For 23/29 co-relation queries the response was YES. [2021-06-11 06:31:35,116 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 53 events. 4/53 cut-off events. For 23/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 183 event pairs, 0 based on Foata normal form. 4/57 useless extension candidates. Maximal degree in co-relation 105. Up to 11 conditions per place. [2021-06-11 06:31:35,116 INFO L132 encePairwiseOnDemand]: 182/185 looper letters, 7 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2021-06-11 06:31:35,116 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 106 flow [2021-06-11 06:31:35,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:31:35,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:31:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2021-06-11 06:31:35,118 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8450450450450451 [2021-06-11 06:31:35,118 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2021-06-11 06:31:35,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2021-06-11 06:31:35,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:31:35,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2021-06-11 06:31:35,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,122 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,122 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 78 flow. Second operand 3 states and 469 transitions. [2021-06-11 06:31:35,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 106 flow [2021-06-11 06:31:35,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 94 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-11 06:31:35,123 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 80 flow [2021-06-11 06:31:35,123 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-06-11 06:31:35,123 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2021-06-11 06:31:35,124 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:31:35,124 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 80 flow [2021-06-11 06:31:35,124 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 80 flow [2021-06-11 06:31:35,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 80 flow [2021-06-11 06:31:35,129 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-06-11 06:31:35,129 INFO L130 PetriNetUnfolder]: For 12/13 co-relation queries the response was YES. [2021-06-11 06:31:35,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 35 events. 0/35 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 86 event pairs, 0 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2021-06-11 06:31:35,130 INFO L151 LiptonReduction]: Number of co-enabled transitions 198 [2021-06-11 06:31:35,131 INFO L163 LiptonReduction]: Checked pairs total: 188 [2021-06-11 06:31:35,131 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:31:35,132 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-06-11 06:31:35,132 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 80 flow [2021-06-11 06:31:35,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,133 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:31:35,133 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:31:35,133 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 06:31:35,133 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:31:35,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:31:35,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1971711446, now seen corresponding path program 1 times [2021-06-11 06:31:35,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:31:35,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429972548] [2021-06-11 06:31:35,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:31:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:31:35,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:35,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:31:35,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:35,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:31:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:31:35,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429972548] [2021-06-11 06:31:35,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:31:35,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:31:35,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131110269] [2021-06-11 06:31:35,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:31:35,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:31:35,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:31:35,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:31:35,178 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 185 [2021-06-11 06:31:35,179 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 149.25) internal successors, (597), 4 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,179 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:31:35,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 185 [2021-06-11 06:31:35,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:31:35,204 INFO L129 PetriNetUnfolder]: 4/56 cut-off events. [2021-06-11 06:31:35,204 INFO L130 PetriNetUnfolder]: For 32/37 co-relation queries the response was YES. [2021-06-11 06:31:35,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 56 events. 4/56 cut-off events. For 32/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 218 event pairs, 2 based on Foata normal form. 4/60 useless extension candidates. Maximal degree in co-relation 112. Up to 12 conditions per place. [2021-06-11 06:31:35,205 INFO L132 encePairwiseOnDemand]: 180/185 looper letters, 4 selfloop transitions, 3 changer transitions 4/26 dead transitions. [2021-06-11 06:31:35,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 114 flow [2021-06-11 06:31:35,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:31:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:31:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 604 transitions. [2021-06-11 06:31:35,207 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8162162162162162 [2021-06-11 06:31:35,208 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 604 transitions. [2021-06-11 06:31:35,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 604 transitions. [2021-06-11 06:31:35,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:31:35,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 604 transitions. [2021-06-11 06:31:35,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,211 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,212 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 80 flow. Second operand 4 states and 604 transitions. [2021-06-11 06:31:35,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 114 flow [2021-06-11 06:31:35,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 106 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-06-11 06:31:35,213 INFO L241 Difference]: Finished difference. Result has 37 places, 21 transitions, 74 flow [2021-06-11 06:31:35,213 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=37, PETRI_TRANSITIONS=21} [2021-06-11 06:31:35,213 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2021-06-11 06:31:35,214 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:31:35,214 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 21 transitions, 74 flow [2021-06-11 06:31:35,214 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 21 transitions, 74 flow [2021-06-11 06:31:35,214 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 21 transitions, 74 flow [2021-06-11 06:31:35,217 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-06-11 06:31:35,217 INFO L130 PetriNetUnfolder]: For 12/13 co-relation queries the response was YES. [2021-06-11 06:31:35,217 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 21 events. 0/21 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 06:31:35,218 INFO L151 LiptonReduction]: Number of co-enabled transitions 158 [2021-06-11 06:31:35,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:35,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:35,336 INFO L163 LiptonReduction]: Checked pairs total: 253 [2021-06-11 06:31:35,336 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 06:31:35,336 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 123 [2021-06-11 06:31:35,336 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 20 transitions, 72 flow [2021-06-11 06:31:35,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 149.25) internal successors, (597), 4 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,337 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:31:35,337 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:31:35,337 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 06:31:35,337 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:31:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:31:35,337 INFO L82 PathProgramCache]: Analyzing trace with hash -185585316, now seen corresponding path program 1 times [2021-06-11 06:31:35,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:31:35,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216695914] [2021-06-11 06:31:35,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:31:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:31:35,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:35,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:35,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:35,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:31:35,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:35,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:31:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:31:35,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216695914] [2021-06-11 06:31:35,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:31:35,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:31:35,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034999930] [2021-06-11 06:31:35,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:31:35,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:31:35,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:31:35,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:31:35,381 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 186 [2021-06-11 06:31:35,382 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 20 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 148.5) internal successors, (594), 4 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,382 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:31:35,382 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 186 [2021-06-11 06:31:35,382 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:31:35,410 INFO L129 PetriNetUnfolder]: 1/32 cut-off events. [2021-06-11 06:31:35,410 INFO L130 PetriNetUnfolder]: For 26/31 co-relation queries the response was YES. [2021-06-11 06:31:35,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 32 events. 1/32 cut-off events. For 26/31 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 5/37 useless extension candidates. Maximal degree in co-relation 60. Up to 5 conditions per place. [2021-06-11 06:31:35,410 INFO L132 encePairwiseOnDemand]: 182/186 looper letters, 4 selfloop transitions, 2 changer transitions 3/23 dead transitions. [2021-06-11 06:31:35,410 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 23 transitions, 102 flow [2021-06-11 06:31:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:31:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:31:35,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 745 transitions. [2021-06-11 06:31:35,413 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8010752688172043 [2021-06-11 06:31:35,413 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 745 transitions. [2021-06-11 06:31:35,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 745 transitions. [2021-06-11 06:31:35,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:31:35,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 745 transitions. [2021-06-11 06:31:35,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,418 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,418 INFO L185 Difference]: Start difference. First operand has 36 places, 20 transitions, 72 flow. Second operand 5 states and 745 transitions. [2021-06-11 06:31:35,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 23 transitions, 102 flow [2021-06-11 06:31:35,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 23 transitions, 83 flow, removed 2 selfloop flow, removed 6 redundant places. [2021-06-11 06:31:35,419 INFO L241 Difference]: Finished difference. Result has 36 places, 20 transitions, 66 flow [2021-06-11 06:31:35,419 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=36, PETRI_TRANSITIONS=20} [2021-06-11 06:31:35,419 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2021-06-11 06:31:35,420 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:31:35,420 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 20 transitions, 66 flow [2021-06-11 06:31:35,420 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 20 transitions, 66 flow [2021-06-11 06:31:35,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 20 transitions, 66 flow [2021-06-11 06:31:35,423 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-06-11 06:31:35,423 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-06-11 06:31:35,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 20 events. 0/20 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 06:31:35,423 INFO L151 LiptonReduction]: Number of co-enabled transitions 118 [2021-06-11 06:31:35,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:35,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:35,452 INFO L163 LiptonReduction]: Checked pairs total: 234 [2021-06-11 06:31:35,452 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 06:31:35,452 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-06-11 06:31:35,454 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 64 flow [2021-06-11 06:31:35,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.5) internal successors, (594), 4 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,455 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:31:35,455 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:31:35,455 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-11 06:31:35,455 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:31:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:31:35,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1984099044, now seen corresponding path program 1 times [2021-06-11 06:31:35,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:31:35,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109323299] [2021-06-11 06:31:35,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:31:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:31:35,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:35,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:31:35,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:35,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:31:35,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:35,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:31:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:31:35,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109323299] [2021-06-11 06:31:35,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:31:35,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:31:35,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878311874] [2021-06-11 06:31:35,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:31:35,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:31:35,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:31:35,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:31:35,530 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 187 [2021-06-11 06:31:35,530 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 19 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,531 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:31:35,531 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 187 [2021-06-11 06:31:35,531 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:31:35,610 INFO L129 PetriNetUnfolder]: 47/113 cut-off events. [2021-06-11 06:31:35,610 INFO L130 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2021-06-11 06:31:35,610 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 113 events. 47/113 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 414 event pairs, 17 based on Foata normal form. 1/111 useless extension candidates. Maximal degree in co-relation 247. Up to 80 conditions per place. [2021-06-11 06:31:35,611 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 8 selfloop transitions, 5 changer transitions 0/24 dead transitions. [2021-06-11 06:31:35,611 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 24 transitions, 100 flow [2021-06-11 06:31:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:31:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:31:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2021-06-11 06:31:35,613 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7352941176470589 [2021-06-11 06:31:35,614 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2021-06-11 06:31:35,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2021-06-11 06:31:35,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:31:35,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2021-06-11 06:31:35,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,617 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,617 INFO L185 Difference]: Start difference. First operand has 33 places, 19 transitions, 64 flow. Second operand 4 states and 550 transitions. [2021-06-11 06:31:35,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 24 transitions, 100 flow [2021-06-11 06:31:35,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 90 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-06-11 06:31:35,619 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 82 flow [2021-06-11 06:31:35,619 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-06-11 06:31:35,619 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -4 predicate places. [2021-06-11 06:31:35,619 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:31:35,619 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 82 flow [2021-06-11 06:31:35,619 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 82 flow [2021-06-11 06:31:35,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 82 flow [2021-06-11 06:31:35,632 INFO L129 PetriNetUnfolder]: 14/56 cut-off events. [2021-06-11 06:31:35,632 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-06-11 06:31:35,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 56 events. 14/56 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 165 event pairs, 6 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 102. Up to 29 conditions per place. [2021-06-11 06:31:35,633 INFO L151 LiptonReduction]: Number of co-enabled transitions 114 [2021-06-11 06:31:35,710 INFO L163 LiptonReduction]: Checked pairs total: 65 [2021-06-11 06:31:35,710 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:31:35,710 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 91 [2021-06-11 06:31:35,711 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 82 flow [2021-06-11 06:31:35,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,711 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:31:35,711 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:31:35,711 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-11 06:31:35,712 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:31:35,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:31:35,712 INFO L82 PathProgramCache]: Analyzing trace with hash 887588957, now seen corresponding path program 1 times [2021-06-11 06:31:35,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:31:35,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574090678] [2021-06-11 06:31:35,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:31:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:31:35,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:35,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:31:35,833 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 06:31:35,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:31:35,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:35,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:31:35,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574090678] [2021-06-11 06:31:35,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:31:35,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:31:35,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988114031] [2021-06-11 06:31:35,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:31:35,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:31:35,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:31:35,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:31:35,845 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 187 [2021-06-11 06:31:35,845 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 82 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-06-11 06:31:35,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:31:35,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 187 [2021-06-11 06:31:35,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:31:35,893 INFO L129 PetriNetUnfolder]: 64/158 cut-off events. [2021-06-11 06:31:35,893 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-11 06:31:35,894 INFO L84 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 158 events. 64/158 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 694 event pairs, 30 based on Foata normal form. 14/159 useless extension candidates. Maximal degree in co-relation 329. Up to 81 conditions per place. [2021-06-11 06:31:35,895 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 8 selfloop transitions, 8 changer transitions 0/32 dead transitions. [2021-06-11 06:31:35,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 134 flow [2021-06-11 06:31:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:31:35,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:31:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 753 transitions. [2021-06-11 06:31:35,897 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8053475935828877 [2021-06-11 06:31:35,897 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 753 transitions. [2021-06-11 06:31:35,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 753 transitions. [2021-06-11 06:31:35,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:31:35,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 753 transitions. [2021-06-11 06:31:35,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.6) internal successors, (753), 5 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,901 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:35,901 INFO L185 Difference]: Start difference. First operand has 33 places, 22 transitions, 82 flow. Second operand 5 states and 753 transitions. [2021-06-11 06:31:35,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 134 flow [2021-06-11 06:31:35,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:31:35,904 INFO L241 Difference]: Finished difference. Result has 38 places, 29 transitions, 136 flow [2021-06-11 06:31:35,904 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2021-06-11 06:31:35,904 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2021-06-11 06:31:35,904 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:31:35,904 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 136 flow [2021-06-11 06:31:35,905 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 136 flow [2021-06-11 06:31:35,905 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 136 flow [2021-06-11 06:31:35,923 INFO L129 PetriNetUnfolder]: 63/154 cut-off events. [2021-06-11 06:31:35,923 INFO L130 PetriNetUnfolder]: For 88/105 co-relation queries the response was YES. [2021-06-11 06:31:35,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 154 events. 63/154 cut-off events. For 88/105 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 679 event pairs, 27 based on Foata normal form. 3/145 useless extension candidates. Maximal degree in co-relation 407. Up to 81 conditions per place. [2021-06-11 06:31:35,925 INFO L151 LiptonReduction]: Number of co-enabled transitions 142 [2021-06-11 06:31:36,045 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2021-06-11 06:31:36,342 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 85 [2021-06-11 06:31:36,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:36,420 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:36,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:36,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 06:31:36,423 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:36,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:36,424 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-11 06:31:36,424 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:31:36,426 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:36,433 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-11 06:31:36,434 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:31:36,435 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-11 06:31:36,435 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-11 06:31:36,436 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:31:36,437 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:36,440 INFO L147 QuantifierPusher]: treesize reduction 100, result has 38.7 percent of original size 63 [2021-06-11 06:31:36,441 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-11 06:31:36,441 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:31:36,442 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:36,449 INFO L147 QuantifierPusher]: treesize reduction 176, result has 33.3 percent of original size 88 [2021-06-11 06:31:36,463 INFO L163 LiptonReduction]: Checked pairs total: 77 [2021-06-11 06:31:36,464 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 06:31:36,464 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 560 [2021-06-11 06:31:36,464 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 139 flow [2021-06-11 06:31:36,465 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-06-11 06:31:36,465 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:31:36,465 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:31:36,465 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 06:31:36,465 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:31:36,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:31:36,465 INFO L82 PathProgramCache]: Analyzing trace with hash 763642618, now seen corresponding path program 1 times [2021-06-11 06:31:36,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:31:36,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526858739] [2021-06-11 06:31:36,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:31:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:31:36,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:36,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:31:36,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:36,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:31:36,548 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 06:31:36,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:31:36,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:36,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:31:36,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526858739] [2021-06-11 06:31:36,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:31:36,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:31:36,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583521033] [2021-06-11 06:31:36,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:31:36,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:31:36,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:31:36,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:31:36,559 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 188 [2021-06-11 06:31:36,560 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:36,560 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:31:36,560 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 188 [2021-06-11 06:31:36,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:31:36,619 INFO L129 PetriNetUnfolder]: 35/115 cut-off events. [2021-06-11 06:31:36,619 INFO L130 PetriNetUnfolder]: For 136/227 co-relation queries the response was YES. [2021-06-11 06:31:36,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 115 events. 35/115 cut-off events. For 136/227 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 464 event pairs, 5 based on Foata normal form. 53/162 useless extension candidates. Maximal degree in co-relation 382. Up to 68 conditions per place. [2021-06-11 06:31:36,620 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 5 selfloop transitions, 15 changer transitions 3/39 dead transitions. [2021-06-11 06:31:36,620 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 243 flow [2021-06-11 06:31:36,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 06:31:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 06:31:36,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1061 transitions. [2021-06-11 06:31:36,623 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8062310030395137 [2021-06-11 06:31:36,624 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1061 transitions. [2021-06-11 06:31:36,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1061 transitions. [2021-06-11 06:31:36,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:31:36,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1061 transitions. [2021-06-11 06:31:36,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 151.57142857142858) internal successors, (1061), 7 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:36,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:36,629 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:36,629 INFO L185 Difference]: Start difference. First operand has 38 places, 29 transitions, 139 flow. Second operand 7 states and 1061 transitions. [2021-06-11 06:31:36,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 243 flow [2021-06-11 06:31:36,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 237 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-11 06:31:36,632 INFO L241 Difference]: Finished difference. Result has 46 places, 36 transitions, 232 flow [2021-06-11 06:31:36,632 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=232, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2021-06-11 06:31:36,632 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2021-06-11 06:31:36,632 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:31:36,632 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 36 transitions, 232 flow [2021-06-11 06:31:36,632 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 36 transitions, 232 flow [2021-06-11 06:31:36,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 36 transitions, 232 flow [2021-06-11 06:31:36,647 INFO L129 PetriNetUnfolder]: 32/109 cut-off events. [2021-06-11 06:31:36,647 INFO L130 PetriNetUnfolder]: For 245/277 co-relation queries the response was YES. [2021-06-11 06:31:36,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 109 events. 32/109 cut-off events. For 245/277 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 460 event pairs, 5 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 395. Up to 62 conditions per place. [2021-06-11 06:31:36,649 INFO L151 LiptonReduction]: Number of co-enabled transitions 166 [2021-06-11 06:31:36,677 INFO L163 LiptonReduction]: Checked pairs total: 75 [2021-06-11 06:31:36,677 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:31:36,677 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 45 [2021-06-11 06:31:36,678 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 232 flow [2021-06-11 06:31:36,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:36,678 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:31:36,679 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:31:36,679 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-11 06:31:36,679 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:31:36,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:31:36,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1306672599, now seen corresponding path program 1 times [2021-06-11 06:31:36,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:31:36,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177254908] [2021-06-11 06:31:36,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:31:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:31:36,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:36,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:31:36,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:36,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:31:36,746 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-06-11 06:31:36,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 06:31:36,752 INFO L142 QuantifierPusher]: treesize reduction 12, result has 42.9 percent of original size [2021-06-11 06:31:36,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 06:31:36,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:36,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:31:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:31:36,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177254908] [2021-06-11 06:31:36,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:31:36,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 06:31:36,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256539065] [2021-06-11 06:31:36,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 06:31:36,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:31:36,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 06:31:36,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 06:31:36,764 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 188 [2021-06-11 06:31:36,765 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 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-06-11 06:31:36,765 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:31:36,765 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 188 [2021-06-11 06:31:36,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:31:36,866 INFO L129 PetriNetUnfolder]: 24/92 cut-off events. [2021-06-11 06:31:36,867 INFO L130 PetriNetUnfolder]: For 411/590 co-relation queries the response was YES. [2021-06-11 06:31:36,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 92 events. 24/92 cut-off events. For 411/590 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 362 event pairs, 1 based on Foata normal form. 58/146 useless extension candidates. Maximal degree in co-relation 396. Up to 58 conditions per place. [2021-06-11 06:31:36,868 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 2 selfloop transitions, 19 changer transitions 3/40 dead transitions. [2021-06-11 06:31:36,868 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 40 transitions, 310 flow [2021-06-11 06:31:36,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 06:31:36,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 06:31:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1358 transitions. [2021-06-11 06:31:36,876 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8026004728132388 [2021-06-11 06:31:36,876 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1358 transitions. [2021-06-11 06:31:36,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1358 transitions. [2021-06-11 06:31:36,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:31:36,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1358 transitions. [2021-06-11 06:31:36,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 150.88888888888889) internal successors, (1358), 9 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:36,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 188.0) internal successors, (1880), 10 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:36,883 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 188.0) internal successors, (1880), 10 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:36,883 INFO L185 Difference]: Start difference. First operand has 46 places, 36 transitions, 232 flow. Second operand 9 states and 1358 transitions. [2021-06-11 06:31:36,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 40 transitions, 310 flow [2021-06-11 06:31:36,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 40 transitions, 269 flow, removed 15 selfloop flow, removed 3 redundant places. [2021-06-11 06:31:36,892 INFO L241 Difference]: Finished difference. Result has 54 places, 37 transitions, 252 flow [2021-06-11 06:31:36,892 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=252, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2021-06-11 06:31:36,893 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2021-06-11 06:31:36,893 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:31:36,893 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 37 transitions, 252 flow [2021-06-11 06:31:36,893 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 37 transitions, 252 flow [2021-06-11 06:31:36,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 37 transitions, 252 flow [2021-06-11 06:31:36,902 INFO L129 PetriNetUnfolder]: 22/88 cut-off events. [2021-06-11 06:31:36,902 INFO L130 PetriNetUnfolder]: For 205/211 co-relation queries the response was YES. [2021-06-11 06:31:36,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 88 events. 22/88 cut-off events. For 205/211 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 398 event pairs, 1 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 317. Up to 25 conditions per place. [2021-06-11 06:31:36,904 INFO L151 LiptonReduction]: Number of co-enabled transitions 148 [2021-06-11 06:31:36,933 INFO L163 LiptonReduction]: Checked pairs total: 65 [2021-06-11 06:31:36,933 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:31:36,933 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-06-11 06:31:36,933 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 252 flow [2021-06-11 06:31:36,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 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-06-11 06:31:36,934 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:31:36,934 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:31:36,934 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-11 06:31:36,934 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:31:36,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:31:36,935 INFO L82 PathProgramCache]: Analyzing trace with hash 114748415, now seen corresponding path program 1 times [2021-06-11 06:31:36,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:31:36,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441793912] [2021-06-11 06:31:36,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:31:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:31:36,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:36,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:31:37,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:37,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-06-11 06:31:37,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:37,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-06-11 06:31:37,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:37,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 06:31:37,088 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.4 percent of original size [2021-06-11 06:31:37,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-06-11 06:31:37,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:37,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 06:31:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:31:37,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441793912] [2021-06-11 06:31:37,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:31:37,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 06:31:37,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884126462] [2021-06-11 06:31:37,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 06:31:37,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:31:37,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 06:31:37,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-06-11 06:31:37,133 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 188 [2021-06-11 06:31:37,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 252 flow. Second operand has 8 states, 8 states have (on average 130.875) internal successors, (1047), 8 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:37,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:31:37,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 188 [2021-06-11 06:31:37,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:31:37,252 INFO L129 PetriNetUnfolder]: 40/144 cut-off events. [2021-06-11 06:31:37,252 INFO L130 PetriNetUnfolder]: For 714/823 co-relation queries the response was YES. [2021-06-11 06:31:37,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 144 events. 40/144 cut-off events. For 714/823 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 724 event pairs, 2 based on Foata normal form. 18/151 useless extension candidates. Maximal degree in co-relation 561. Up to 45 conditions per place. [2021-06-11 06:31:37,253 INFO L132 encePairwiseOnDemand]: 180/188 looper letters, 7 selfloop transitions, 6 changer transitions 6/45 dead transitions. [2021-06-11 06:31:37,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 328 flow [2021-06-11 06:31:37,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 06:31:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 06:31:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 799 transitions. [2021-06-11 06:31:37,256 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2021-06-11 06:31:37,256 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 799 transitions. [2021-06-11 06:31:37,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 799 transitions. [2021-06-11 06:31:37,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:31:37,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 799 transitions. [2021-06-11 06:31:37,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.16666666666666) internal successors, (799), 6 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:37,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:37,260 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:37,260 INFO L185 Difference]: Start difference. First operand has 53 places, 37 transitions, 252 flow. Second operand 6 states and 799 transitions. [2021-06-11 06:31:37,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 328 flow [2021-06-11 06:31:37,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 264 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-06-11 06:31:37,264 INFO L241 Difference]: Finished difference. Result has 53 places, 39 transitions, 224 flow [2021-06-11 06:31:37,264 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2021-06-11 06:31:37,265 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 16 predicate places. [2021-06-11 06:31:37,265 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:31:37,265 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 39 transitions, 224 flow [2021-06-11 06:31:37,265 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 39 transitions, 224 flow [2021-06-11 06:31:37,265 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 39 transitions, 224 flow [2021-06-11 06:31:37,274 INFO L129 PetriNetUnfolder]: 24/89 cut-off events. [2021-06-11 06:31:37,275 INFO L130 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2021-06-11 06:31:37,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 89 events. 24/89 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 374 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 285. Up to 25 conditions per place. [2021-06-11 06:31:37,276 INFO L151 LiptonReduction]: Number of co-enabled transitions 132 [2021-06-11 06:31:37,279 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 06:31:37,279 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:31:37,279 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-06-11 06:31:37,280 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 224 flow [2021-06-11 06:31:37,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 130.875) internal successors, (1047), 8 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:37,280 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:31:37,280 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:31:37,280 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-11 06:31:37,281 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:31:37,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:31:37,281 INFO L82 PathProgramCache]: Analyzing trace with hash -323150746, now seen corresponding path program 1 times [2021-06-11 06:31:37,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:31:37,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850285495] [2021-06-11 06:31:37,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:31:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:31:37,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:37,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 06:31:37,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:37,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 06:31:37,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:37,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 06:31:37,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:37,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:31:37,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:31:37,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 06:31:37,427 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-06-11 06:31:37,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 06:31:37,439 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-06-11 06:31:37,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 06:31:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:31:37,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850285495] [2021-06-11 06:31:37,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:31:37,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 06:31:37,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968005855] [2021-06-11 06:31:37,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 06:31:37,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:31:37,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 06:31:37,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-06-11 06:31:37,443 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 188 [2021-06-11 06:31:37,444 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 224 flow. Second operand has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:37,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:31:37,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 188 [2021-06-11 06:31:37,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:31:37,582 INFO L129 PetriNetUnfolder]: 38/138 cut-off events. [2021-06-11 06:31:37,582 INFO L130 PetriNetUnfolder]: For 268/306 co-relation queries the response was YES. [2021-06-11 06:31:37,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 138 events. 38/138 cut-off events. For 268/306 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 699 event pairs, 0 based on Foata normal form. 15/145 useless extension candidates. Maximal degree in co-relation 475. Up to 45 conditions per place. [2021-06-11 06:31:37,584 INFO L132 encePairwiseOnDemand]: 181/188 looper letters, 6 selfloop transitions, 11 changer transitions 4/47 dead transitions. [2021-06-11 06:31:37,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 314 flow [2021-06-11 06:31:37,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-11 06:31:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-11 06:31:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1067 transitions. [2021-06-11 06:31:37,587 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7094414893617021 [2021-06-11 06:31:37,587 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1067 transitions. [2021-06-11 06:31:37,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1067 transitions. [2021-06-11 06:31:37,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:31:37,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1067 transitions. [2021-06-11 06:31:37,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 133.375) internal successors, (1067), 8 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:37,591 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-06-11 06:31:37,592 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-06-11 06:31:37,592 INFO L185 Difference]: Start difference. First operand has 51 places, 39 transitions, 224 flow. Second operand 8 states and 1067 transitions. [2021-06-11 06:31:37,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 314 flow [2021-06-11 06:31:37,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 47 transitions, 301 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-06-11 06:31:37,596 INFO L241 Difference]: Finished difference. Result has 57 places, 43 transitions, 278 flow [2021-06-11 06:31:37,596 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=278, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2021-06-11 06:31:37,596 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 20 predicate places. [2021-06-11 06:31:37,596 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:31:37,596 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 43 transitions, 278 flow [2021-06-11 06:31:37,596 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 43 transitions, 278 flow [2021-06-11 06:31:37,597 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 43 transitions, 278 flow [2021-06-11 06:31:37,608 INFO L129 PetriNetUnfolder]: 27/103 cut-off events. [2021-06-11 06:31:37,608 INFO L130 PetriNetUnfolder]: For 127/128 co-relation queries the response was YES. [2021-06-11 06:31:37,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 103 events. 27/103 cut-off events. For 127/128 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 488 event pairs, 1 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 353. Up to 30 conditions per place. [2021-06-11 06:31:37,609 INFO L151 LiptonReduction]: Number of co-enabled transitions 148 [2021-06-11 06:31:37,614 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 06:31:37,614 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:31:37,614 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-06-11 06:31:37,616 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 278 flow [2021-06-11 06:31:37,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:31:37,617 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:31:37,617 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:31:37,617 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-11 06:31:37,617 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:31:37,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:31:37,617 INFO L82 PathProgramCache]: Analyzing trace with hash -2012649666, now seen corresponding path program 2 times [2021-06-11 06:31:37,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:31:37,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195660618] [2021-06-11 06:31:37,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:31:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:31:37,668 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:31:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:31:37,717 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:31:37,741 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 06:31:37,742 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 06:31:37,742 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-11 06:31:37,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 06:31:37 BasicIcfg [2021-06-11 06:31:37,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 06:31:37,799 INFO L168 Benchmark]: Toolchain (without parser) took 19784.61 ms. Allocated memory was 364.9 MB in the beginning and 704.6 MB in the end (delta: 339.7 MB). Free memory was 327.7 MB in the beginning and 355.1 MB in the end (delta: -27.4 MB). Peak memory consumption was 315.5 MB. Max. memory is 16.0 GB. [2021-06-11 06:31:37,799 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 364.9 MB. Free memory was 345.7 MB in the beginning and 345.6 MB in the end (delta: 65.5 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 06:31:37,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 505.86 ms. Allocated memory is still 364.9 MB. Free memory was 327.5 MB in the beginning and 323.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:31:37,799 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.98 ms. Allocated memory is still 364.9 MB. Free memory was 323.6 MB in the beginning and 320.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:31:37,799 INFO L168 Benchmark]: Boogie Preprocessor took 36.53 ms. Allocated memory is still 364.9 MB. Free memory was 320.4 MB in the beginning and 318.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:31:37,800 INFO L168 Benchmark]: RCFGBuilder took 1965.15 ms. Allocated memory is still 364.9 MB. Free memory was 318.4 MB in the beginning and 256.0 MB in the end (delta: 62.3 MB). Peak memory consumption was 148.3 MB. Max. memory is 16.0 GB. [2021-06-11 06:31:37,800 INFO L168 Benchmark]: TraceAbstraction took 17220.96 ms. Allocated memory was 364.9 MB in the beginning and 704.6 MB in the end (delta: 339.7 MB). Free memory was 256.0 MB in the beginning and 355.1 MB in the end (delta: -99.1 MB). Peak memory consumption was 241.7 MB. Max. memory is 16.0 GB. [2021-06-11 06:31:37,800 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.13 ms. Allocated memory is still 364.9 MB. Free memory was 345.7 MB in the beginning and 345.6 MB in the end (delta: 65.5 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 505.86 ms. Allocated memory is still 364.9 MB. Free memory was 327.5 MB in the beginning and 323.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 47.98 ms. Allocated memory is still 364.9 MB. Free memory was 323.6 MB in the beginning and 320.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 36.53 ms. Allocated memory is still 364.9 MB. Free memory was 320.4 MB in the beginning and 318.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1965.15 ms. Allocated memory is still 364.9 MB. Free memory was 318.4 MB in the beginning and 256.0 MB in the end (delta: 62.3 MB). Peak memory consumption was 148.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 17220.96 ms. Allocated memory was 364.9 MB in the beginning and 704.6 MB in the end (delta: 339.7 MB). Free memory was 256.0 MB in the beginning and 355.1 MB in the end (delta: -99.1 MB). Peak memory consumption was 241.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5910.1ms, 102 PlacesBefore, 37 PlacesAfterwards, 94 TransitionsBefore, 28 TransitionsAfterwards, 1686 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, 4853 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1759, positive: 1604, positive conditional: 0, positive unconditional: 1604, negative: 155, negative conditional: 0, negative unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1054, positive: 1021, positive conditional: 0, positive unconditional: 1021, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1054, positive: 1021, positive conditional: 0, positive unconditional: 1021, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1054, positive: 1003, positive conditional: 0, positive unconditional: 1003, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 656, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 617, negative conditional: 0, negative unconditional: 617, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1759, positive: 583, positive conditional: 0, positive unconditional: 583, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 1054, unknown conditional: 0, unknown unconditional: 1054] , Statistics on independence cache: Total cache size (in pairs): 1882, Positive cache size: 1849, Positive conditional cache size: 0, Positive unconditional cache size: 1849, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7609.3ms, 34 PlacesBefore, 33 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 684 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 138, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 40, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 300, positive: 90, positive conditional: 0, positive unconditional: 90, negative: 210, negative conditional: 0, negative unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 40, unknown conditional: 0, unknown unconditional: 40] , Statistics on independence cache: Total cache size (in pairs): 1946, Positive cache size: 1902, Positive conditional cache size: 0, Positive unconditional cache size: 1902, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.0ms, 36 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 240 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 57, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 1958, Positive cache size: 1913, Positive conditional cache size: 0, Positive unconditional cache size: 1913, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.8ms, 34 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 190 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 44, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1958, Positive cache size: 1913, Positive conditional cache size: 0, Positive unconditional cache size: 1913, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5ms, 34 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 188 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1958, Positive cache size: 1913, Positive conditional cache size: 0, Positive unconditional cache size: 1913, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 121.8ms, 37 PlacesBefore, 36 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 253 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 65, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 2020, Positive cache size: 1974, Positive conditional cache size: 0, Positive unconditional cache size: 1974, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.2ms, 36 PlacesBefore, 33 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 234 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 65, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 2084, Positive cache size: 2038, Positive conditional cache size: 0, Positive unconditional cache size: 2038, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 90.9ms, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 65 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 76, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 2092, Positive cache size: 2042, Positive conditional cache size: 0, Positive unconditional cache size: 2042, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 559.1ms, 38 PlacesBefore, 38 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 77 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 6, negative conditional: 0, negative unconditional: 6, 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 2150, Positive cache size: 2100, Positive conditional cache size: 0, Positive unconditional cache size: 2100, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44.9ms, 46 PlacesBefore, 46 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 75 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2151, Positive cache size: 2100, Positive conditional cache size: 0, Positive unconditional cache size: 2100, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.6ms, 54 PlacesBefore, 53 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 65 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2152, Positive cache size: 2100, Positive conditional cache size: 0, Positive unconditional cache size: 2100, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.9ms, 53 PlacesBefore, 51 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2152, Positive cache size: 2100, Positive conditional cache size: 0, Positive unconditional cache size: 2100, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.9ms, 57 PlacesBefore, 56 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2152, Positive cache size: 2100, Positive conditional cache size: 0, Positive unconditional cache size: 2100, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1807; [L819] FCALL, FORK 0 pthread_create(&t1807, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1808; [L821] FCALL, FORK 0 pthread_create(&t1808, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 pthread_t t1809; [L823] FCALL, FORK 0 pthread_create(&t1809, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L741] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 17069.0ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1016.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5997.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 49 SDtfs, 30 SDslu, 22 SDs, 0 SdLazy, 256 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 297.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 466.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=12, InterpolantAutomatonStates: 63, 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: 35.8ms SsaConstructionTime, 415.7ms SatisfiabilityAnalysisTime, 751.8ms InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 1014 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...