/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:51:06,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:51:06,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:51:06,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:51:06,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:51:06,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:51:06,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:51:06,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:51:06,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:51:06,642 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:51:06,643 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:51:06,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:51:06,644 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:51:06,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:51:06,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:51:06,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:51:06,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:51:06,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:51:06,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:51:06,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:51:06,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:51:06,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:51:06,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:51:06,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:51:06,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:51:06,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:51:06,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:51:06,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:51:06,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:51:06,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:51:06,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:51:06,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:51:06,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:51:06,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:51:06,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:51:06,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:51:06,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:51:06,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:51:06,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:51:06,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:51:06,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:51:06,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf [2021-03-25 04:51:06,799 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:51:06,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:51:06,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:51:06,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:51:06,801 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:51:06,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:51:06,801 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:51:06,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:51:06,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:51:06,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:51:06,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:51:06,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:51:06,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:51:06,802 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:51:06,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:51:06,802 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:51:06,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:51:06,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:51:06,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:51:06,803 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:51:06,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:51:06,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:51:06,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:51:06,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:51:06,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:51:06,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:51:06,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:51:06,804 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:51:06,804 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:51:06,804 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:51:06,804 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 04:51:07,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:51:07,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:51:07,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:51:07,153 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:51:07,154 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:51:07,155 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i [2021-03-25 04:51:07,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0a7db532/368741c43cdd46c99b6971a53f5ca71d/FLAG792b5ec40 [2021-03-25 04:51:07,818 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:51:07,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i [2021-03-25 04:51:07,833 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0a7db532/368741c43cdd46c99b6971a53f5ca71d/FLAG792b5ec40 [2021-03-25 04:51:08,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0a7db532/368741c43cdd46c99b6971a53f5ca71d [2021-03-25 04:51:08,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:51:08,217 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:51:08,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:51:08,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:51:08,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:51:08,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:51:08" (1/1) ... [2021-03-25 04:51:08,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1908953f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:08, skipping insertion in model container [2021-03-25 04:51:08,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:51:08" (1/1) ... [2021-03-25 04:51:08,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:51:08,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:51:08,425 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/mix057_tso.opt.i[948,961] [2021-03-25 04:51:08,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:51:08,564 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:51:08,572 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/mix057_tso.opt.i[948,961] [2021-03-25 04:51:08,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:51:08,659 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:51:08,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:08 WrapperNode [2021-03-25 04:51:08,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:51:08,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:51:08,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:51:08,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:51:08,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:08" (1/1) ... [2021-03-25 04:51:08,680 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:08" (1/1) ... [2021-03-25 04:51:08,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:51:08,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:51:08,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:51:08,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:51:08,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:08" (1/1) ... [2021-03-25 04:51:08,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:08" (1/1) ... [2021-03-25 04:51:08,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:08" (1/1) ... [2021-03-25 04:51:08,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:08" (1/1) ... [2021-03-25 04:51:08,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:08" (1/1) ... [2021-03-25 04:51:08,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:08" (1/1) ... [2021-03-25 04:51:08,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:08" (1/1) ... [2021-03-25 04:51:08,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:51:08,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:51:08,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:51:08,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:51:08,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:51:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:51:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:51:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:51:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:51:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:51:08,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:51:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:51:08,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:51:08,807 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:51:08,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:51:08,807 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 04:51:08,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 04:51:08,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:51:08,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:51:08,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:51:08,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:51:08,809 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:51:10,932 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:51:10,932 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:51:10,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:51:10 BoogieIcfgContainer [2021-03-25 04:51:10,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:51:10,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:51:10,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:51:10,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:51:10,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:51:08" (1/3) ... [2021-03-25 04:51:10,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5556a01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:51:10, skipping insertion in model container [2021-03-25 04:51:10,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:51:08" (2/3) ... [2021-03-25 04:51:10,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5556a01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:51:10, skipping insertion in model container [2021-03-25 04:51:10,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:51:10" (3/3) ... [2021-03-25 04:51:10,940 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.opt.i [2021-03-25 04:51:10,945 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:51:10,949 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:51:10,950 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:51:10,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,979 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,979 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,980 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,980 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,981 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,981 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,981 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,981 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,983 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,983 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,983 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,983 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,986 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,987 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,987 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,987 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,987 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,987 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,987 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,987 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,987 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,987 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,988 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,988 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,988 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,988 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,988 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,988 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,989 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,989 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,989 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,989 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,989 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,989 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,989 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,990 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,990 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,990 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,990 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,990 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,990 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,990 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,991 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,991 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,991 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,991 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,993 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,993 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,995 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,996 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,998 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,998 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:10,999 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:11,000 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:11,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:11,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:11,001 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:51:11,002 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:51:11,017 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 04:51:11,034 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:51:11,034 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:51:11,034 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:51:11,034 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:51:11,034 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:51:11,034 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:51:11,034 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:51:11,035 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:51:11,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2021-03-25 04:51:11,078 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-03-25 04:51:11,079 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:51:11,082 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-25 04:51:11,083 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 244 flow [2021-03-25 04:51:11,086 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 108 transitions, 228 flow [2021-03-25 04:51:11,087 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:11,095 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 228 flow [2021-03-25 04:51:11,097 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 228 flow [2021-03-25 04:51:11,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 228 flow [2021-03-25 04:51:11,116 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-03-25 04:51:11,116 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:51:11,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-25 04:51:11,119 INFO L142 LiptonReduction]: Number of co-enabled transitions 2406 [2021-03-25 04:51:12,142 WARN L205 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-25 04:51:12,445 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-25 04:51:13,803 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-25 04:51:14,418 WARN L205 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 04:51:15,234 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:51:15,648 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-25 04:51:15,773 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 04:51:16,872 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 04:51:17,195 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 04:51:17,806 WARN L205 SmtUtils]: Spent 607.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 04:51:18,451 WARN L205 SmtUtils]: Spent 643.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 04:51:18,882 INFO L154 LiptonReduction]: Checked pairs total: 4010 [2021-03-25 04:51:18,882 INFO L156 LiptonReduction]: Total number of compositions: 75 [2021-03-25 04:51:18,884 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7797 [2021-03-25 04:51:18,892 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-03-25 04:51:18,892 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:51:18,892 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:18,893 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:18,893 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:18,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:18,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1880455195, now seen corresponding path program 1 times [2021-03-25 04:51:18,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:18,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222146600] [2021-03-25 04:51:18,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:51:19,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:19,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:51:19,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:19,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:51:19,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222146600] [2021-03-25 04:51:19,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:51:19,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:51:19,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383192708] [2021-03-25 04:51:19,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:51:19,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:51:19,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:51:19,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:51:19,212 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 187 [2021-03-25 04:51:19,217 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:19,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:51:19,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 187 [2021-03-25 04:51:19,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:51:19,321 INFO L129 PetriNetUnfolder]: 23/98 cut-off events. [2021-03-25 04:51:19,321 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:51:19,322 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 98 events. 23/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 3 based on Foata normal form. 6/97 useless extension candidates. Maximal degree in co-relation 140. Up to 37 conditions per place. [2021-03-25 04:51:19,324 INFO L132 encePairwiseOnDemand]: 183/187 looper letters, 7 selfloop transitions, 2 changer transitions 5/43 dead transitions. [2021-03-25 04:51:19,324 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 120 flow [2021-03-25 04:51:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:51:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:51:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2021-03-25 04:51:19,342 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9019607843137255 [2021-03-25 04:51:19,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 506 transitions. [2021-03-25 04:51:19,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 506 transitions. [2021-03-25 04:51:19,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:51:19,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 506 transitions. [2021-03-25 04:51:19,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:19,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:19,361 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:19,362 INFO L185 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 3 states and 506 transitions. [2021-03-25 04:51:19,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 120 flow [2021-03-25 04:51:19,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 04:51:19,367 INFO L241 Difference]: Finished difference. Result has 50 places, 35 transitions, 82 flow [2021-03-25 04:51:19,368 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2021-03-25 04:51:19,369 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2021-03-25 04:51:19,369 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:19,369 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 35 transitions, 82 flow [2021-03-25 04:51:19,370 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 35 transitions, 82 flow [2021-03-25 04:51:19,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 82 flow [2021-03-25 04:51:19,378 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-25 04:51:19,378 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:51:19,378 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:51:19,379 INFO L142 LiptonReduction]: Number of co-enabled transitions 362 [2021-03-25 04:51:19,492 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-03-25 04:51:19,601 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-03-25 04:51:19,832 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-25 04:51:19,977 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-25 04:51:20,590 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 04:51:20,855 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 04:51:21,432 WARN L205 SmtUtils]: Spent 574.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 04:51:21,974 WARN L205 SmtUtils]: Spent 541.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 04:51:22,306 INFO L154 LiptonReduction]: Checked pairs total: 1154 [2021-03-25 04:51:22,307 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-25 04:51:22,307 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2938 [2021-03-25 04:51:22,308 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2021-03-25 04:51:22,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:22,308 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:22,308 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:22,309 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:51:22,309 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:22,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:22,309 INFO L82 PathProgramCache]: Analyzing trace with hash 157805214, now seen corresponding path program 1 times [2021-03-25 04:51:22,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:22,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580189852] [2021-03-25 04:51:22,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:51:22,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:22,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:22,471 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:51:22,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:51:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:51:22,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580189852] [2021-03-25 04:51:22,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:51:22,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:51:22,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991074053] [2021-03-25 04:51:22,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:51:22,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:51:22,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:51:22,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:51:22,478 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 195 [2021-03-25 04:51:22,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:22,479 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:51:22,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 195 [2021-03-25 04:51:22,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:51:22,497 INFO L129 PetriNetUnfolder]: 3/39 cut-off events. [2021-03-25 04:51:22,497 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:51:22,498 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 39 events. 3/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 51. Up to 10 conditions per place. [2021-03-25 04:51:22,498 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-25 04:51:22,498 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 82 flow [2021-03-25 04:51:22,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:51:22,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:51:22,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2021-03-25 04:51:22,500 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8683760683760684 [2021-03-25 04:51:22,500 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2021-03-25 04:51:22,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2021-03-25 04:51:22,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:51:22,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2021-03-25 04:51:22,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:22,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:22,503 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:22,504 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 508 transitions. [2021-03-25 04:51:22,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 82 flow [2021-03-25 04:51:22,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:51:22,505 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 81 flow [2021-03-25 04:51:22,505 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-25 04:51:22,505 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2021-03-25 04:51:22,505 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:22,506 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-25 04:51:22,506 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-25 04:51:22,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 81 flow [2021-03-25 04:51:22,510 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-25 04:51:22,510 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:51:22,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 35 events. 3/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2021-03-25 04:51:22,511 INFO L142 LiptonReduction]: Number of co-enabled transitions 344 [2021-03-25 04:51:22,913 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-25 04:51:23,049 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 04:51:23,309 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-25 04:51:23,432 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 04:51:23,436 INFO L154 LiptonReduction]: Checked pairs total: 1002 [2021-03-25 04:51:23,436 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:51:23,436 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 931 [2021-03-25 04:51:23,437 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2021-03-25 04:51:23,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:23,438 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:23,438 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:23,438 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:51:23,438 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:23,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:23,438 INFO L82 PathProgramCache]: Analyzing trace with hash -604271999, now seen corresponding path program 1 times [2021-03-25 04:51:23,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:23,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420894442] [2021-03-25 04:51:23,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:51:23,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:23,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:51:23,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420894442] [2021-03-25 04:51:23,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:51:23,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:51:23,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450024027] [2021-03-25 04:51:23,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:51:23,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:51:23,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:51:23,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:51:23,503 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 197 [2021-03-25 04:51:23,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:23,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:51:23,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 197 [2021-03-25 04:51:23,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:51:23,521 INFO L129 PetriNetUnfolder]: 10/58 cut-off events. [2021-03-25 04:51:23,521 INFO L130 PetriNetUnfolder]: For 8/17 co-relation queries the response was YES. [2021-03-25 04:51:23,521 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 58 events. 10/58 cut-off events. For 8/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 173 event pairs, 3 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 97. Up to 19 conditions per place. [2021-03-25 04:51:23,522 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-25 04:51:23,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 93 flow [2021-03-25 04:51:23,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:51:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:51:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2021-03-25 04:51:23,525 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8849407783417935 [2021-03-25 04:51:23,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 523 transitions. [2021-03-25 04:51:23,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 523 transitions. [2021-03-25 04:51:23,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:51:23,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 523 transitions. [2021-03-25 04:51:23,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:23,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:23,528 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:23,528 INFO L185 Difference]: Start difference. First operand has 37 places, 27 transitions, 77 flow. Second operand 3 states and 523 transitions. [2021-03-25 04:51:23,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 93 flow [2021-03-25 04:51:23,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 90 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:51:23,530 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 93 flow [2021-03-25 04:51:23,530 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-25 04:51:23,530 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2021-03-25 04:51:23,530 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:23,530 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 93 flow [2021-03-25 04:51:23,531 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 93 flow [2021-03-25 04:51:23,531 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 93 flow [2021-03-25 04:51:23,537 INFO L129 PetriNetUnfolder]: 7/49 cut-off events. [2021-03-25 04:51:23,537 INFO L130 PetriNetUnfolder]: For 7/9 co-relation queries the response was YES. [2021-03-25 04:51:23,538 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 49 events. 7/49 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 139 event pairs, 3 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 82. Up to 15 conditions per place. [2021-03-25 04:51:23,538 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-25 04:51:23,540 INFO L154 LiptonReduction]: Checked pairs total: 282 [2021-03-25 04:51:23,541 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:51:23,541 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11 [2021-03-25 04:51:23,541 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 93 flow [2021-03-25 04:51:23,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:23,542 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:23,542 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:23,542 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:51:23,542 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:23,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:23,543 INFO L82 PathProgramCache]: Analyzing trace with hash 370417324, now seen corresponding path program 1 times [2021-03-25 04:51:23,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:23,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122785633] [2021-03-25 04:51:23,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:51:23,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:23,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:51:23,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:23,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:23,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:51:23,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122785633] [2021-03-25 04:51:23,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:51:23,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:51:23,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634507301] [2021-03-25 04:51:23,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:51:23,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:51:23,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:51:23,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:51:23,608 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 197 [2021-03-25 04:51:23,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:23,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:51:23,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 197 [2021-03-25 04:51:23,609 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:51:23,631 INFO L129 PetriNetUnfolder]: 4/52 cut-off events. [2021-03-25 04:51:23,631 INFO L130 PetriNetUnfolder]: For 31/84 co-relation queries the response was YES. [2021-03-25 04:51:23,631 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 52 events. 4/52 cut-off events. For 31/84 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 175 event pairs, 1 based on Foata normal form. 4/52 useless extension candidates. Maximal degree in co-relation 98. Up to 15 conditions per place. [2021-03-25 04:51:23,632 INFO L132 encePairwiseOnDemand]: 194/197 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-25 04:51:23,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 105 flow [2021-03-25 04:51:23,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:51:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:51:23,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2021-03-25 04:51:23,634 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.883248730964467 [2021-03-25 04:51:23,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2021-03-25 04:51:23,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2021-03-25 04:51:23,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:51:23,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2021-03-25 04:51:23,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:23,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:23,638 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:23,638 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 93 flow. Second operand 3 states and 522 transitions. [2021-03-25 04:51:23,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 105 flow [2021-03-25 04:51:23,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 102 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:51:23,640 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 101 flow [2021-03-25 04:51:23,640 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2021-03-25 04:51:23,641 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -13 predicate places. [2021-03-25 04:51:23,641 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:23,641 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 101 flow [2021-03-25 04:51:23,641 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 29 transitions, 101 flow [2021-03-25 04:51:23,642 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 101 flow [2021-03-25 04:51:23,647 INFO L129 PetriNetUnfolder]: 4/45 cut-off events. [2021-03-25 04:51:23,648 INFO L130 PetriNetUnfolder]: For 39/55 co-relation queries the response was YES. [2021-03-25 04:51:23,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 45 events. 4/45 cut-off events. For 39/55 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 2 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 81. Up to 13 conditions per place. [2021-03-25 04:51:23,650 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-25 04:51:23,652 INFO L154 LiptonReduction]: Checked pairs total: 316 [2021-03-25 04:51:23,652 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:51:23,652 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11 [2021-03-25 04:51:23,654 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 101 flow [2021-03-25 04:51:23,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:23,654 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:23,654 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:23,654 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:51:23,655 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:23,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:23,655 INFO L82 PathProgramCache]: Analyzing trace with hash -921273539, now seen corresponding path program 1 times [2021-03-25 04:51:23,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:23,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713497155] [2021-03-25 04:51:23,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:51:23,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:23,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 04:51:23,825 INFO L142 QuantifierPusher]: treesize reduction 14, result has 48.1 percent of original size [2021-03-25 04:51:23,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:51:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:51:23,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713497155] [2021-03-25 04:51:23,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:51:23,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:51:23,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316451011] [2021-03-25 04:51:23,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:51:23,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:51:23,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:51:23,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:51:23,846 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 197 [2021-03-25 04:51:23,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:23,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:51:23,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 197 [2021-03-25 04:51:23,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:51:23,929 INFO L129 PetriNetUnfolder]: 109/279 cut-off events. [2021-03-25 04:51:23,929 INFO L130 PetriNetUnfolder]: For 361/485 co-relation queries the response was YES. [2021-03-25 04:51:23,930 INFO L84 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 279 events. 109/279 cut-off events. For 361/485 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1544 event pairs, 68 based on Foata normal form. 3/246 useless extension candidates. Maximal degree in co-relation 643. Up to 165 conditions per place. [2021-03-25 04:51:23,932 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 7 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2021-03-25 04:51:23,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 32 transitions, 127 flow [2021-03-25 04:51:23,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:51:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:51:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2021-03-25 04:51:23,935 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8104906937394247 [2021-03-25 04:51:23,935 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2021-03-25 04:51:23,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2021-03-25 04:51:23,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:51:23,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2021-03-25 04:51:23,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:23,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:23,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:23,938 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 101 flow. Second operand 3 states and 479 transitions. [2021-03-25 04:51:23,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 32 transitions, 127 flow [2021-03-25 04:51:23,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 122 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 04:51:23,942 INFO L241 Difference]: Finished difference. Result has 43 places, 31 transitions, 115 flow [2021-03-25 04:51:23,942 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2021-03-25 04:51:23,943 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2021-03-25 04:51:23,943 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:23,943 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 115 flow [2021-03-25 04:51:23,943 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 115 flow [2021-03-25 04:51:23,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 115 flow [2021-03-25 04:51:23,961 INFO L129 PetriNetUnfolder]: 15/84 cut-off events. [2021-03-25 04:51:23,962 INFO L130 PetriNetUnfolder]: For 139/171 co-relation queries the response was YES. [2021-03-25 04:51:23,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 84 events. 15/84 cut-off events. For 139/171 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 370 event pairs, 7 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 186. Up to 29 conditions per place. [2021-03-25 04:51:23,963 INFO L142 LiptonReduction]: Number of co-enabled transitions 428 [2021-03-25 04:51:23,966 INFO L154 LiptonReduction]: Checked pairs total: 260 [2021-03-25 04:51:23,966 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:51:23,966 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-03-25 04:51:23,970 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 115 flow [2021-03-25 04:51:23,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:23,971 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:23,971 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:23,971 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:51:23,971 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:23,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:23,978 INFO L82 PathProgramCache]: Analyzing trace with hash -583256081, now seen corresponding path program 1 times [2021-03-25 04:51:23,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:23,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32676044] [2021-03-25 04:51:23,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:51:24,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:24,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:51:24,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:24,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:51:24,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:24,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:51:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:51:24,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32676044] [2021-03-25 04:51:24,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:51:24,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:51:24,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163738261] [2021-03-25 04:51:24,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:51:24,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:51:24,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:51:24,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:51:24,107 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 197 [2021-03-25 04:51:24,108 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:24,108 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:51:24,108 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 197 [2021-03-25 04:51:24,108 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:51:24,192 INFO L129 PetriNetUnfolder]: 98/261 cut-off events. [2021-03-25 04:51:24,192 INFO L130 PetriNetUnfolder]: For 537/627 co-relation queries the response was YES. [2021-03-25 04:51:24,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 261 events. 98/261 cut-off events. For 537/627 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1441 event pairs, 36 based on Foata normal form. 7/240 useless extension candidates. Maximal degree in co-relation 673. Up to 129 conditions per place. [2021-03-25 04:51:24,195 INFO L132 encePairwiseOnDemand]: 192/197 looper letters, 8 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2021-03-25 04:51:24,195 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 163 flow [2021-03-25 04:51:24,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:51:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:51:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 638 transitions. [2021-03-25 04:51:24,197 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8096446700507615 [2021-03-25 04:51:24,198 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 638 transitions. [2021-03-25 04:51:24,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 638 transitions. [2021-03-25 04:51:24,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:51:24,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 638 transitions. [2021-03-25 04:51:24,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:24,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:24,202 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:24,202 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 115 flow. Second operand 4 states and 638 transitions. [2021-03-25 04:51:24,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 163 flow [2021-03-25 04:51:24,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:51:24,206 INFO L241 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2021-03-25 04:51:24,206 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2021-03-25 04:51:24,206 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -8 predicate places. [2021-03-25 04:51:24,206 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:24,207 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 33 transitions, 137 flow [2021-03-25 04:51:24,207 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 33 transitions, 137 flow [2021-03-25 04:51:24,207 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 33 transitions, 137 flow [2021-03-25 04:51:24,220 INFO L129 PetriNetUnfolder]: 22/95 cut-off events. [2021-03-25 04:51:24,220 INFO L130 PetriNetUnfolder]: For 279/320 co-relation queries the response was YES. [2021-03-25 04:51:24,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 95 events. 22/95 cut-off events. For 279/320 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 458 event pairs, 12 based on Foata normal form. 1/81 useless extension candidates. Maximal degree in co-relation 261. Up to 36 conditions per place. [2021-03-25 04:51:24,221 INFO L142 LiptonReduction]: Number of co-enabled transitions 464 [2021-03-25 04:51:24,224 INFO L154 LiptonReduction]: Checked pairs total: 257 [2021-03-25 04:51:24,224 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:51:24,224 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-25 04:51:24,226 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2021-03-25 04:51:24,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:24,227 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:24,227 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:24,227 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:51:24,227 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:24,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:24,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1505398614, now seen corresponding path program 1 times [2021-03-25 04:51:24,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:24,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595332638] [2021-03-25 04:51:24,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:51:24,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:24,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:51:24,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:24,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:51:24,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:24,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:51:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:51:24,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595332638] [2021-03-25 04:51:24,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:51:24,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:51:24,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116105758] [2021-03-25 04:51:24,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:51:24,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:51:24,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:51:24,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:51:24,352 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 197 [2021-03-25 04:51:24,352 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:24,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:51:24,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 197 [2021-03-25 04:51:24,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:51:24,427 INFO L129 PetriNetUnfolder]: 87/240 cut-off events. [2021-03-25 04:51:24,427 INFO L130 PetriNetUnfolder]: For 626/710 co-relation queries the response was YES. [2021-03-25 04:51:24,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 240 events. 87/240 cut-off events. For 626/710 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1298 event pairs, 43 based on Foata normal form. 5/221 useless extension candidates. Maximal degree in co-relation 692. Up to 136 conditions per place. [2021-03-25 04:51:24,430 INFO L132 encePairwiseOnDemand]: 192/197 looper letters, 10 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2021-03-25 04:51:24,430 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 37 transitions, 177 flow [2021-03-25 04:51:24,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:51:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:51:24,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 622 transitions. [2021-03-25 04:51:24,432 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7893401015228426 [2021-03-25 04:51:24,432 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 622 transitions. [2021-03-25 04:51:24,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 622 transitions. [2021-03-25 04:51:24,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:51:24,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 622 transitions. [2021-03-25 04:51:24,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:24,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:24,435 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:24,436 INFO L185 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 4 states and 622 transitions. [2021-03-25 04:51:24,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 37 transitions, 177 flow [2021-03-25 04:51:24,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 37 transitions, 171 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 04:51:24,437 INFO L241 Difference]: Finished difference. Result has 49 places, 35 transitions, 156 flow [2021-03-25 04:51:24,438 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2021-03-25 04:51:24,438 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2021-03-25 04:51:24,438 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:24,438 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 35 transitions, 156 flow [2021-03-25 04:51:24,438 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 35 transitions, 156 flow [2021-03-25 04:51:24,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 35 transitions, 156 flow [2021-03-25 04:51:24,459 INFO L129 PetriNetUnfolder]: 40/140 cut-off events. [2021-03-25 04:51:24,459 INFO L130 PetriNetUnfolder]: For 576/626 co-relation queries the response was YES. [2021-03-25 04:51:24,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 140 events. 40/140 cut-off events. For 576/626 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 710 event pairs, 17 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 414. Up to 51 conditions per place. [2021-03-25 04:51:24,461 INFO L142 LiptonReduction]: Number of co-enabled transitions 500 [2021-03-25 04:51:24,465 INFO L154 LiptonReduction]: Checked pairs total: 216 [2021-03-25 04:51:24,465 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:51:24,465 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 27 [2021-03-25 04:51:24,468 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 156 flow [2021-03-25 04:51:24,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:24,468 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:24,468 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:24,468 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:51:24,468 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:24,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:24,469 INFO L82 PathProgramCache]: Analyzing trace with hash 172744390, now seen corresponding path program 1 times [2021-03-25 04:51:24,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:24,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243500822] [2021-03-25 04:51:24,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:51:24,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:24,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:51:24,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:24,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:51:24,576 INFO L142 QuantifierPusher]: treesize reduction 8, result has 72.4 percent of original size [2021-03-25 04:51:24,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:51:24,597 INFO L142 QuantifierPusher]: treesize reduction 8, result has 72.4 percent of original size [2021-03-25 04:51:24,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:51:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:51:24,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243500822] [2021-03-25 04:51:24,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:51:24,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:51:24,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563665238] [2021-03-25 04:51:24,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:51:24,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:51:24,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:51:24,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:51:24,618 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 197 [2021-03-25 04:51:24,620 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 156.83333333333334) internal successors, (941), 6 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:24,620 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:51:24,620 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 197 [2021-03-25 04:51:24,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:51:24,722 INFO L129 PetriNetUnfolder]: 75/226 cut-off events. [2021-03-25 04:51:24,722 INFO L130 PetriNetUnfolder]: For 858/927 co-relation queries the response was YES. [2021-03-25 04:51:24,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 226 events. 75/226 cut-off events. For 858/927 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1234 event pairs, 7 based on Foata normal form. 15/221 useless extension candidates. Maximal degree in co-relation 660. Up to 81 conditions per place. [2021-03-25 04:51:24,726 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 9 selfloop transitions, 11 changer transitions 0/42 dead transitions. [2021-03-25 04:51:24,727 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 219 flow [2021-03-25 04:51:24,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:51:24,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:51:24,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 799 transitions. [2021-03-25 04:51:24,729 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8111675126903554 [2021-03-25 04:51:24,729 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 799 transitions. [2021-03-25 04:51:24,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 799 transitions. [2021-03-25 04:51:24,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:51:24,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 799 transitions. [2021-03-25 04:51:24,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.8) internal successors, (799), 5 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-03-25 04:51:24,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:24,733 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:24,734 INFO L185 Difference]: Start difference. First operand has 49 places, 35 transitions, 156 flow. Second operand 5 states and 799 transitions. [2021-03-25 04:51:24,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 219 flow [2021-03-25 04:51:24,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 42 transitions, 210 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:51:24,738 INFO L241 Difference]: Finished difference. Result has 54 places, 40 transitions, 218 flow [2021-03-25 04:51:24,738 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2021-03-25 04:51:24,738 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2021-03-25 04:51:24,738 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:24,739 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 40 transitions, 218 flow [2021-03-25 04:51:24,739 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 40 transitions, 218 flow [2021-03-25 04:51:24,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 40 transitions, 218 flow [2021-03-25 04:51:24,762 INFO L129 PetriNetUnfolder]: 49/164 cut-off events. [2021-03-25 04:51:24,762 INFO L130 PetriNetUnfolder]: For 926/957 co-relation queries the response was YES. [2021-03-25 04:51:24,762 INFO L84 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 164 events. 49/164 cut-off events. For 926/957 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 867 event pairs, 9 based on Foata normal form. 3/145 useless extension candidates. Maximal degree in co-relation 595. Up to 58 conditions per place. [2021-03-25 04:51:24,764 INFO L142 LiptonReduction]: Number of co-enabled transitions 582 [2021-03-25 04:51:24,934 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 04:51:25,315 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 04:51:25,433 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 04:51:25,445 INFO L154 LiptonReduction]: Checked pairs total: 530 [2021-03-25 04:51:25,445 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:51:25,445 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 707 [2021-03-25 04:51:25,445 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 221 flow [2021-03-25 04:51:25,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 156.83333333333334) internal successors, (941), 6 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:25,446 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:25,446 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:25,446 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:51:25,446 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:25,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:25,447 INFO L82 PathProgramCache]: Analyzing trace with hash -61708439, now seen corresponding path program 1 times [2021-03-25 04:51:25,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:25,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861319937] [2021-03-25 04:51:25,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:51:25,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:25,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:51:25,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:25,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:51:25,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:25,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:51:25,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:25,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:51:25,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:25,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:51:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:51:25,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861319937] [2021-03-25 04:51:25,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:51:25,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:51:25,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578965389] [2021-03-25 04:51:25,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:51:25,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:51:25,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:51:25,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:51:25,529 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 198 [2021-03-25 04:51:25,530 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 157.0) internal successors, (942), 6 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:25,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:51:25,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 198 [2021-03-25 04:51:25,530 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:51:25,641 INFO L129 PetriNetUnfolder]: 98/283 cut-off events. [2021-03-25 04:51:25,642 INFO L130 PetriNetUnfolder]: For 1140/1211 co-relation queries the response was YES. [2021-03-25 04:51:25,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 283 events. 98/283 cut-off events. For 1140/1211 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1649 event pairs, 18 based on Foata normal form. 7/261 useless extension candidates. Maximal degree in co-relation 1074. Up to 141 conditions per place. [2021-03-25 04:51:25,645 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 14 selfloop transitions, 13 changer transitions 0/49 dead transitions. [2021-03-25 04:51:25,645 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 341 flow [2021-03-25 04:51:25,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:51:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:51:25,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 797 transitions. [2021-03-25 04:51:25,648 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.805050505050505 [2021-03-25 04:51:25,648 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 797 transitions. [2021-03-25 04:51:25,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 797 transitions. [2021-03-25 04:51:25,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:51:25,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 797 transitions. [2021-03-25 04:51:25,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.4) internal successors, (797), 5 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:25,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:25,653 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:25,653 INFO L185 Difference]: Start difference. First operand has 54 places, 40 transitions, 221 flow. Second operand 5 states and 797 transitions. [2021-03-25 04:51:25,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 341 flow [2021-03-25 04:51:25,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 321 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-03-25 04:51:25,657 INFO L241 Difference]: Finished difference. Result has 59 places, 47 transitions, 312 flow [2021-03-25 04:51:25,657 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2021-03-25 04:51:25,658 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places. [2021-03-25 04:51:25,658 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:25,658 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 47 transitions, 312 flow [2021-03-25 04:51:25,658 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 47 transitions, 312 flow [2021-03-25 04:51:25,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 47 transitions, 312 flow [2021-03-25 04:51:25,684 INFO L129 PetriNetUnfolder]: 67/206 cut-off events. [2021-03-25 04:51:25,684 INFO L130 PetriNetUnfolder]: For 1286/1320 co-relation queries the response was YES. [2021-03-25 04:51:25,685 INFO L84 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 206 events. 67/206 cut-off events. For 1286/1320 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1079 event pairs, 16 based on Foata normal form. 4/186 useless extension candidates. Maximal degree in co-relation 799. Up to 76 conditions per place. [2021-03-25 04:51:25,687 INFO L142 LiptonReduction]: Number of co-enabled transitions 702 [2021-03-25 04:51:25,698 INFO L154 LiptonReduction]: Checked pairs total: 436 [2021-03-25 04:51:25,699 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:51:25,699 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 41 [2021-03-25 04:51:25,699 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 312 flow [2021-03-25 04:51:25,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 157.0) internal successors, (942), 6 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:25,700 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:25,700 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:25,700 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:51:25,700 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:25,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:25,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1873311699, now seen corresponding path program 1 times [2021-03-25 04:51:25,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:25,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92352071] [2021-03-25 04:51:25,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:51:25,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:25,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:51:25,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:25,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:25,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:25,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:51:25,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92352071] [2021-03-25 04:51:25,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:51:25,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:51:25,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790796172] [2021-03-25 04:51:25,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:51:25,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:51:25,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:51:25,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:51:25,751 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 198 [2021-03-25 04:51:25,752 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:25,752 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:51:25,752 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 198 [2021-03-25 04:51:25,752 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:51:25,829 INFO L129 PetriNetUnfolder]: 155/478 cut-off events. [2021-03-25 04:51:25,830 INFO L130 PetriNetUnfolder]: For 4632/4775 co-relation queries the response was YES. [2021-03-25 04:51:25,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1824 conditions, 478 events. 155/478 cut-off events. For 4632/4775 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3413 event pairs, 20 based on Foata normal form. 21/466 useless extension candidates. Maximal degree in co-relation 1799. Up to 173 conditions per place. [2021-03-25 04:51:25,835 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 6 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2021-03-25 04:51:25,835 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 373 flow [2021-03-25 04:51:25,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:51:25,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:51:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 699 transitions. [2021-03-25 04:51:25,838 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8825757575757576 [2021-03-25 04:51:25,838 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 699 transitions. [2021-03-25 04:51:25,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 699 transitions. [2021-03-25 04:51:25,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:51:25,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 699 transitions. [2021-03-25 04:51:25,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:25,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:25,841 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:25,841 INFO L185 Difference]: Start difference. First operand has 59 places, 47 transitions, 312 flow. Second operand 4 states and 699 transitions. [2021-03-25 04:51:25,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 373 flow [2021-03-25 04:51:25,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 50 transitions, 354 flow, removed 9 selfloop flow, removed 1 redundant places. [2021-03-25 04:51:25,847 INFO L241 Difference]: Finished difference. Result has 63 places, 48 transitions, 314 flow [2021-03-25 04:51:25,847 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2021-03-25 04:51:25,848 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2021-03-25 04:51:25,848 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:25,848 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 48 transitions, 314 flow [2021-03-25 04:51:25,848 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 48 transitions, 314 flow [2021-03-25 04:51:25,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 48 transitions, 314 flow [2021-03-25 04:51:25,887 INFO L129 PetriNetUnfolder]: 104/337 cut-off events. [2021-03-25 04:51:25,888 INFO L130 PetriNetUnfolder]: For 1985/2041 co-relation queries the response was YES. [2021-03-25 04:51:25,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 337 events. 104/337 cut-off events. For 1985/2041 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2218 event pairs, 22 based on Foata normal form. 5/307 useless extension candidates. Maximal degree in co-relation 1183. Up to 115 conditions per place. [2021-03-25 04:51:25,894 INFO L142 LiptonReduction]: Number of co-enabled transitions 726 [2021-03-25 04:51:25,919 INFO L154 LiptonReduction]: Checked pairs total: 310 [2021-03-25 04:51:25,919 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:51:25,919 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 71 [2021-03-25 04:51:25,921 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 314 flow [2021-03-25 04:51:25,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:25,921 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:25,922 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:25,922 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:51:25,922 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:25,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:25,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1470034721, now seen corresponding path program 1 times [2021-03-25 04:51:25,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:25,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872013270] [2021-03-25 04:51:25,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:51:25,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:25,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:25,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:25,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:51:25,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:25,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:51:25,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:25,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:51:25,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:51:25,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872013270] [2021-03-25 04:51:25,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:51:25,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:51:25,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257581147] [2021-03-25 04:51:26,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:51:26,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:51:26,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:51:26,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:51:26,002 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 198 [2021-03-25 04:51:26,003 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 314 flow. Second operand has 5 states, 5 states have (on average 162.2) internal successors, (811), 5 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:26,003 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:51:26,003 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 198 [2021-03-25 04:51:26,004 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:51:26,116 INFO L129 PetriNetUnfolder]: 148/471 cut-off events. [2021-03-25 04:51:26,116 INFO L130 PetriNetUnfolder]: For 3048/3162 co-relation queries the response was YES. [2021-03-25 04:51:26,119 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 471 events. 148/471 cut-off events. For 3048/3162 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3377 event pairs, 32 based on Foata normal form. 35/480 useless extension candidates. Maximal degree in co-relation 1854. Up to 203 conditions per place. [2021-03-25 04:51:26,122 INFO L132 encePairwiseOnDemand]: 193/198 looper letters, 15 selfloop transitions, 12 changer transitions 0/50 dead transitions. [2021-03-25 04:51:26,122 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 50 transitions, 373 flow [2021-03-25 04:51:26,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:51:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:51:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 657 transitions. [2021-03-25 04:51:26,125 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8295454545454546 [2021-03-25 04:51:26,125 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 657 transitions. [2021-03-25 04:51:26,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 657 transitions. [2021-03-25 04:51:26,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:51:26,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 657 transitions. [2021-03-25 04:51:26,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.25) internal successors, (657), 4 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:26,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:26,130 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:26,130 INFO L185 Difference]: Start difference. First operand has 63 places, 48 transitions, 314 flow. Second operand 4 states and 657 transitions. [2021-03-25 04:51:26,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 50 transitions, 373 flow [2021-03-25 04:51:26,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 50 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:51:26,135 INFO L241 Difference]: Finished difference. Result has 66 places, 49 transitions, 353 flow [2021-03-25 04:51:26,135 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=353, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2021-03-25 04:51:26,135 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places. [2021-03-25 04:51:26,135 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:26,135 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 49 transitions, 353 flow [2021-03-25 04:51:26,135 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 49 transitions, 353 flow [2021-03-25 04:51:26,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 49 transitions, 353 flow [2021-03-25 04:51:26,185 INFO L129 PetriNetUnfolder]: 97/334 cut-off events. [2021-03-25 04:51:26,185 INFO L130 PetriNetUnfolder]: For 1940/1999 co-relation queries the response was YES. [2021-03-25 04:51:26,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 334 events. 97/334 cut-off events. For 1940/1999 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2236 event pairs, 18 based on Foata normal form. 5/310 useless extension candidates. Maximal degree in co-relation 1315. Up to 116 conditions per place. [2021-03-25 04:51:26,192 INFO L142 LiptonReduction]: Number of co-enabled transitions 752 [2021-03-25 04:51:26,220 INFO L154 LiptonReduction]: Checked pairs total: 352 [2021-03-25 04:51:26,220 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:51:26,220 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 85 [2021-03-25 04:51:26,220 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 353 flow [2021-03-25 04:51:26,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 162.2) internal successors, (811), 5 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:26,221 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:26,221 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:26,221 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:51:26,221 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:26,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:26,222 INFO L82 PathProgramCache]: Analyzing trace with hash 221294189, now seen corresponding path program 2 times [2021-03-25 04:51:26,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:26,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883204284] [2021-03-25 04:51:26,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:51:26,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:26,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:51:26,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:26,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 04:51:26,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:26,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 04:51:26,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:26,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 04:51:26,382 INFO L142 QuantifierPusher]: treesize reduction 26, result has 59.4 percent of original size [2021-03-25 04:51:26,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 04:51:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:51:26,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883204284] [2021-03-25 04:51:26,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:51:26,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:51:26,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251865612] [2021-03-25 04:51:26,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:51:26,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:51:26,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:51:26,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:51:26,410 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 198 [2021-03-25 04:51:26,411 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 353 flow. Second operand has 7 states, 7 states have (on average 147.85714285714286) internal successors, (1035), 7 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:26,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:51:26,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 198 [2021-03-25 04:51:26,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:51:26,601 INFO L129 PetriNetUnfolder]: 137/434 cut-off events. [2021-03-25 04:51:26,601 INFO L130 PetriNetUnfolder]: For 2801/2905 co-relation queries the response was YES. [2021-03-25 04:51:26,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1913 conditions, 434 events. 137/434 cut-off events. For 2801/2905 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3057 event pairs, 5 based on Foata normal form. 31/444 useless extension candidates. Maximal degree in co-relation 1884. Up to 159 conditions per place. [2021-03-25 04:51:26,608 INFO L132 encePairwiseOnDemand]: 192/198 looper letters, 16 selfloop transitions, 14 changer transitions 0/53 dead transitions. [2021-03-25 04:51:26,608 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 53 transitions, 438 flow [2021-03-25 04:51:26,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:51:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:51:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 752 transitions. [2021-03-25 04:51:26,611 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7595959595959596 [2021-03-25 04:51:26,611 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 752 transitions. [2021-03-25 04:51:26,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 752 transitions. [2021-03-25 04:51:26,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:51:26,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 752 transitions. [2021-03-25 04:51:26,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:26,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:26,615 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:26,615 INFO L185 Difference]: Start difference. First operand has 66 places, 49 transitions, 353 flow. Second operand 5 states and 752 transitions. [2021-03-25 04:51:26,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 53 transitions, 438 flow [2021-03-25 04:51:26,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 53 transitions, 419 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-25 04:51:26,624 INFO L241 Difference]: Finished difference. Result has 69 places, 49 transitions, 375 flow [2021-03-25 04:51:26,624 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=375, PETRI_PLACES=69, PETRI_TRANSITIONS=49} [2021-03-25 04:51:26,624 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 15 predicate places. [2021-03-25 04:51:26,624 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:26,624 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 49 transitions, 375 flow [2021-03-25 04:51:26,624 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 49 transitions, 375 flow [2021-03-25 04:51:26,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 49 transitions, 375 flow [2021-03-25 04:51:26,661 INFO L129 PetriNetUnfolder]: 84/296 cut-off events. [2021-03-25 04:51:26,661 INFO L130 PetriNetUnfolder]: For 1633/1687 co-relation queries the response was YES. [2021-03-25 04:51:26,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 296 events. 84/296 cut-off events. For 1633/1687 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1952 event pairs, 14 based on Foata normal form. 4/279 useless extension candidates. Maximal degree in co-relation 1164. Up to 98 conditions per place. [2021-03-25 04:51:26,667 INFO L142 LiptonReduction]: Number of co-enabled transitions 750 [2021-03-25 04:51:26,687 INFO L154 LiptonReduction]: Checked pairs total: 352 [2021-03-25 04:51:26,687 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:51:26,687 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 63 [2021-03-25 04:51:26,689 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 375 flow [2021-03-25 04:51:26,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 147.85714285714286) internal successors, (1035), 7 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:26,689 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:26,689 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:26,689 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:51:26,690 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:26,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:26,690 INFO L82 PathProgramCache]: Analyzing trace with hash -751534667, now seen corresponding path program 1 times [2021-03-25 04:51:26,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:26,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923521344] [2021-03-25 04:51:26,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:51:26,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:26,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:26,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:26,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:51:26,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:26,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:51:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:51:26,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923521344] [2021-03-25 04:51:26,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:51:26,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:51:26,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920868743] [2021-03-25 04:51:26,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:51:26,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:51:26,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:51:26,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:51:26,757 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 198 [2021-03-25 04:51:26,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 375 flow. Second operand has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:26,758 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:51:26,758 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 198 [2021-03-25 04:51:26,758 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:51:27,068 INFO L129 PetriNetUnfolder]: 1349/2430 cut-off events. [2021-03-25 04:51:27,068 INFO L130 PetriNetUnfolder]: For 8342/9205 co-relation queries the response was YES. [2021-03-25 04:51:27,084 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7930 conditions, 2430 events. 1349/2430 cut-off events. For 8342/9205 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 18696 event pairs, 487 based on Foata normal form. 289/2331 useless extension candidates. Maximal degree in co-relation 7900. Up to 1439 conditions per place. [2021-03-25 04:51:27,097 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 12 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2021-03-25 04:51:27,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 62 transitions, 445 flow [2021-03-25 04:51:27,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:51:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:51:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 837 transitions. [2021-03-25 04:51:27,099 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8454545454545455 [2021-03-25 04:51:27,099 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 837 transitions. [2021-03-25 04:51:27,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 837 transitions. [2021-03-25 04:51:27,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:51:27,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 837 transitions. [2021-03-25 04:51:27,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:27,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:27,103 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:27,103 INFO L185 Difference]: Start difference. First operand has 69 places, 49 transitions, 375 flow. Second operand 5 states and 837 transitions. [2021-03-25 04:51:27,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 62 transitions, 445 flow [2021-03-25 04:51:27,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 62 transitions, 418 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-25 04:51:27,120 INFO L241 Difference]: Finished difference. Result has 73 places, 58 transitions, 431 flow [2021-03-25 04:51:27,120 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=431, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2021-03-25 04:51:27,121 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 19 predicate places. [2021-03-25 04:51:27,121 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:27,121 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 58 transitions, 431 flow [2021-03-25 04:51:27,121 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 58 transitions, 431 flow [2021-03-25 04:51:27,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 58 transitions, 431 flow [2021-03-25 04:51:27,369 INFO L129 PetriNetUnfolder]: 1149/2045 cut-off events. [2021-03-25 04:51:27,370 INFO L130 PetriNetUnfolder]: For 7578/8669 co-relation queries the response was YES. [2021-03-25 04:51:27,382 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7777 conditions, 2045 events. 1149/2045 cut-off events. For 7578/8669 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 15494 event pairs, 485 based on Foata normal form. 14/1643 useless extension candidates. Maximal degree in co-relation 7746. Up to 1361 conditions per place. [2021-03-25 04:51:27,407 INFO L142 LiptonReduction]: Number of co-enabled transitions 1048 [2021-03-25 04:51:27,465 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 04:51:27,465 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:51:27,465 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 344 [2021-03-25 04:51:27,465 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 431 flow [2021-03-25 04:51:27,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:27,466 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:27,466 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:27,466 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 04:51:27,466 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:27,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:27,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1369866882, now seen corresponding path program 1 times [2021-03-25 04:51:27,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:27,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598892114] [2021-03-25 04:51:27,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:51:27,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:27,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:27,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:27,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:27,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:27,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:51:27,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:27,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:51:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:51:27,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598892114] [2021-03-25 04:51:27,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:51:27,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:51:27,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853530931] [2021-03-25 04:51:27,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:51:27,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:51:27,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:51:27,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:51:27,525 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 198 [2021-03-25 04:51:27,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 431 flow. Second operand has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:27,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:51:27,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 198 [2021-03-25 04:51:27,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:51:27,800 INFO L129 PetriNetUnfolder]: 970/1907 cut-off events. [2021-03-25 04:51:27,800 INFO L130 PetriNetUnfolder]: For 8250/13337 co-relation queries the response was YES. [2021-03-25 04:51:27,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8320 conditions, 1907 events. 970/1907 cut-off events. For 8250/13337 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 14905 event pairs, 125 based on Foata normal form. 625/2262 useless extension candidates. Maximal degree in co-relation 8287. Up to 1370 conditions per place. [2021-03-25 04:51:27,824 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 11 selfloop transitions, 19 changer transitions 3/71 dead transitions. [2021-03-25 04:51:27,824 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 71 transitions, 569 flow [2021-03-25 04:51:27,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:51:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:51:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1172 transitions. [2021-03-25 04:51:27,827 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8455988455988456 [2021-03-25 04:51:27,827 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1172 transitions. [2021-03-25 04:51:27,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1172 transitions. [2021-03-25 04:51:27,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:51:27,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1172 transitions. [2021-03-25 04:51:27,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 167.42857142857142) internal successors, (1172), 7 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:27,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:27,832 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:27,832 INFO L185 Difference]: Start difference. First operand has 73 places, 58 transitions, 431 flow. Second operand 7 states and 1172 transitions. [2021-03-25 04:51:27,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 71 transitions, 569 flow [2021-03-25 04:51:27,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 71 transitions, 564 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:51:27,845 INFO L241 Difference]: Finished difference. Result has 81 places, 64 transitions, 532 flow [2021-03-25 04:51:27,846 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=532, PETRI_PLACES=81, PETRI_TRANSITIONS=64} [2021-03-25 04:51:27,846 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 27 predicate places. [2021-03-25 04:51:27,846 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:27,846 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 64 transitions, 532 flow [2021-03-25 04:51:27,846 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 64 transitions, 532 flow [2021-03-25 04:51:27,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 64 transitions, 532 flow [2021-03-25 04:51:28,005 INFO L129 PetriNetUnfolder]: 823/1614 cut-off events. [2021-03-25 04:51:28,005 INFO L130 PetriNetUnfolder]: For 8426/11552 co-relation queries the response was YES. [2021-03-25 04:51:28,017 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8181 conditions, 1614 events. 823/1614 cut-off events. For 8426/11552 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 12496 event pairs, 126 based on Foata normal form. 33/1353 useless extension candidates. Maximal degree in co-relation 8146. Up to 1173 conditions per place. [2021-03-25 04:51:28,040 INFO L142 LiptonReduction]: Number of co-enabled transitions 1278 [2021-03-25 04:51:28,053 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 04:51:28,054 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:51:28,054 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 208 [2021-03-25 04:51:28,054 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 64 transitions, 532 flow [2021-03-25 04:51:28,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:28,055 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:28,055 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:28,055 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 04:51:28,055 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:28,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:28,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1243465562, now seen corresponding path program 1 times [2021-03-25 04:51:28,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:28,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413397118] [2021-03-25 04:51:28,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:51:28,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:28,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:51:28,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:28,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:51:28,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413397118] [2021-03-25 04:51:28,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:51:28,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:51:28,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346279752] [2021-03-25 04:51:28,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:51:28,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:51:28,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:51:28,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:51:28,103 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 198 [2021-03-25 04:51:28,103 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 64 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:28,103 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:51:28,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 198 [2021-03-25 04:51:28,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:51:28,432 INFO L129 PetriNetUnfolder]: 1416/2705 cut-off events. [2021-03-25 04:51:28,432 INFO L130 PetriNetUnfolder]: For 15255/21211 co-relation queries the response was YES. [2021-03-25 04:51:28,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13640 conditions, 2705 events. 1416/2705 cut-off events. For 15255/21211 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 22320 event pairs, 209 based on Foata normal form. 77/2329 useless extension candidates. Maximal degree in co-relation 13603. Up to 2042 conditions per place. [2021-03-25 04:51:28,466 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 3 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2021-03-25 04:51:28,467 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 64 transitions, 544 flow [2021-03-25 04:51:28,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:51:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:51:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2021-03-25 04:51:28,469 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8838383838383839 [2021-03-25 04:51:28,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2021-03-25 04:51:28,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2021-03-25 04:51:28,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:51:28,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2021-03-25 04:51:28,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:28,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:28,471 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:28,472 INFO L185 Difference]: Start difference. First operand has 81 places, 64 transitions, 532 flow. Second operand 3 states and 525 transitions. [2021-03-25 04:51:28,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 64 transitions, 544 flow [2021-03-25 04:51:28,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 64 transitions, 486 flow, removed 18 selfloop flow, removed 5 redundant places. [2021-03-25 04:51:28,519 INFO L241 Difference]: Finished difference. Result has 79 places, 64 transitions, 485 flow [2021-03-25 04:51:28,519 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=485, PETRI_PLACES=79, PETRI_TRANSITIONS=64} [2021-03-25 04:51:28,519 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 25 predicate places. [2021-03-25 04:51:28,519 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:28,519 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 64 transitions, 485 flow [2021-03-25 04:51:28,519 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 64 transitions, 485 flow [2021-03-25 04:51:28,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 64 transitions, 485 flow [2021-03-25 04:51:28,777 INFO L129 PetriNetUnfolder]: 1412/2696 cut-off events. [2021-03-25 04:51:28,777 INFO L130 PetriNetUnfolder]: For 12895/14642 co-relation queries the response was YES. [2021-03-25 04:51:28,795 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12063 conditions, 2696 events. 1412/2696 cut-off events. For 12895/14642 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 22510 event pairs, 215 based on Foata normal form. 45/2291 useless extension candidates. Maximal degree in co-relation 12029. Up to 1791 conditions per place. [2021-03-25 04:51:28,834 INFO L142 LiptonReduction]: Number of co-enabled transitions 1278 [2021-03-25 04:51:28,876 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 04:51:28,877 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:51:28,877 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 358 [2021-03-25 04:51:28,877 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 64 transitions, 485 flow [2021-03-25 04:51:28,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:28,877 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:28,878 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:28,878 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 04:51:28,878 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:28,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:28,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2063755336, now seen corresponding path program 1 times [2021-03-25 04:51:28,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:28,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794356042] [2021-03-25 04:51:28,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:51:28,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:28,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:28,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:28,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:28,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:28,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:28,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:28,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:51:28,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:28,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:51:28,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-03-25 04:51:28,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794356042] [2021-03-25 04:51:28,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:51:28,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:51:28,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011030522] [2021-03-25 04:51:28,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:51:28,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:51:28,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:51:28,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:51:28,935 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 198 [2021-03-25 04:51:28,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 64 transitions, 485 flow. Second operand has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:28,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:51:28,936 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 198 [2021-03-25 04:51:28,936 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:51:29,306 INFO L129 PetriNetUnfolder]: 1015/2098 cut-off events. [2021-03-25 04:51:29,307 INFO L130 PetriNetUnfolder]: For 13024/22389 co-relation queries the response was YES. [2021-03-25 04:51:29,323 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10573 conditions, 2098 events. 1015/2098 cut-off events. For 13024/22389 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 17508 event pairs, 18 based on Foata normal form. 1015/2731 useless extension candidates. Maximal degree in co-relation 10537. Up to 1426 conditions per place. [2021-03-25 04:51:29,338 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 7 selfloop transitions, 28 changer transitions 4/76 dead transitions. [2021-03-25 04:51:29,338 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 76 transitions, 680 flow [2021-03-25 04:51:29,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 04:51:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 04:51:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1507 transitions. [2021-03-25 04:51:29,342 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.845679012345679 [2021-03-25 04:51:29,342 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1507 transitions. [2021-03-25 04:51:29,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1507 transitions. [2021-03-25 04:51:29,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:51:29,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1507 transitions. [2021-03-25 04:51:29,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 167.44444444444446) internal successors, (1507), 9 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:29,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:29,361 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:29,361 INFO L185 Difference]: Start difference. First operand has 79 places, 64 transitions, 485 flow. Second operand 9 states and 1507 transitions. [2021-03-25 04:51:29,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 76 transitions, 680 flow [2021-03-25 04:51:29,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 76 transitions, 673 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 04:51:29,388 INFO L241 Difference]: Finished difference. Result has 89 places, 72 transitions, 651 flow [2021-03-25 04:51:29,388 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=651, PETRI_PLACES=89, PETRI_TRANSITIONS=72} [2021-03-25 04:51:29,388 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 35 predicate places. [2021-03-25 04:51:29,388 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:29,388 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 72 transitions, 651 flow [2021-03-25 04:51:29,389 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 72 transitions, 651 flow [2021-03-25 04:51:29,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 72 transitions, 651 flow [2021-03-25 04:51:29,556 INFO L129 PetriNetUnfolder]: 943/2001 cut-off events. [2021-03-25 04:51:29,556 INFO L130 PetriNetUnfolder]: For 13922/16397 co-relation queries the response was YES. [2021-03-25 04:51:29,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10904 conditions, 2001 events. 943/2001 cut-off events. For 13922/16397 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 17668 event pairs, 16 based on Foata normal form. 25/1650 useless extension candidates. Maximal degree in co-relation 10866. Up to 1329 conditions per place. [2021-03-25 04:51:29,600 INFO L142 LiptonReduction]: Number of co-enabled transitions 1342 [2021-03-25 04:51:29,613 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 04:51:29,613 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:51:29,613 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 225 [2021-03-25 04:51:29,614 INFO L480 AbstractCegarLoop]: Abstraction has has 89 places, 72 transitions, 651 flow [2021-03-25 04:51:29,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:29,614 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:29,614 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:29,614 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 04:51:29,614 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:29,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:29,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1683207149, now seen corresponding path program 1 times [2021-03-25 04:51:29,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:29,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221275948] [2021-03-25 04:51:29,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:51:29,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:29,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:29,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:29,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:29,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:29,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:29,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:29,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:51:29,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:29,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:51:29,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:51:29,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:51:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:51:29,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221275948] [2021-03-25 04:51:29,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:51:29,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:51:29,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107412731] [2021-03-25 04:51:29,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:51:29,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:51:29,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:51:29,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:51:29,701 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 198 [2021-03-25 04:51:29,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 72 transitions, 651 flow. Second operand has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:29,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:51:29,702 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 198 [2021-03-25 04:51:29,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:51:30,012 INFO L129 PetriNetUnfolder]: 877/1852 cut-off events. [2021-03-25 04:51:30,013 INFO L130 PetriNetUnfolder]: For 16110/27238 co-relation queries the response was YES. [2021-03-25 04:51:30,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11514 conditions, 1852 events. 877/1852 cut-off events. For 16110/27238 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 15647 event pairs, 0 based on Foata normal form. 908/2379 useless extension candidates. Maximal degree in co-relation 11474. Up to 1227 conditions per place. [2021-03-25 04:51:30,034 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 2 selfloop transitions, 33 changer transitions 15/75 dead transitions. [2021-03-25 04:51:30,034 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 75 transitions, 758 flow [2021-03-25 04:51:30,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 04:51:30,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 04:51:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1834 transitions. [2021-03-25 04:51:30,038 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8420569329660239 [2021-03-25 04:51:30,039 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1834 transitions. [2021-03-25 04:51:30,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1834 transitions. [2021-03-25 04:51:30,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:51:30,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1834 transitions. [2021-03-25 04:51:30,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 166.72727272727272) internal successors, (1834), 11 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:30,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:30,046 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:30,046 INFO L185 Difference]: Start difference. First operand has 89 places, 72 transitions, 651 flow. Second operand 11 states and 1834 transitions. [2021-03-25 04:51:30,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 75 transitions, 758 flow [2021-03-25 04:51:30,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 75 transitions, 626 flow, removed 44 selfloop flow, removed 7 redundant places. [2021-03-25 04:51:30,165 INFO L241 Difference]: Finished difference. Result has 95 places, 60 transitions, 501 flow [2021-03-25 04:51:30,165 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=501, PETRI_PLACES=95, PETRI_TRANSITIONS=60} [2021-03-25 04:51:30,165 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 41 predicate places. [2021-03-25 04:51:30,165 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:51:30,165 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 60 transitions, 501 flow [2021-03-25 04:51:30,165 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 60 transitions, 501 flow [2021-03-25 04:51:30,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 60 transitions, 501 flow [2021-03-25 04:51:30,220 INFO L129 PetriNetUnfolder]: 197/453 cut-off events. [2021-03-25 04:51:30,220 INFO L130 PetriNetUnfolder]: For 1702/1944 co-relation queries the response was YES. [2021-03-25 04:51:30,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2007 conditions, 453 events. 197/453 cut-off events. For 1702/1944 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 2914 event pairs, 0 based on Foata normal form. 7/394 useless extension candidates. Maximal degree in co-relation 1975. Up to 140 conditions per place. [2021-03-25 04:51:30,226 INFO L142 LiptonReduction]: Number of co-enabled transitions 698 [2021-03-25 04:51:30,786 WARN L205 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-25 04:51:31,009 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-25 04:51:32,255 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 338 DAG size of output: 266 [2021-03-25 04:51:32,793 WARN L205 SmtUtils]: Spent 527.00 ms on a formula simplification that was a NOOP. DAG size: 246 [2021-03-25 04:51:33,101 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 04:51:33,323 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 04:51:33,834 WARN L205 SmtUtils]: Spent 507.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-25 04:51:34,332 WARN L205 SmtUtils]: Spent 492.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-25 04:51:34,341 INFO L154 LiptonReduction]: Checked pairs total: 150 [2021-03-25 04:51:34,341 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-25 04:51:34,342 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4177 [2021-03-25 04:51:34,342 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 52 transitions, 459 flow [2021-03-25 04:51:34,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:51:34,342 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:51:34,342 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:51:34,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 04:51:34,343 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:51:34,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:51:34,343 INFO L82 PathProgramCache]: Analyzing trace with hash 250673031, now seen corresponding path program 1 times [2021-03-25 04:51:34,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:51:34,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718485402] [2021-03-25 04:51:34,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:51:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:51:34,371 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:51:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:51:34,403 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:51:34,436 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:51:34,436 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:51:34,436 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 04:51:34,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:51:34 BasicIcfg [2021-03-25 04:51:34,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:51:34,539 INFO L168 Benchmark]: Toolchain (without parser) took 26319.44 ms. Allocated memory was 337.6 MB in the beginning and 767.6 MB in the end (delta: 429.9 MB). Free memory was 300.6 MB in the beginning and 393.3 MB in the end (delta: -92.7 MB). Peak memory consumption was 340.4 MB. Max. memory is 16.0 GB. [2021-03-25 04:51:34,540 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 337.6 MB. Free memory was 319.2 MB in the beginning and 319.1 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:51:34,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.05 ms. Allocated memory is still 337.6 MB. Free memory was 300.4 MB in the beginning and 296.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. [2021-03-25 04:51:34,540 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.63 ms. Allocated memory is still 337.6 MB. Free memory was 296.4 MB in the beginning and 293.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:51:34,540 INFO L168 Benchmark]: Boogie Preprocessor took 27.67 ms. Allocated memory is still 337.6 MB. Free memory was 293.2 MB in the beginning and 290.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:51:34,540 INFO L168 Benchmark]: RCFGBuilder took 2184.93 ms. Allocated memory is still 337.6 MB. Free memory was 290.1 MB in the beginning and 269.8 MB in the end (delta: 20.2 MB). Peak memory consumption was 163.9 MB. Max. memory is 16.0 GB. [2021-03-25 04:51:34,541 INFO L168 Benchmark]: TraceAbstraction took 23600.81 ms. Allocated memory was 337.6 MB in the beginning and 767.6 MB in the end (delta: 429.9 MB). Free memory was 268.8 MB in the beginning and 393.3 MB in the end (delta: -124.5 MB). Peak memory consumption was 305.4 MB. Max. memory is 16.0 GB. [2021-03-25 04:51:34,542 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.19 ms. Allocated memory is still 337.6 MB. Free memory was 319.2 MB in the beginning and 319.1 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 434.05 ms. Allocated memory is still 337.6 MB. Free memory was 300.4 MB in the beginning and 296.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 59.63 ms. Allocated memory is still 337.6 MB. Free memory was 296.4 MB in the beginning and 293.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 27.67 ms. Allocated memory is still 337.6 MB. Free memory was 293.2 MB in the beginning and 290.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2184.93 ms. Allocated memory is still 337.6 MB. Free memory was 290.1 MB in the beginning and 269.8 MB in the end (delta: 20.2 MB). Peak memory consumption was 163.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 23600.81 ms. Allocated memory was 337.6 MB in the beginning and 767.6 MB in the end (delta: 429.9 MB). Free memory was 268.8 MB in the beginning and 393.3 MB in the end (delta: -124.5 MB). Peak memory consumption was 305.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7785.0ms, 119 PlacesBefore, 54 PlacesAfterwards, 108 TransitionsBefore, 42 TransitionsAfterwards, 2406 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4010 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2149, positive: 2053, positive conditional: 0, positive unconditional: 2053, negative: 96, negative conditional: 0, negative unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1205, positive: 1181, positive conditional: 0, positive unconditional: 1181, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1205, positive: 1181, positive conditional: 0, positive unconditional: 1181, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2149, positive: 872, positive conditional: 0, positive unconditional: 872, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 1205, unknown conditional: 0, unknown unconditional: 1205] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2936.4ms, 50 PlacesBefore, 38 PlacesAfterwards, 35 TransitionsBefore, 27 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 3 FixpointIterations, 6 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 1154 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 392, positive: 323, positive conditional: 0, positive unconditional: 323, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 39, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 392, positive: 296, positive conditional: 0, positive unconditional: 296, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 39, unknown conditional: 0, unknown unconditional: 39] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 930.4ms, 39 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1002 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 292, positive: 232, positive conditional: 0, positive unconditional: 232, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 292, positive: 232, positive conditional: 0, positive unconditional: 232, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.0ms, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 282 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 78, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.7ms, 41 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 316 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 81, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 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] , Cache Queries: [ total: 81, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.9ms, 43 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 260 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 60, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.6ms, 46 PlacesBefore, 46 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 257 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 66, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.7ms, 49 PlacesBefore, 49 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 216 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 43, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 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] , Cache Queries: [ total: 43, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 706.0ms, 54 PlacesBefore, 54 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 582 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 530 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 115, positive: 91, positive conditional: 0, positive unconditional: 91, 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: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 115, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 125, Positive conditional cache size: 0, Positive unconditional cache size: 125, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.7ms, 59 PlacesBefore, 59 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 702 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 436 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 107, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 107, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 130, Positive conditional cache size: 0, Positive unconditional cache size: 130, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.3ms, 63 PlacesBefore, 63 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 310 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 53, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 53, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 130, Positive conditional cache size: 0, Positive unconditional cache size: 130, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 84.5ms, 66 PlacesBefore, 66 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 752 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 352 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 69, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 69, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 62.9ms, 69 PlacesBefore, 69 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 750 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 352 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 73, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 73, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 343.7ms, 73 PlacesBefore, 73 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 1048 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 207.5ms, 81 PlacesBefore, 81 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 1278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 357.3ms, 79 PlacesBefore, 79 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 1278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 224.6ms, 89 PlacesBefore, 89 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 1342 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4176.0ms, 95 PlacesBefore, 86 PlacesAfterwards, 60 TransitionsBefore, 52 TransitionsAfterwards, 698 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 150 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 150, positive: 150, positive conditional: 0, positive unconditional: 150, 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: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 150, positive: 140, positive conditional: 0, positive unconditional: 140, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1541; [L835] FCALL, FORK 0 pthread_create(&t1541, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1542; [L837] FCALL, FORK 0 pthread_create(&t1542, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1543; [L839] FCALL, FORK 0 pthread_create(&t1543, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1544; [L841] FCALL, FORK 0 pthread_create(&t1544, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 23406.7ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3261.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7852.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 62 SDtfs, 38 SDslu, 25 SDs, 0 SdLazy, 349 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 414.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 465.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=651occurred in iteration=16, InterpolantAutomatonStates: 81, 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: 87.1ms SsaConstructionTime, 472.8ms SatisfiabilityAnalysisTime, 1194.8ms InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 265 ConstructedInterpolants, 0 QuantifiedInterpolants, 1507 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...