/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:11:28,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:11:28,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:11:28,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:11:28,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:11:28,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:11:28,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:11:28,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:11:28,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:11:28,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:11:28,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:11:28,124 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:11:28,124 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:11:28,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:11:28,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:11:28,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:11:28,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:11:28,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:11:28,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:11:28,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:11:28,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:11:28,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:11:28,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:11:28,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:11:28,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:11:28,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:11:28,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:11:28,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:11:28,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:11:28,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:11:28,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:11:28,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:11:28,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:11:28,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:11:28,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:11:28,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:11:28,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:11:28,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:11:28,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:11:28,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:11:28,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:11:28,153 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-SemanticLbe.epf [2021-03-11 20:11:28,181 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:11:28,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:11:28,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:11:28,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:11:28,184 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:11:28,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:11:28,185 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:11:28,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:11:28,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:11:28,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:11:28,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:11:28,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:11:28,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:11:28,186 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:11:28,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:11:28,187 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:11:28,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:11:28,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:11:28,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:11:28,188 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:11:28,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:11:28,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:11:28,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:11:28,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:11:28,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:11:28,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:11:28,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:11:28,192 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:11:28,192 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-11 20:11:28,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:11:28,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:11:28,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:11:28,427 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:11:28,427 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:11:28,428 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2021-03-11 20:11:28,480 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f002f6a61/99287422ea0f4cec80338226f3aac2c9/FLAGf3b016c97 [2021-03-11 20:11:28,978 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:11:28,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2021-03-11 20:11:28,995 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f002f6a61/99287422ea0f4cec80338226f3aac2c9/FLAGf3b016c97 [2021-03-11 20:11:29,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f002f6a61/99287422ea0f4cec80338226f3aac2c9 [2021-03-11 20:11:29,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:11:29,284 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:11:29,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:11:29,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:11:29,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:11:29,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:11:29" (1/1) ... [2021-03-11 20:11:29,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39f4e155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:29, skipping insertion in model container [2021-03-11 20:11:29,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:11:29" (1/1) ... [2021-03-11 20:11:29,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:11:29,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:11:29,478 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i[949,962] [2021-03-11 20:11:29,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:11:29,606 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:11:29,618 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i[949,962] [2021-03-11 20:11:29,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:11:29,697 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:11:29,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:29 WrapperNode [2021-03-11 20:11:29,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:11:29,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:11:29,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:11:29,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:11:29,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:29" (1/1) ... [2021-03-11 20:11:29,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:29" (1/1) ... [2021-03-11 20:11:29,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:11:29,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:11:29,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:11:29,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:11:29,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:29" (1/1) ... [2021-03-11 20:11:29,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:29" (1/1) ... [2021-03-11 20:11:29,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:29" (1/1) ... [2021-03-11 20:11:29,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:29" (1/1) ... [2021-03-11 20:11:29,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:29" (1/1) ... [2021-03-11 20:11:29,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:29" (1/1) ... [2021-03-11 20:11:29,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:29" (1/1) ... [2021-03-11 20:11:29,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:11:29,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:11:29,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:11:29,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:11:29,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:29" (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-11 20:11:29,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:11:29,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:11:29,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:11:29,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:11:29,856 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:11:29,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:11:29,856 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:11:29,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:11:29,857 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:11:29,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:11:29,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:11:29,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:11:29,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:11:29,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:11:29,858 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:11:31,071 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:11:31,071 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:11:31,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:11:31 BoogieIcfgContainer [2021-03-11 20:11:31,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:11:31,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:11:31,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:11:31,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:11:31,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:11:29" (1/3) ... [2021-03-11 20:11:31,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3780ce3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:11:31, skipping insertion in model container [2021-03-11 20:11:31,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:11:29" (2/3) ... [2021-03-11 20:11:31,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3780ce3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:11:31, skipping insertion in model container [2021-03-11 20:11:31,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:11:31" (3/3) ... [2021-03-11 20:11:31,077 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_tso.oepc.i [2021-03-11 20:11:31,081 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:11:31,084 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:11:31,084 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:11:31,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,104 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,104 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,105 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,105 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,106 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,106 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,106 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,106 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,109 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,109 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,109 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,110 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,110 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,110 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,110 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,110 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,114 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,114 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,115 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,116 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,117 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,117 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,118 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:11:31,119 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:11:31,130 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 20:11:31,144 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:11:31,144 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:11:31,144 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:11:31,144 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:11:31,144 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:11:31,144 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:11:31,144 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:11:31,144 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:11:31,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2021-03-11 20:11:31,174 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-11 20:11:31,174 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:11:31,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-11 20:11:31,177 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 100 transitions, 215 flow [2021-03-11 20:11:31,179 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 203 flow [2021-03-11 20:11:31,182 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:11:31,187 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-11 20:11:31,189 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-11 20:11:31,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 203 flow [2021-03-11 20:11:31,202 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-11 20:11:31,202 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:11:31,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-11 20:11:31,204 INFO L116 LiptonReduction]: Number of co-enabled transitions 1738 [2021-03-11 20:11:32,291 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-03-11 20:11:32,635 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-03-11 20:11:32,757 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 20:11:34,434 WARN L205 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-11 20:11:34,938 WARN L205 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-03-11 20:11:36,121 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 312 DAG size of output: 267 [2021-03-11 20:11:36,673 WARN L205 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-11 20:11:37,480 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-11 20:11:37,787 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-11 20:11:38,341 WARN L205 SmtUtils]: Spent 551.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-11 20:11:38,899 WARN L205 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-11 20:11:39,500 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-11 20:11:39,776 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-11 20:11:40,600 WARN L205 SmtUtils]: Spent 821.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2021-03-11 20:11:41,419 WARN L205 SmtUtils]: Spent 817.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2021-03-11 20:11:42,108 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-11 20:11:42,241 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-11 20:11:42,519 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-11 20:11:42,648 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-11 20:11:42,651 INFO L131 LiptonReduction]: Checked pairs total: 4495 [2021-03-11 20:11:42,651 INFO L133 LiptonReduction]: Total number of compositions: 85 [2021-03-11 20:11:42,652 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11472 [2021-03-11 20:11:42,658 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-11 20:11:42,658 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:11:42,658 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:42,659 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:42,659 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:42,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:42,662 INFO L82 PathProgramCache]: Analyzing trace with hash 639844005, now seen corresponding path program 1 times [2021-03-11 20:11:42,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:42,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613006238] [2021-03-11 20:11:42,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:42,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:42,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:42,857 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-11 20:11:42,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613006238] [2021-03-11 20:11:42,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:42,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:11:42,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352725188] [2021-03-11 20:11:42,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:11:42,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:42,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:11:42,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:11:42,873 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 185 [2021-03-11 20:11:42,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 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-11 20:11:42,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:42,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 185 [2021-03-11 20:11:42,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:42,924 INFO L129 PetriNetUnfolder]: 23/84 cut-off events. [2021-03-11 20:11:42,924 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:11:42,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 84 events. 23/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 320 event pairs, 3 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 132. Up to 37 conditions per place. [2021-03-11 20:11:42,925 INFO L132 encePairwiseOnDemand]: 182/185 looper letters, 7 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2021-03-11 20:11:42,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 83 flow [2021-03-11 20:11:42,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:11:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:11:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2021-03-11 20:11:42,939 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8540540540540541 [2021-03-11 20:11:42,939 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 474 transitions. [2021-03-11 20:11:42,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 474 transitions. [2021-03-11 20:11:42,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:42,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 474 transitions. [2021-03-11 20:11:42,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 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-11 20:11:42,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:42,953 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:42,954 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 474 transitions. [2021-03-11 20:11:42,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 83 flow [2021-03-11 20:11:42,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 80 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-11 20:11:42,957 INFO L241 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2021-03-11 20:11:42,958 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2021-03-11 20:11:42,959 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2021-03-11 20:11:42,959 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2021-03-11 20:11:42,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 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-11 20:11:42,959 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:42,959 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:42,960 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:11:42,960 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:42,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:42,961 INFO L82 PathProgramCache]: Analyzing trace with hash 709824241, now seen corresponding path program 1 times [2021-03-11 20:11:42,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:42,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125467349] [2021-03-11 20:11:42,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:43,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:11:43,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:11:43,100 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-11 20:11:43,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125467349] [2021-03-11 20:11:43,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:43,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:11:43,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114041760] [2021-03-11 20:11:43,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:11:43,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:43,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:11:43,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:11:43,104 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 185 [2021-03-11 20:11:43,104 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 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-11 20:11:43,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:43,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 185 [2021-03-11 20:11:43,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:43,150 INFO L129 PetriNetUnfolder]: 24/78 cut-off events. [2021-03-11 20:11:43,150 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-11 20:11:43,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 78 events. 24/78 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 253 event pairs, 16 based on Foata normal form. 2/77 useless extension candidates. Maximal degree in co-relation 136. Up to 45 conditions per place. [2021-03-11 20:11:43,151 INFO L132 encePairwiseOnDemand]: 180/185 looper letters, 8 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2021-03-11 20:11:43,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 92 flow [2021-03-11 20:11:43,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:11:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:11:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2021-03-11 20:11:43,155 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7824324324324324 [2021-03-11 20:11:43,156 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2021-03-11 20:11:43,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2021-03-11 20:11:43,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:43,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2021-03-11 20:11:43,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 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-11 20:11:43,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:43,162 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:43,162 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 4 states and 579 transitions. [2021-03-11 20:11:43,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 92 flow [2021-03-11 20:11:43,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 27 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:11:43,163 INFO L241 Difference]: Finished difference. Result has 33 places, 25 transitions, 82 flow [2021-03-11 20:11:43,163 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2021-03-11 20:11:43,163 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2021-03-11 20:11:43,164 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 82 flow [2021-03-11 20:11:43,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 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-11 20:11:43,164 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:43,164 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:43,164 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:11:43,165 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:43,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:43,166 INFO L82 PathProgramCache]: Analyzing trace with hash -608509843, now seen corresponding path program 1 times [2021-03-11 20:11:43,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:43,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718410319] [2021-03-11 20:11:43,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:43,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:43,264 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-11 20:11:43,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718410319] [2021-03-11 20:11:43,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:43,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:11:43,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533734187] [2021-03-11 20:11:43,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:11:43,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:43,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:11:43,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:11:43,277 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 185 [2021-03-11 20:11:43,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 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-11 20:11:43,278 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:43,278 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 185 [2021-03-11 20:11:43,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:43,290 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-11 20:11:43,290 INFO L130 PetriNetUnfolder]: For 17/18 co-relation queries the response was YES. [2021-03-11 20:11:43,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 31 events. 3/31 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 1 based on Foata normal form. 2/33 useless extension candidates. Maximal degree in co-relation 56. Up to 8 conditions per place. [2021-03-11 20:11:43,291 INFO L132 encePairwiseOnDemand]: 182/185 looper letters, 1 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2021-03-11 20:11:43,291 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 25 transitions, 88 flow [2021-03-11 20:11:43,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:11:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:11:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2021-03-11 20:11:43,295 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8882882882882883 [2021-03-11 20:11:43,295 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 493 transitions. [2021-03-11 20:11:43,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions. [2021-03-11 20:11:43,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:43,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions. [2021-03-11 20:11:43,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 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-11 20:11:43,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:43,298 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:43,298 INFO L185 Difference]: Start difference. First operand has 33 places, 25 transitions, 82 flow. Second operand 3 states and 493 transitions. [2021-03-11 20:11:43,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 25 transitions, 88 flow [2021-03-11 20:11:43,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 25 transitions, 88 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-11 20:11:43,299 INFO L241 Difference]: Finished difference. Result has 36 places, 25 transitions, 90 flow [2021-03-11 20:11:43,299 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2021-03-11 20:11:43,299 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2021-03-11 20:11:43,299 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 90 flow [2021-03-11 20:11:43,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 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-11 20:11:43,299 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:43,299 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:43,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:11:43,300 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:43,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:43,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1021565244, now seen corresponding path program 1 times [2021-03-11 20:11:43,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:43,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167059009] [2021-03-11 20:11:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:43,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:11:43,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:11:43,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:11:43,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:11:43,387 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-11 20:11:43,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167059009] [2021-03-11 20:11:43,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:43,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:11:43,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382484766] [2021-03-11 20:11:43,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:11:43,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:43,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:11:43,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:11:43,389 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 185 [2021-03-11 20:11:43,389 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 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-11 20:11:43,389 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:43,389 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 185 [2021-03-11 20:11:43,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:43,432 INFO L129 PetriNetUnfolder]: 25/81 cut-off events. [2021-03-11 20:11:43,432 INFO L130 PetriNetUnfolder]: For 46/50 co-relation queries the response was YES. [2021-03-11 20:11:43,432 INFO L84 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 81 events. 25/81 cut-off events. For 46/50 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 280 event pairs, 2 based on Foata normal form. 3/83 useless extension candidates. Maximal degree in co-relation 192. Up to 41 conditions per place. [2021-03-11 20:11:43,433 INFO L132 encePairwiseOnDemand]: 178/185 looper letters, 9 selfloop transitions, 10 changer transitions 0/33 dead transitions. [2021-03-11 20:11:43,433 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 148 flow [2021-03-11 20:11:43,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:11:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:11:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 737 transitions. [2021-03-11 20:11:43,435 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7967567567567567 [2021-03-11 20:11:43,435 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 737 transitions. [2021-03-11 20:11:43,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 737 transitions. [2021-03-11 20:11:43,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:43,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 737 transitions. [2021-03-11 20:11:43,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.4) internal successors, (737), 5 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:43,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:43,438 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:43,438 INFO L185 Difference]: Start difference. First operand has 36 places, 25 transitions, 90 flow. Second operand 5 states and 737 transitions. [2021-03-11 20:11:43,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 148 flow [2021-03-11 20:11:43,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 142 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 20:11:43,439 INFO L241 Difference]: Finished difference. Result has 40 places, 31 transitions, 140 flow [2021-03-11 20:11:43,439 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2021-03-11 20:11:43,440 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2021-03-11 20:11:43,440 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 140 flow [2021-03-11 20:11:43,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 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-11 20:11:43,440 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:43,440 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:43,440 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:11:43,440 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:43,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:43,441 INFO L82 PathProgramCache]: Analyzing trace with hash -689084394, now seen corresponding path program 2 times [2021-03-11 20:11:43,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:43,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491637984] [2021-03-11 20:11:43,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:43,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:43,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:11:43,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:11:43,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:11:43,502 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-11 20:11:43,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491637984] [2021-03-11 20:11:43,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:43,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:11:43,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736000290] [2021-03-11 20:11:43,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:11:43,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:43,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:11:43,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:11:43,504 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 185 [2021-03-11 20:11:43,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 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-11 20:11:43,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:43,505 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 185 [2021-03-11 20:11:43,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:43,566 INFO L129 PetriNetUnfolder]: 30/93 cut-off events. [2021-03-11 20:11:43,567 INFO L130 PetriNetUnfolder]: For 128/144 co-relation queries the response was YES. [2021-03-11 20:11:43,567 INFO L84 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 93 events. 30/93 cut-off events. For 128/144 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 351 event pairs, 7 based on Foata normal form. 11/103 useless extension candidates. Maximal degree in co-relation 294. Up to 51 conditions per place. [2021-03-11 20:11:43,568 INFO L132 encePairwiseOnDemand]: 178/185 looper letters, 8 selfloop transitions, 15 changer transitions 0/37 dead transitions. [2021-03-11 20:11:43,568 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 224 flow [2021-03-11 20:11:43,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:11:43,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:11:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 721 transitions. [2021-03-11 20:11:43,569 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7794594594594595 [2021-03-11 20:11:43,569 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 721 transitions. [2021-03-11 20:11:43,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 721 transitions. [2021-03-11 20:11:43,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:43,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 721 transitions. [2021-03-11 20:11:43,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.2) internal successors, (721), 5 states have internal predecessors, (721), 0 states have call successors, (0), 0 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-11 20:11:43,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:43,572 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:43,573 INFO L185 Difference]: Start difference. First operand has 40 places, 31 transitions, 140 flow. Second operand 5 states and 721 transitions. [2021-03-11 20:11:43,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 224 flow [2021-03-11 20:11:43,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 214 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-11 20:11:43,574 INFO L241 Difference]: Finished difference. Result has 45 places, 37 transitions, 223 flow [2021-03-11 20:11:43,574 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2021-03-11 20:11:43,574 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2021-03-11 20:11:43,575 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 223 flow [2021-03-11 20:11:43,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 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-11 20:11:43,575 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:43,575 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:43,575 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:11:43,575 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:43,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:43,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1020047484, now seen corresponding path program 3 times [2021-03-11 20:11:43,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:43,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075531762] [2021-03-11 20:11:43,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:43,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:11:43,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:11:43,615 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-03-11 20:11:43,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-11 20:11:43,625 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-11 20:11:43,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-11 20:11:43,638 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-11 20:11:43,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075531762] [2021-03-11 20:11:43,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:43,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:11:43,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217998817] [2021-03-11 20:11:43,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:11:43,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:43,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:11:43,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:11:43,640 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 185 [2021-03-11 20:11:43,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:43,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:43,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 185 [2021-03-11 20:11:43,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:43,697 INFO L129 PetriNetUnfolder]: 27/94 cut-off events. [2021-03-11 20:11:43,697 INFO L130 PetriNetUnfolder]: For 277/314 co-relation queries the response was YES. [2021-03-11 20:11:43,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 94 events. 27/94 cut-off events. For 277/314 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 374 event pairs, 0 based on Foata normal form. 27/121 useless extension candidates. Maximal degree in co-relation 350. Up to 41 conditions per place. [2021-03-11 20:11:43,698 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 13 selfloop transitions, 15 changer transitions 0/42 dead transitions. [2021-03-11 20:11:43,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 316 flow [2021-03-11 20:11:43,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:11:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:11:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 868 transitions. [2021-03-11 20:11:43,700 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.781981981981982 [2021-03-11 20:11:43,700 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 868 transitions. [2021-03-11 20:11:43,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 868 transitions. [2021-03-11 20:11:43,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:43,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 868 transitions. [2021-03-11 20:11:43,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 144.66666666666666) internal successors, (868), 6 states have internal predecessors, (868), 0 states have call successors, (0), 0 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-11 20:11:43,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 0 states have call successors, (0), 0 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-11 20:11:43,703 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 0 states have call successors, (0), 0 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-11 20:11:43,703 INFO L185 Difference]: Start difference. First operand has 45 places, 37 transitions, 223 flow. Second operand 6 states and 868 transitions. [2021-03-11 20:11:43,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 316 flow [2021-03-11 20:11:43,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 303 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-03-11 20:11:43,705 INFO L241 Difference]: Finished difference. Result has 50 places, 38 transitions, 263 flow [2021-03-11 20:11:43,705 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=263, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2021-03-11 20:11:43,705 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2021-03-11 20:11:43,706 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 263 flow [2021-03-11 20:11:43,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:43,706 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:43,706 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:43,706 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:11:43,706 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:43,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:43,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1019999775, now seen corresponding path program 1 times [2021-03-11 20:11:43,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:43,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067060881] [2021-03-11 20:11:43,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:43,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:43,776 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-11 20:11:43,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067060881] [2021-03-11 20:11:43,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:43,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:11:43,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376572537] [2021-03-11 20:11:43,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:11:43,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:43,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:11:43,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:11:43,778 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 185 [2021-03-11 20:11:43,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 263 flow. Second operand has 3 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-11 20:11:43,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:43,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 185 [2021-03-11 20:11:43,778 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:43,807 INFO L129 PetriNetUnfolder]: 54/163 cut-off events. [2021-03-11 20:11:43,807 INFO L130 PetriNetUnfolder]: For 564/595 co-relation queries the response was YES. [2021-03-11 20:11:43,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 163 events. 54/163 cut-off events. For 564/595 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 822 event pairs, 9 based on Foata normal form. 13/167 useless extension candidates. Maximal degree in co-relation 636. Up to 61 conditions per place. [2021-03-11 20:11:43,809 INFO L132 encePairwiseOnDemand]: 181/185 looper letters, 3 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2021-03-11 20:11:43,810 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 40 transitions, 279 flow [2021-03-11 20:11:43,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:11:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:11:43,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2021-03-11 20:11:43,811 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.872072072072072 [2021-03-11 20:11:43,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2021-03-11 20:11:43,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2021-03-11 20:11:43,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:43,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2021-03-11 20:11:43,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 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-11 20:11:43,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:43,813 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:43,813 INFO L185 Difference]: Start difference. First operand has 50 places, 38 transitions, 263 flow. Second operand 3 states and 484 transitions. [2021-03-11 20:11:43,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 40 transitions, 279 flow [2021-03-11 20:11:43,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 261 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-11 20:11:43,816 INFO L241 Difference]: Finished difference. Result has 49 places, 40 transitions, 264 flow [2021-03-11 20:11:43,816 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2021-03-11 20:11:43,817 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2021-03-11 20:11:43,817 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 264 flow [2021-03-11 20:11:43,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 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-11 20:11:43,817 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:43,817 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:43,817 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:11:43,817 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:43,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:43,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1603711335, now seen corresponding path program 1 times [2021-03-11 20:11:43,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:43,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494544546] [2021-03-11 20:11:43,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:43,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:11:43,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:11:43,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:11:43,903 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-11 20:11:43,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-11 20:11:43,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:43,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:11:43,926 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-11 20:11:43,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494544546] [2021-03-11 20:11:43,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:43,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:11:43,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941374700] [2021-03-11 20:11:43,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:11:43,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:43,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:11:43,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:11:43,929 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 185 [2021-03-11 20:11:43,930 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 0 states have call successors, (0), 0 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-11 20:11:43,930 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:43,930 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 185 [2021-03-11 20:11:43,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:44,017 INFO L129 PetriNetUnfolder]: 60/182 cut-off events. [2021-03-11 20:11:44,017 INFO L130 PetriNetUnfolder]: For 585/667 co-relation queries the response was YES. [2021-03-11 20:11:44,018 INFO L84 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 182 events. 60/182 cut-off events. For 585/667 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 970 event pairs, 3 based on Foata normal form. 20/194 useless extension candidates. Maximal degree in co-relation 776. Up to 90 conditions per place. [2021-03-11 20:11:44,019 INFO L132 encePairwiseOnDemand]: 178/185 looper letters, 18 selfloop transitions, 10 changer transitions 0/44 dead transitions. [2021-03-11 20:11:44,019 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 44 transitions, 356 flow [2021-03-11 20:11:44,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:11:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:11:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2021-03-11 20:11:44,021 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7535135135135135 [2021-03-11 20:11:44,021 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2021-03-11 20:11:44,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2021-03-11 20:11:44,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:44,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2021-03-11 20:11:44,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 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-11 20:11:44,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:44,024 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:44,024 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 264 flow. Second operand 5 states and 697 transitions. [2021-03-11 20:11:44,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 44 transitions, 356 flow [2021-03-11 20:11:44,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 44 transitions, 353 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:11:44,027 INFO L241 Difference]: Finished difference. Result has 53 places, 41 transitions, 299 flow [2021-03-11 20:11:44,027 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2021-03-11 20:11:44,027 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2021-03-11 20:11:44,027 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 299 flow [2021-03-11 20:11:44,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 0 states have call successors, (0), 0 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-11 20:11:44,027 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:44,028 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:44,028 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:11:44,028 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:44,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:44,028 INFO L82 PathProgramCache]: Analyzing trace with hash 939880359, now seen corresponding path program 2 times [2021-03-11 20:11:44,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:44,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096970770] [2021-03-11 20:11:44,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:44,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:11:44,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:11:44,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:11:44,122 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.4 percent of original size [2021-03-11 20:11:44,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-11 20:11:44,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:11:44,156 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-11 20:11:44,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096970770] [2021-03-11 20:11:44,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:44,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:11:44,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872800392] [2021-03-11 20:11:44,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:11:44,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:44,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:11:44,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:11:44,161 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 185 [2021-03-11 20:11:44,161 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 299 flow. Second operand has 7 states, 7 states have (on average 134.85714285714286) internal successors, (944), 7 states have internal predecessors, (944), 0 states have call successors, (0), 0 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-11 20:11:44,162 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:44,162 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 185 [2021-03-11 20:11:44,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:44,246 INFO L129 PetriNetUnfolder]: 62/177 cut-off events. [2021-03-11 20:11:44,246 INFO L130 PetriNetUnfolder]: For 738/827 co-relation queries the response was YES. [2021-03-11 20:11:44,247 INFO L84 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 177 events. 62/177 cut-off events. For 738/827 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 895 event pairs, 8 based on Foata normal form. 20/186 useless extension candidates. Maximal degree in co-relation 857. Up to 92 conditions per place. [2021-03-11 20:11:44,248 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 19 selfloop transitions, 13 changer transitions 0/48 dead transitions. [2021-03-11 20:11:44,248 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 429 flow [2021-03-11 20:11:44,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:11:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:11:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 686 transitions. [2021-03-11 20:11:44,251 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7416216216216216 [2021-03-11 20:11:44,251 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 686 transitions. [2021-03-11 20:11:44,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 686 transitions. [2021-03-11 20:11:44,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:44,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 686 transitions. [2021-03-11 20:11:44,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 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-11 20:11:44,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:44,256 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:44,256 INFO L185 Difference]: Start difference. First operand has 53 places, 41 transitions, 299 flow. Second operand 5 states and 686 transitions. [2021-03-11 20:11:44,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 429 flow [2021-03-11 20:11:44,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 409 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-11 20:11:44,260 INFO L241 Difference]: Finished difference. Result has 56 places, 45 transitions, 364 flow [2021-03-11 20:11:44,260 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=364, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2021-03-11 20:11:44,260 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2021-03-11 20:11:44,260 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 364 flow [2021-03-11 20:11:44,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 134.85714285714286) internal successors, (944), 7 states have internal predecessors, (944), 0 states have call successors, (0), 0 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-11 20:11:44,261 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:44,261 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:44,261 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:11:44,261 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:44,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:44,261 INFO L82 PathProgramCache]: Analyzing trace with hash 572321279, now seen corresponding path program 3 times [2021-03-11 20:11:44,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:44,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887558844] [2021-03-11 20:11:44,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:44,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:11:44,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:11:44,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:11:44,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:11:44,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:11:44,364 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-11 20:11:44,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887558844] [2021-03-11 20:11:44,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:44,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:11:44,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905063970] [2021-03-11 20:11:44,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:11:44,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:44,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:11:44,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:11:44,366 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 185 [2021-03-11 20:11:44,367 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 0 states have call successors, (0), 0 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-11 20:11:44,367 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:44,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 185 [2021-03-11 20:11:44,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:44,464 INFO L129 PetriNetUnfolder]: 55/193 cut-off events. [2021-03-11 20:11:44,464 INFO L130 PetriNetUnfolder]: For 1024/1108 co-relation queries the response was YES. [2021-03-11 20:11:44,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 193 events. 55/193 cut-off events. For 1024/1108 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1088 event pairs, 3 based on Foata normal form. 52/237 useless extension candidates. Maximal degree in co-relation 908. Up to 71 conditions per place. [2021-03-11 20:11:44,466 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 8 selfloop transitions, 24 changer transitions 0/48 dead transitions. [2021-03-11 20:11:44,466 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 48 transitions, 455 flow [2021-03-11 20:11:44,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:11:44,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:11:44,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 984 transitions. [2021-03-11 20:11:44,468 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7598455598455598 [2021-03-11 20:11:44,468 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 984 transitions. [2021-03-11 20:11:44,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 984 transitions. [2021-03-11 20:11:44,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:44,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 984 transitions. [2021-03-11 20:11:44,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.57142857142858) internal successors, (984), 7 states have internal predecessors, (984), 0 states have call successors, (0), 0 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-11 20:11:44,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:44,473 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:44,473 INFO L185 Difference]: Start difference. First operand has 56 places, 45 transitions, 364 flow. Second operand 7 states and 984 transitions. [2021-03-11 20:11:44,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 48 transitions, 455 flow [2021-03-11 20:11:44,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 48 transitions, 437 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-11 20:11:44,475 INFO L241 Difference]: Finished difference. Result has 62 places, 46 transitions, 419 flow [2021-03-11 20:11:44,476 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=419, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2021-03-11 20:11:44,476 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 29 predicate places. [2021-03-11 20:11:44,476 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 419 flow [2021-03-11 20:11:44,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 0 states have call successors, (0), 0 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-11 20:11:44,477 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:44,477 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:44,477 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:11:44,477 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:44,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:44,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1555221755, now seen corresponding path program 1 times [2021-03-11 20:11:44,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:44,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123154913] [2021-03-11 20:11:44,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:44,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:44,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:11:44,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:11:44,535 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-11 20:11:44,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123154913] [2021-03-11 20:11:44,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:44,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:11:44,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315981110] [2021-03-11 20:11:44,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:11:44,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:44,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:11:44,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:11:44,537 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 185 [2021-03-11 20:11:44,537 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 419 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 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-11 20:11:44,537 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:44,537 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 185 [2021-03-11 20:11:44,537 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:44,592 INFO L129 PetriNetUnfolder]: 146/365 cut-off events. [2021-03-11 20:11:44,592 INFO L130 PetriNetUnfolder]: For 1507/1696 co-relation queries the response was YES. [2021-03-11 20:11:44,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 365 events. 146/365 cut-off events. For 1507/1696 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2233 event pairs, 52 based on Foata normal form. 98/428 useless extension candidates. Maximal degree in co-relation 1388. Up to 184 conditions per place. [2021-03-11 20:11:44,595 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 11 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2021-03-11 20:11:44,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 56 transitions, 477 flow [2021-03-11 20:11:44,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:11:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:11:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 778 transitions. [2021-03-11 20:11:44,596 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.841081081081081 [2021-03-11 20:11:44,597 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 778 transitions. [2021-03-11 20:11:44,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 778 transitions. [2021-03-11 20:11:44,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:44,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 778 transitions. [2021-03-11 20:11:44,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.6) internal successors, (778), 5 states have internal predecessors, (778), 0 states have call successors, (0), 0 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-11 20:11:44,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:44,599 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:44,599 INFO L185 Difference]: Start difference. First operand has 62 places, 46 transitions, 419 flow. Second operand 5 states and 778 transitions. [2021-03-11 20:11:44,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 56 transitions, 477 flow [2021-03-11 20:11:44,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 436 flow, removed 6 selfloop flow, removed 5 redundant places. [2021-03-11 20:11:44,605 INFO L241 Difference]: Finished difference. Result has 64 places, 53 transitions, 450 flow [2021-03-11 20:11:44,605 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=450, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2021-03-11 20:11:44,605 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 31 predicate places. [2021-03-11 20:11:44,605 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 450 flow [2021-03-11 20:11:44,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 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-11 20:11:44,605 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:44,605 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:44,605 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 20:11:44,605 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:44,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:44,606 INFO L82 PathProgramCache]: Analyzing trace with hash -474618482, now seen corresponding path program 1 times [2021-03-11 20:11:44,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:44,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669352918] [2021-03-11 20:11:44,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:44,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:44,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:44,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:11:44,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:11:44,648 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-11 20:11:44,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669352918] [2021-03-11 20:11:44,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:44,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:11:44,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998863047] [2021-03-11 20:11:44,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:11:44,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:44,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:11:44,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:11:44,650 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 185 [2021-03-11 20:11:44,650 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 450 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-11 20:11:44,651 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:44,651 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 185 [2021-03-11 20:11:44,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:44,708 INFO L129 PetriNetUnfolder]: 75/242 cut-off events. [2021-03-11 20:11:44,708 INFO L130 PetriNetUnfolder]: For 1407/2206 co-relation queries the response was YES. [2021-03-11 20:11:44,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1070 conditions, 242 events. 75/242 cut-off events. For 1407/2206 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1416 event pairs, 7 based on Foata normal form. 196/418 useless extension candidates. Maximal degree in co-relation 1042. Up to 140 conditions per place. [2021-03-11 20:11:44,710 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 5 selfloop transitions, 15 changer transitions 5/54 dead transitions. [2021-03-11 20:11:44,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 54 transitions, 454 flow [2021-03-11 20:11:44,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:11:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:11:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1089 transitions. [2021-03-11 20:11:44,712 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8409266409266409 [2021-03-11 20:11:44,712 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1089 transitions. [2021-03-11 20:11:44,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1089 transitions. [2021-03-11 20:11:44,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:44,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1089 transitions. [2021-03-11 20:11:44,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 0 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-11 20:11:44,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:44,717 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:44,717 INFO L185 Difference]: Start difference. First operand has 64 places, 53 transitions, 450 flow. Second operand 7 states and 1089 transitions. [2021-03-11 20:11:44,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 54 transitions, 454 flow [2021-03-11 20:11:44,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 54 transitions, 428 flow, removed 1 selfloop flow, removed 7 redundant places. [2021-03-11 20:11:44,720 INFO L241 Difference]: Finished difference. Result has 66 places, 49 transitions, 397 flow [2021-03-11 20:11:44,720 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=397, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2021-03-11 20:11:44,720 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 33 predicate places. [2021-03-11 20:11:44,720 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 397 flow [2021-03-11 20:11:44,721 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-11 20:11:44,721 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:44,721 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:44,721 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 20:11:44,721 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:44,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:44,721 INFO L82 PathProgramCache]: Analyzing trace with hash 846558453, now seen corresponding path program 1 times [2021-03-11 20:11:44,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:44,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871729955] [2021-03-11 20:11:44,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:44,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:11:44,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:44,750 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-11 20:11:44,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871729955] [2021-03-11 20:11:44,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:44,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:11:44,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411219035] [2021-03-11 20:11:44,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:11:44,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:44,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:11:44,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:11:44,751 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 185 [2021-03-11 20:11:44,752 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 397 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:44,752 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:44,752 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 185 [2021-03-11 20:11:44,752 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:44,782 INFO L129 PetriNetUnfolder]: 105/316 cut-off events. [2021-03-11 20:11:44,782 INFO L130 PetriNetUnfolder]: For 1724/2161 co-relation queries the response was YES. [2021-03-11 20:11:44,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1518 conditions, 316 events. 105/316 cut-off events. For 1724/2161 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2031 event pairs, 12 based on Foata normal form. 25/305 useless extension candidates. Maximal degree in co-relation 1489. Up to 200 conditions per place. [2021-03-11 20:11:44,784 INFO L132 encePairwiseOnDemand]: 182/185 looper letters, 3 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2021-03-11 20:11:44,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 49 transitions, 409 flow [2021-03-11 20:11:44,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:11:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:11:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2021-03-11 20:11:44,786 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8702702702702703 [2021-03-11 20:11:44,786 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 483 transitions. [2021-03-11 20:11:44,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 483 transitions. [2021-03-11 20:11:44,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:44,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 483 transitions. [2021-03-11 20:11:44,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:44,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:44,788 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:44,788 INFO L185 Difference]: Start difference. First operand has 66 places, 49 transitions, 397 flow. Second operand 3 states and 483 transitions. [2021-03-11 20:11:44,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 49 transitions, 409 flow [2021-03-11 20:11:44,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 49 transitions, 372 flow, removed 14 selfloop flow, removed 2 redundant places. [2021-03-11 20:11:44,792 INFO L241 Difference]: Finished difference. Result has 67 places, 49 transitions, 371 flow [2021-03-11 20:11:44,792 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=67, PETRI_TRANSITIONS=49} [2021-03-11 20:11:44,792 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 34 predicate places. [2021-03-11 20:11:44,792 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 49 transitions, 371 flow [2021-03-11 20:11:44,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:44,792 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:44,792 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:11:44,792 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 20:11:44,793 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:44,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:44,793 INFO L82 PathProgramCache]: Analyzing trace with hash 473508069, now seen corresponding path program 1 times [2021-03-11 20:11:44,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:44,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026162073] [2021-03-11 20:11:44,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:44,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:44,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:44,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:44,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:11:44,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:11:44,838 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-11 20:11:44,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026162073] [2021-03-11 20:11:44,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:44,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:11:44,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577030076] [2021-03-11 20:11:44,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:11:44,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:44,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:11:44,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:11:44,841 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 185 [2021-03-11 20:11:44,841 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 49 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 0 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-11 20:11:44,841 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:44,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 185 [2021-03-11 20:11:44,841 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:44,912 INFO L129 PetriNetUnfolder]: 78/258 cut-off events. [2021-03-11 20:11:44,912 INFO L130 PetriNetUnfolder]: For 1424/2128 co-relation queries the response was YES. [2021-03-11 20:11:44,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 258 events. 78/258 cut-off events. For 1424/2128 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1651 event pairs, 0 based on Foata normal form. 228/454 useless extension candidates. Maximal degree in co-relation 1085. Up to 90 conditions per place. [2021-03-11 20:11:44,914 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 2 selfloop transitions, 19 changer transitions 7/53 dead transitions. [2021-03-11 20:11:44,914 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 53 transitions, 449 flow [2021-03-11 20:11:44,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:11:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:11:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1394 transitions. [2021-03-11 20:11:44,917 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8372372372372372 [2021-03-11 20:11:44,917 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1394 transitions. [2021-03-11 20:11:44,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1394 transitions. [2021-03-11 20:11:44,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:44,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1394 transitions. [2021-03-11 20:11:44,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 154.88888888888889) internal successors, (1394), 9 states have internal predecessors, (1394), 0 states have call successors, (0), 0 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-11 20:11:44,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:44,954 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:44,954 INFO L185 Difference]: Start difference. First operand has 67 places, 49 transitions, 371 flow. Second operand 9 states and 1394 transitions. [2021-03-11 20:11:44,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 53 transitions, 449 flow [2021-03-11 20:11:44,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 53 transitions, 430 flow, removed 7 selfloop flow, removed 2 redundant places. [2021-03-11 20:11:44,956 INFO L241 Difference]: Finished difference. Result has 76 places, 46 transitions, 387 flow [2021-03-11 20:11:44,957 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=387, PETRI_PLACES=76, PETRI_TRANSITIONS=46} [2021-03-11 20:11:44,957 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 43 predicate places. [2021-03-11 20:11:44,957 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 46 transitions, 387 flow [2021-03-11 20:11:44,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 0 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-11 20:11:44,957 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:44,957 INFO L255 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-11 20:11:44,957 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 20:11:44,957 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:44,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:44,958 INFO L82 PathProgramCache]: Analyzing trace with hash 948069590, now seen corresponding path program 1 times [2021-03-11 20:11:44,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:44,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701456077] [2021-03-11 20:11:44,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:11:44,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:11:44,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:44,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:11:44,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:11:45,000 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-11 20:11:45,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701456077] [2021-03-11 20:11:45,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:11:45,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:11:45,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711520728] [2021-03-11 20:11:45,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:11:45,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:11:45,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:11:45,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:11:45,002 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 185 [2021-03-11 20:11:45,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 46 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 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-11 20:11:45,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:11:45,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 185 [2021-03-11 20:11:45,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:11:45,024 INFO L129 PetriNetUnfolder]: 39/150 cut-off events. [2021-03-11 20:11:45,024 INFO L130 PetriNetUnfolder]: For 679/727 co-relation queries the response was YES. [2021-03-11 20:11:45,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 150 events. 39/150 cut-off events. For 679/727 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 760 event pairs, 0 based on Foata normal form. 10/151 useless extension candidates. Maximal degree in co-relation 626. Up to 50 conditions per place. [2021-03-11 20:11:45,025 INFO L132 encePairwiseOnDemand]: 182/185 looper letters, 3 selfloop transitions, 1 changer transitions 11/47 dead transitions. [2021-03-11 20:11:45,025 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 47 transitions, 399 flow [2021-03-11 20:11:45,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:11:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:11:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 638 transitions. [2021-03-11 20:11:45,027 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8621621621621621 [2021-03-11 20:11:45,027 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 638 transitions. [2021-03-11 20:11:45,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 638 transitions. [2021-03-11 20:11:45,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:11:45,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 638 transitions. [2021-03-11 20:11:45,028 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-11 20:11:45,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:45,029 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:11:45,029 INFO L185 Difference]: Start difference. First operand has 76 places, 46 transitions, 387 flow. Second operand 4 states and 638 transitions. [2021-03-11 20:11:45,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 47 transitions, 399 flow [2021-03-11 20:11:45,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 47 transitions, 315 flow, removed 18 selfloop flow, removed 12 redundant places. [2021-03-11 20:11:45,032 INFO L241 Difference]: Finished difference. Result has 68 places, 36 transitions, 220 flow [2021-03-11 20:11:45,032 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=68, PETRI_TRANSITIONS=36} [2021-03-11 20:11:45,033 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 35 predicate places. [2021-03-11 20:11:45,033 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 36 transitions, 220 flow [2021-03-11 20:11:45,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 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-11 20:11:45,033 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:11:45,033 INFO L255 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-11 20:11:45,033 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-11 20:11:45,033 INFO L428 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:11:45,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:11:45,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1743636750, now seen corresponding path program 2 times [2021-03-11 20:11:45,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:11:45,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920234780] [2021-03-11 20:11:45,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:11:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:11:45,060 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:11:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:11:45,090 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:11:45,122 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:11:45,123 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:11:45,124 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-11 20:11:45,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:11:45 BasicIcfg [2021-03-11 20:11:45,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:11:45,195 INFO L168 Benchmark]: Toolchain (without parser) took 15913.08 ms. Allocated memory was 255.9 MB in the beginning and 553.6 MB in the end (delta: 297.8 MB). Free memory was 234.6 MB in the beginning and 451.2 MB in the end (delta: -216.7 MB). Peak memory consumption was 79.7 MB. Max. memory is 16.0 GB. [2021-03-11 20:11:45,195 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:11:45,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.61 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 233.9 MB in the beginning and 321.2 MB in the end (delta: -87.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-11 20:11:45,195 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.99 ms. Allocated memory is still 362.8 MB. Free memory was 321.2 MB in the beginning and 318.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:11:45,195 INFO L168 Benchmark]: Boogie Preprocessor took 47.70 ms. Allocated memory is still 362.8 MB. Free memory was 318.5 MB in the beginning and 316.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:11:45,196 INFO L168 Benchmark]: RCFGBuilder took 1262.34 ms. Allocated memory is still 362.8 MB. Free memory was 316.4 MB in the beginning and 334.3 MB in the end (delta: -17.8 MB). Peak memory consumption was 69.7 MB. Max. memory is 16.0 GB. [2021-03-11 20:11:45,196 INFO L168 Benchmark]: TraceAbstraction took 14120.53 ms. Allocated memory was 362.8 MB in the beginning and 553.6 MB in the end (delta: 190.8 MB). Free memory was 334.3 MB in the beginning and 451.2 MB in the end (delta: -117.0 MB). Peak memory consumption was 73.9 MB. Max. memory is 16.0 GB. [2021-03-11 20:11:45,197 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.09 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 412.61 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 233.9 MB in the beginning and 321.2 MB in the end (delta: -87.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 62.99 ms. Allocated memory is still 362.8 MB. Free memory was 321.2 MB in the beginning and 318.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 47.70 ms. Allocated memory is still 362.8 MB. Free memory was 318.5 MB in the beginning and 316.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1262.34 ms. Allocated memory is still 362.8 MB. Free memory was 316.4 MB in the beginning and 334.3 MB in the end (delta: -17.8 MB). Peak memory consumption was 69.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 14120.53 ms. Allocated memory was 362.8 MB in the beginning and 553.6 MB in the end (delta: 190.8 MB). Free memory was 334.3 MB in the beginning and 451.2 MB in the end (delta: -117.0 MB). Peak memory consumption was 73.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11462.5ms, 105 PlacesBefore, 33 PlacesAfterwards, 97 TransitionsBefore, 23 TransitionsAfterwards, 1738 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 85 TotalNumberOfCompositions, 4495 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2307, positive: 2133, positive conditional: 0, positive unconditional: 2133, negative: 174, negative conditional: 0, negative unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1216, positive: 1160, positive conditional: 0, positive unconditional: 1160, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1216, positive: 1139, positive conditional: 0, positive unconditional: 1139, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 893, positive: 82, positive conditional: 0, positive unconditional: 82, negative: 811, negative conditional: 0, negative unconditional: 811, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2307, positive: 973, positive conditional: 0, positive unconditional: 973, negative: 118, negative conditional: 0, negative unconditional: 118, unknown: 1216, unknown conditional: 0, unknown unconditional: 1216] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1211; [L824] FCALL, FORK 0 pthread_create(&t1211, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1212; [L826] FCALL, FORK 0 pthread_create(&t1212, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1213; [L828] FCALL, FORK 0 pthread_create(&t1213, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 13982.9ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1057.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11511.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 52 SDtfs, 30 SDslu, 16 SDs, 0 SdLazy, 313 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 289.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 287.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=11, InterpolantAutomatonStates: 74, 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: 40.0ms SsaConstructionTime, 403.6ms SatisfiabilityAnalysisTime, 729.7ms InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 1187 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...