/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:19:13,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:19:13,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:19:13,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:19:13,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:19:13,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:19:13,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:19:13,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:19:13,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:19:13,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:19:13,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:19:13,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:19:13,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:19:13,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:19:13,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:19:13,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:19:13,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:19:13,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:19:13,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:19:13,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:19:13,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:19:13,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:19:13,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:19:13,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:19:13,346 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:19:13,346 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:19:13,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:19:13,347 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:19:13,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:19:13,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:19:13,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:19:13,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:19:13,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:19:13,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:19:13,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:19:13,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:19:13,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:19:13,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:19:13,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:19:13,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:19:13,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:19:13,353 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-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:19:13,378 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:19:13,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:19:13,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:19:13,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:19:13,381 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:19:13,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:19:13,381 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:19:13,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:19:13,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:19:13,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:19:13,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:19:13,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:19:13,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:19:13,383 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:19:13,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:19:13,383 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:19:13,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:19:13,383 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:19:13,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:19:13,383 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:19:13,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:19:13,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:19:13,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:19:13,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:19:13,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:19:13,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:19:13,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:19:13,384 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:19:13,384 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:19:13,384 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:19:13,384 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:19:13,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:19:13,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:19:13,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:19:13,651 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:19:13,652 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:19:13,653 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2021-03-26 00:19:13,694 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/160549e78/b29599e2ed38475181cdf70b0c1b63a8/FLAGdf76e48d9 [2021-03-26 00:19:14,110 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:19:14,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2021-03-26 00:19:14,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/160549e78/b29599e2ed38475181cdf70b0c1b63a8/FLAGdf76e48d9 [2021-03-26 00:19:14,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/160549e78/b29599e2ed38475181cdf70b0c1b63a8 [2021-03-26 00:19:14,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:19:14,132 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:19:14,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:19:14,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:19:14,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:19:14,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:19:14" (1/1) ... [2021-03-26 00:19:14,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@656f20b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:14, skipping insertion in model container [2021-03-26 00:19:14,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:19:14" (1/1) ... [2021-03-26 00:19:14,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:19:14,197 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:19:14,349 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/mix044_tso.oepc.i[949,962] [2021-03-26 00:19:14,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:19:14,519 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:19:14,526 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/mix044_tso.oepc.i[949,962] [2021-03-26 00:19:14,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:19:14,625 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:19:14,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:14 WrapperNode [2021-03-26 00:19:14,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:19:14,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:19:14,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:19:14,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:19:14,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:14" (1/1) ... [2021-03-26 00:19:14,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:14" (1/1) ... [2021-03-26 00:19:14,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:19:14,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:19:14,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:19:14,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:19:14,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:14" (1/1) ... [2021-03-26 00:19:14,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:14" (1/1) ... [2021-03-26 00:19:14,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:14" (1/1) ... [2021-03-26 00:19:14,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:14" (1/1) ... [2021-03-26 00:19:14,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:14" (1/1) ... [2021-03-26 00:19:14,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:14" (1/1) ... [2021-03-26 00:19:14,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:14" (1/1) ... [2021-03-26 00:19:14,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:19:14,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:19:14,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:19:14,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:19:14,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:14" (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-26 00:19:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:19:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:19:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:19:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:19:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:19:14,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:19:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:19:14,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:19:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:19:14,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:19:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:19:14,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:19:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:19:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:19:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:19:14,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:19:14,759 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:19:16,063 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:19:16,063 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:19:16,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:19:16 BoogieIcfgContainer [2021-03-26 00:19:16,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:19:16,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:19:16,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:19:16,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:19:16,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:19:14" (1/3) ... [2021-03-26 00:19:16,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df6773c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:19:16, skipping insertion in model container [2021-03-26 00:19:16,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:14" (2/3) ... [2021-03-26 00:19:16,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df6773c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:19:16, skipping insertion in model container [2021-03-26 00:19:16,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:19:16" (3/3) ... [2021-03-26 00:19:16,070 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2021-03-26 00:19:16,076 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:19:16,078 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:19:16,079 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:19:16,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,108 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,108 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,108 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,108 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,112 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,112 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,112 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,113 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,113 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,113 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,113 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,113 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,116 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,116 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,117 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,117 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,120 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,120 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,120 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,120 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,128 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,131 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,132 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,134 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,134 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,136 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,136 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,137 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,137 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,137 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:16,138 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:19:16,150 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:19:16,171 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:19:16,171 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:19:16,171 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:19:16,171 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:19:16,171 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:19:16,171 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:19:16,171 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:19:16,171 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:19:16,180 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 119 transitions, 258 flow [2021-03-26 00:19:16,219 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-03-26 00:19:16,219 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:19:16,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 00:19:16,222 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 119 transitions, 258 flow [2021-03-26 00:19:16,227 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 115 transitions, 242 flow [2021-03-26 00:19:16,228 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:19:16,235 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 242 flow [2021-03-26 00:19:16,237 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 242 flow [2021-03-26 00:19:16,238 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 242 flow [2021-03-26 00:19:16,252 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-03-26 00:19:16,252 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:19:16,253 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 00:19:16,255 INFO L142 LiptonReduction]: Number of co-enabled transitions 2868 [2021-03-26 00:19:17,472 WARN L205 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-26 00:19:18,053 WARN L205 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-03-26 00:19:19,345 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-26 00:19:19,879 WARN L205 SmtUtils]: Spent 527.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 00:19:20,638 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:19:20,971 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 00:19:21,095 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:19:22,658 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 00:19:22,946 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 00:19:23,525 WARN L205 SmtUtils]: Spent 576.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 00:19:24,122 WARN L205 SmtUtils]: Spent 596.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 00:19:24,288 INFO L154 LiptonReduction]: Checked pairs total: 5220 [2021-03-26 00:19:24,288 INFO L156 LiptonReduction]: Total number of compositions: 76 [2021-03-26 00:19:24,289 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8062 [2021-03-26 00:19:24,302 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-26 00:19:24,302 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:19:24,302 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:19:24,303 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:19:24,303 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:19:24,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:19:24,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1034007324, now seen corresponding path program 1 times [2021-03-26 00:19:24,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:19:24,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429920447] [2021-03-26 00:19:24,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:19:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:19:24,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:24,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:19:24,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:24,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:24,493 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-26 00:19:24,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429920447] [2021-03-26 00:19:24,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:19:24,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:19:24,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783041927] [2021-03-26 00:19:24,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:19:24,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:19:24,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:19:24,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:19:24,512 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 195 [2021-03-26 00:19:24,517 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:24,517 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:19:24,517 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 195 [2021-03-26 00:19:24,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:19:24,659 INFO L129 PetriNetUnfolder]: 185/412 cut-off events. [2021-03-26 00:19:24,659 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:19:24,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 412 events. 185/412 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2212 event pairs, 123 based on Foata normal form. 20/393 useless extension candidates. Maximal degree in co-relation 685. Up to 209 conditions per place. [2021-03-26 00:19:24,667 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 11 selfloop transitions, 2 changer transitions 4/50 dead transitions. [2021-03-26 00:19:24,667 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 142 flow [2021-03-26 00:19:24,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:19:24,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:19:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2021-03-26 00:19:24,681 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9179487179487179 [2021-03-26 00:19:24,681 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 537 transitions. [2021-03-26 00:19:24,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 537 transitions. [2021-03-26 00:19:24,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:19:24,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 537 transitions. [2021-03-26 00:19:24,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:24,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:24,695 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:24,696 INFO L185 Difference]: Start difference. First operand has 59 places, 47 transitions, 106 flow. Second operand 3 states and 537 transitions. [2021-03-26 00:19:24,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 142 flow [2021-03-26 00:19:24,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:19:24,699 INFO L241 Difference]: Finished difference. Result has 55 places, 41 transitions, 94 flow [2021-03-26 00:19:24,700 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2021-03-26 00:19:24,701 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2021-03-26 00:19:24,701 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:19:24,701 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 41 transitions, 94 flow [2021-03-26 00:19:24,702 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 41 transitions, 94 flow [2021-03-26 00:19:24,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 94 flow [2021-03-26 00:19:24,708 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-26 00:19:24,708 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:19:24,708 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:19:24,710 INFO L142 LiptonReduction]: Number of co-enabled transitions 482 [2021-03-26 00:19:25,071 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 00:19:25,197 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 00:19:25,729 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-26 00:19:26,010 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-26 00:19:26,628 WARN L205 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-26 00:19:27,247 WARN L205 SmtUtils]: Spent 618.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-26 00:19:27,886 INFO L154 LiptonReduction]: Checked pairs total: 2261 [2021-03-26 00:19:27,886 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 00:19:27,886 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3185 [2021-03-26 00:19:27,888 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 72 flow [2021-03-26 00:19:27,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:27,888 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:19:27,888 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:19:27,889 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:19:27,889 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:19:27,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:19:27,889 INFO L82 PathProgramCache]: Analyzing trace with hash 48708481, now seen corresponding path program 1 times [2021-03-26 00:19:27,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:19:27,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158050061] [2021-03-26 00:19:27,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:19:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:19:28,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:28,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:19:28,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:28,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:28,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:28,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:19:28,018 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-26 00:19:28,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158050061] [2021-03-26 00:19:28,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:19:28,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:19:28,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535551074] [2021-03-26 00:19:28,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:19:28,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:19:28,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:19:28,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:19:28,022 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2021-03-26 00:19:28,023 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:28,023 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:19:28,023 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2021-03-26 00:19:28,023 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:19:28,036 INFO L129 PetriNetUnfolder]: 3/44 cut-off events. [2021-03-26 00:19:28,036 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:19:28,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 44 events. 3/44 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 1 based on Foata normal form. 1/44 useless extension candidates. Maximal degree in co-relation 56. Up to 10 conditions per place. [2021-03-26 00:19:28,036 INFO L132 encePairwiseOnDemand]: 202/206 looper letters, 3 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2021-03-26 00:19:28,036 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 32 transitions, 88 flow [2021-03-26 00:19:28,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:19:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:19:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2021-03-26 00:19:28,038 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8851132686084142 [2021-03-26 00:19:28,038 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2021-03-26 00:19:28,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2021-03-26 00:19:28,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:19:28,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2021-03-26 00:19:28,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:28,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:28,040 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:28,040 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 72 flow. Second operand 3 states and 547 transitions. [2021-03-26 00:19:28,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 32 transitions, 88 flow [2021-03-26 00:19:28,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:19:28,041 INFO L241 Difference]: Finished difference. Result has 42 places, 32 transitions, 87 flow [2021-03-26 00:19:28,041 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2021-03-26 00:19:28,042 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -17 predicate places. [2021-03-26 00:19:28,042 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:19:28,042 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 87 flow [2021-03-26 00:19:28,042 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 87 flow [2021-03-26 00:19:28,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 87 flow [2021-03-26 00:19:28,046 INFO L129 PetriNetUnfolder]: 3/44 cut-off events. [2021-03-26 00:19:28,046 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:19:28,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 44 events. 3/44 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 77 event pairs, 1 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 57. Up to 10 conditions per place. [2021-03-26 00:19:28,047 INFO L142 LiptonReduction]: Number of co-enabled transitions 448 [2021-03-26 00:19:28,659 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-26 00:19:28,798 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:19:29,147 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-26 00:19:29,308 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:19:29,312 INFO L154 LiptonReduction]: Checked pairs total: 1536 [2021-03-26 00:19:29,312 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:19:29,312 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1270 [2021-03-26 00:19:29,313 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 83 flow [2021-03-26 00:19:29,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:29,313 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:19:29,313 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:19:29,313 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:19:29,314 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:19:29,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:19:29,314 INFO L82 PathProgramCache]: Analyzing trace with hash 160595623, now seen corresponding path program 1 times [2021-03-26 00:19:29,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:19:29,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775275038] [2021-03-26 00:19:29,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:19:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:19:29,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:29,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:29,358 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-26 00:19:29,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775275038] [2021-03-26 00:19:29,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:19:29,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:19:29,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050465448] [2021-03-26 00:19:29,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:19:29,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:19:29,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:19:29,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:19:29,360 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 208 [2021-03-26 00:19:29,361 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:29,361 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:19:29,361 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 208 [2021-03-26 00:19:29,361 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:19:29,371 INFO L129 PetriNetUnfolder]: 2/36 cut-off events. [2021-03-26 00:19:29,372 INFO L130 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2021-03-26 00:19:29,372 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 36 events. 2/36 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 2/38 useless extension candidates. Maximal degree in co-relation 53. Up to 8 conditions per place. [2021-03-26 00:19:29,372 INFO L132 encePairwiseOnDemand]: 205/208 looper letters, 1 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2021-03-26 00:19:29,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 89 flow [2021-03-26 00:19:29,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:19:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:19:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2021-03-26 00:19:29,374 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9102564102564102 [2021-03-26 00:19:29,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 568 transitions. [2021-03-26 00:19:29,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 568 transitions. [2021-03-26 00:19:29,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:19:29,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 568 transitions. [2021-03-26 00:19:29,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:29,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:29,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:29,376 INFO L185 Difference]: Start difference. First operand has 40 places, 30 transitions, 83 flow. Second operand 3 states and 568 transitions. [2021-03-26 00:19:29,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 89 flow [2021-03-26 00:19:29,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 86 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:19:29,378 INFO L241 Difference]: Finished difference. Result has 42 places, 30 transitions, 88 flow [2021-03-26 00:19:29,378 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2021-03-26 00:19:29,378 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -17 predicate places. [2021-03-26 00:19:29,378 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:19:29,378 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 30 transitions, 88 flow [2021-03-26 00:19:29,379 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 30 transitions, 88 flow [2021-03-26 00:19:29,379 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 88 flow [2021-03-26 00:19:29,382 INFO L129 PetriNetUnfolder]: 2/36 cut-off events. [2021-03-26 00:19:29,382 INFO L130 PetriNetUnfolder]: For 2/3 co-relation queries the response was YES. [2021-03-26 00:19:29,382 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 36 events. 2/36 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 1 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 51. Up to 8 conditions per place. [2021-03-26 00:19:29,383 INFO L142 LiptonReduction]: Number of co-enabled transitions 446 [2021-03-26 00:19:29,436 INFO L154 LiptonReduction]: Checked pairs total: 949 [2021-03-26 00:19:29,436 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:19:29,436 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 58 [2021-03-26 00:19:29,437 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 89 flow [2021-03-26 00:19:29,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:29,437 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:19:29,437 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:19:29,437 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:19:29,438 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:19:29,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:19:29,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1222792099, now seen corresponding path program 1 times [2021-03-26 00:19:29,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:19:29,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078106073] [2021-03-26 00:19:29,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:19:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:19:29,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:29,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:19:29,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:29,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:19:29,522 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-26 00:19:29,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078106073] [2021-03-26 00:19:29,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:19:29,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:19:29,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735899756] [2021-03-26 00:19:29,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:19:29,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:19:29,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:19:29,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:19:29,525 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 210 [2021-03-26 00:19:29,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:29,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:19:29,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 210 [2021-03-26 00:19:29,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:19:29,623 INFO L129 PetriNetUnfolder]: 286/496 cut-off events. [2021-03-26 00:19:29,623 INFO L130 PetriNetUnfolder]: For 90/141 co-relation queries the response was YES. [2021-03-26 00:19:29,625 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 496 events. 286/496 cut-off events. For 90/141 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2483 event pairs, 197 based on Foata normal form. 5/456 useless extension candidates. Maximal degree in co-relation 1032. Up to 405 conditions per place. [2021-03-26 00:19:29,627 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 10 selfloop transitions, 9 changer transitions 0/39 dead transitions. [2021-03-26 00:19:29,627 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 147 flow [2021-03-26 00:19:29,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:19:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:19:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 681 transitions. [2021-03-26 00:19:29,629 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8107142857142857 [2021-03-26 00:19:29,629 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 681 transitions. [2021-03-26 00:19:29,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 681 transitions. [2021-03-26 00:19:29,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:19:29,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 681 transitions. [2021-03-26 00:19:29,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 170.25) internal successors, (681), 4 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:29,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:29,632 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:29,632 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 89 flow. Second operand 4 states and 681 transitions. [2021-03-26 00:19:29,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 147 flow [2021-03-26 00:19:29,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 141 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:19:29,633 INFO L241 Difference]: Finished difference. Result has 44 places, 37 transitions, 141 flow [2021-03-26 00:19:29,634 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2021-03-26 00:19:29,634 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -15 predicate places. [2021-03-26 00:19:29,634 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:19:29,634 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 37 transitions, 141 flow [2021-03-26 00:19:29,634 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 37 transitions, 141 flow [2021-03-26 00:19:29,634 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 141 flow [2021-03-26 00:19:29,646 INFO L129 PetriNetUnfolder]: 37/129 cut-off events. [2021-03-26 00:19:29,646 INFO L130 PetriNetUnfolder]: For 89/112 co-relation queries the response was YES. [2021-03-26 00:19:29,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 129 events. 37/129 cut-off events. For 89/112 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 605 event pairs, 7 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 277. Up to 36 conditions per place. [2021-03-26 00:19:29,648 INFO L142 LiptonReduction]: Number of co-enabled transitions 562 [2021-03-26 00:19:29,741 INFO L154 LiptonReduction]: Checked pairs total: 336 [2021-03-26 00:19:29,741 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:19:29,741 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 107 [2021-03-26 00:19:29,742 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 141 flow [2021-03-26 00:19:29,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:29,743 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:19:29,743 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:19:29,743 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:19:29,743 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:19:29,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:19:29,743 INFO L82 PathProgramCache]: Analyzing trace with hash -446396152, now seen corresponding path program 1 times [2021-03-26 00:19:29,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:19:29,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543791587] [2021-03-26 00:19:29,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:19:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:19:29,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:29,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:19:29,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:29,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:19:29,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:29,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:19:29,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-26 00:19:29,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543791587] [2021-03-26 00:19:29,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:19:29,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:19:29,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121103020] [2021-03-26 00:19:29,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:19:29,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:19:29,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:19:29,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:19:29,859 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 210 [2021-03-26 00:19:29,860 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:29,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:19:29,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 210 [2021-03-26 00:19:29,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:19:29,972 INFO L129 PetriNetUnfolder]: 263/476 cut-off events. [2021-03-26 00:19:29,972 INFO L130 PetriNetUnfolder]: For 639/1089 co-relation queries the response was YES. [2021-03-26 00:19:29,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1299 conditions, 476 events. 263/476 cut-off events. For 639/1089 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2345 event pairs, 104 based on Foata normal form. 36/474 useless extension candidates. Maximal degree in co-relation 1285. Up to 299 conditions per place. [2021-03-26 00:19:29,976 INFO L132 encePairwiseOnDemand]: 202/210 looper letters, 17 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2021-03-26 00:19:29,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 227 flow [2021-03-26 00:19:29,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:19:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:19:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 693 transitions. [2021-03-26 00:19:29,978 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.825 [2021-03-26 00:19:29,978 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 693 transitions. [2021-03-26 00:19:29,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 693 transitions. [2021-03-26 00:19:29,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:19:29,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 693 transitions. [2021-03-26 00:19:29,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:29,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:29,981 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:29,981 INFO L185 Difference]: Start difference. First operand has 44 places, 37 transitions, 141 flow. Second operand 4 states and 693 transitions. [2021-03-26 00:19:29,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 227 flow [2021-03-26 00:19:29,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 227 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:19:29,985 INFO L241 Difference]: Finished difference. Result has 49 places, 43 transitions, 211 flow [2021-03-26 00:19:29,985 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2021-03-26 00:19:29,985 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -10 predicate places. [2021-03-26 00:19:29,985 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:19:29,986 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 43 transitions, 211 flow [2021-03-26 00:19:29,986 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 43 transitions, 211 flow [2021-03-26 00:19:29,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 43 transitions, 211 flow [2021-03-26 00:19:30,022 INFO L129 PetriNetUnfolder]: 181/371 cut-off events. [2021-03-26 00:19:30,022 INFO L130 PetriNetUnfolder]: For 902/1078 co-relation queries the response was YES. [2021-03-26 00:19:30,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 371 events. 181/371 cut-off events. For 902/1078 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 1940 event pairs, 62 based on Foata normal form. 1/316 useless extension candidates. Maximal degree in co-relation 1149. Up to 221 conditions per place. [2021-03-26 00:19:30,026 INFO L142 LiptonReduction]: Number of co-enabled transitions 646 [2021-03-26 00:19:30,083 INFO L154 LiptonReduction]: Checked pairs total: 332 [2021-03-26 00:19:30,083 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:19:30,083 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 98 [2021-03-26 00:19:30,086 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 211 flow [2021-03-26 00:19:30,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:30,086 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:19:30,086 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:19:30,086 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:19:30,087 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:19:30,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:19:30,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1950473100, now seen corresponding path program 1 times [2021-03-26 00:19:30,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:19:30,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168434297] [2021-03-26 00:19:30,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:19:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:19:30,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:30,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:19:30,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:30,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:19:30,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:30,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:19:30,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:30,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:19:30,217 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-26 00:19:30,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168434297] [2021-03-26 00:19:30,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:19:30,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:19:30,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136268448] [2021-03-26 00:19:30,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:19:30,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:19:30,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:19:30,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:19:30,220 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 210 [2021-03-26 00:19:30,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:30,221 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:19:30,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 210 [2021-03-26 00:19:30,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:19:30,376 INFO L129 PetriNetUnfolder]: 280/518 cut-off events. [2021-03-26 00:19:30,377 INFO L130 PetriNetUnfolder]: For 1074/2057 co-relation queries the response was YES. [2021-03-26 00:19:30,378 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1824 conditions, 518 events. 280/518 cut-off events. For 1074/2057 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2588 event pairs, 31 based on Foata normal form. 76/562 useless extension candidates. Maximal degree in co-relation 1806. Up to 303 conditions per place. [2021-03-26 00:19:30,382 INFO L132 encePairwiseOnDemand]: 201/210 looper letters, 16 selfloop transitions, 31 changer transitions 0/67 dead transitions. [2021-03-26 00:19:30,382 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 435 flow [2021-03-26 00:19:30,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:19:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:19:30,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1330 transitions. [2021-03-26 00:19:30,384 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2021-03-26 00:19:30,385 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1330 transitions. [2021-03-26 00:19:30,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1330 transitions. [2021-03-26 00:19:30,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:19:30,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1330 transitions. [2021-03-26 00:19:30,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 166.25) internal successors, (1330), 8 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:30,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:30,389 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:30,389 INFO L185 Difference]: Start difference. First operand has 49 places, 43 transitions, 211 flow. Second operand 8 states and 1330 transitions. [2021-03-26 00:19:30,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 435 flow [2021-03-26 00:19:30,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 417 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-03-26 00:19:30,393 INFO L241 Difference]: Finished difference. Result has 58 places, 63 transitions, 410 flow [2021-03-26 00:19:30,393 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=410, PETRI_PLACES=58, PETRI_TRANSITIONS=63} [2021-03-26 00:19:30,393 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2021-03-26 00:19:30,393 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:19:30,393 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 63 transitions, 410 flow [2021-03-26 00:19:30,394 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 63 transitions, 410 flow [2021-03-26 00:19:30,394 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 63 transitions, 410 flow [2021-03-26 00:19:30,435 INFO L129 PetriNetUnfolder]: 235/454 cut-off events. [2021-03-26 00:19:30,436 INFO L130 PetriNetUnfolder]: For 1633/1951 co-relation queries the response was YES. [2021-03-26 00:19:30,437 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1677 conditions, 454 events. 235/454 cut-off events. For 1633/1951 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2400 event pairs, 43 based on Foata normal form. 6/415 useless extension candidates. Maximal degree in co-relation 1657. Up to 260 conditions per place. [2021-03-26 00:19:30,440 INFO L142 LiptonReduction]: Number of co-enabled transitions 900 [2021-03-26 00:19:30,638 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 00:19:31,001 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-26 00:19:31,110 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-26 00:19:31,135 INFO L154 LiptonReduction]: Checked pairs total: 1508 [2021-03-26 00:19:31,136 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:19:31,136 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 743 [2021-03-26 00:19:31,136 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 63 transitions, 413 flow [2021-03-26 00:19:31,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:31,137 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:19:31,137 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:19:31,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:19:31,137 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:19:31,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:19:31,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1372163797, now seen corresponding path program 1 times [2021-03-26 00:19:31,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:19:31,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083929771] [2021-03-26 00:19:31,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:19:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:19:31,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:31,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:31,200 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:19:31,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:19:31,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:31,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:19:31,206 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-26 00:19:31,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083929771] [2021-03-26 00:19:31,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:19:31,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:19:31,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275067530] [2021-03-26 00:19:31,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:19:31,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:19:31,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:19:31,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:19:31,208 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 211 [2021-03-26 00:19:31,208 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 413 flow. Second operand has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:31,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:19:31,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 211 [2021-03-26 00:19:31,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:19:31,347 INFO L129 PetriNetUnfolder]: 688/1262 cut-off events. [2021-03-26 00:19:31,347 INFO L130 PetriNetUnfolder]: For 3243/4138 co-relation queries the response was YES. [2021-03-26 00:19:31,387 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4020 conditions, 1262 events. 688/1262 cut-off events. For 3243/4138 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 8138 event pairs, 293 based on Foata normal form. 203/1362 useless extension candidates. Maximal degree in co-relation 3998. Up to 595 conditions per place. [2021-03-26 00:19:31,392 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 11 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2021-03-26 00:19:31,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 442 flow [2021-03-26 00:19:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:19:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:19:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 917 transitions. [2021-03-26 00:19:31,394 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8691943127962085 [2021-03-26 00:19:31,394 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 917 transitions. [2021-03-26 00:19:31,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 917 transitions. [2021-03-26 00:19:31,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:19:31,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 917 transitions. [2021-03-26 00:19:31,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.4) internal successors, (917), 5 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-26 00:19:31,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:31,397 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:31,398 INFO L185 Difference]: Start difference. First operand has 58 places, 63 transitions, 413 flow. Second operand 5 states and 917 transitions. [2021-03-26 00:19:31,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 442 flow [2021-03-26 00:19:31,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 367 flow, removed 14 selfloop flow, removed 6 redundant places. [2021-03-26 00:19:31,406 INFO L241 Difference]: Finished difference. Result has 59 places, 67 transitions, 378 flow [2021-03-26 00:19:31,406 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=378, PETRI_PLACES=59, PETRI_TRANSITIONS=67} [2021-03-26 00:19:31,406 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2021-03-26 00:19:31,406 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:19:31,406 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 67 transitions, 378 flow [2021-03-26 00:19:31,406 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 67 transitions, 378 flow [2021-03-26 00:19:31,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 67 transitions, 378 flow [2021-03-26 00:19:31,505 INFO L129 PetriNetUnfolder]: 654/1202 cut-off events. [2021-03-26 00:19:31,505 INFO L130 PetriNetUnfolder]: For 2595/3171 co-relation queries the response was YES. [2021-03-26 00:19:31,509 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4212 conditions, 1202 events. 654/1202 cut-off events. For 2595/3171 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 7960 event pairs, 209 based on Foata normal form. 22/1063 useless extension candidates. Maximal degree in co-relation 4192. Up to 528 conditions per place. [2021-03-26 00:19:31,518 INFO L142 LiptonReduction]: Number of co-enabled transitions 1112 [2021-03-26 00:19:31,689 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 00:19:32,076 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-26 00:19:32,184 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-26 00:19:32,243 INFO L154 LiptonReduction]: Checked pairs total: 1141 [2021-03-26 00:19:32,244 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:19:32,244 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 838 [2021-03-26 00:19:32,244 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 67 transitions, 378 flow [2021-03-26 00:19:32,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:32,245 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:19:32,245 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:19:32,245 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:19:32,245 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:19:32,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:19:32,245 INFO L82 PathProgramCache]: Analyzing trace with hash 786644770, now seen corresponding path program 1 times [2021-03-26 00:19:32,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:19:32,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801139340] [2021-03-26 00:19:32,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:19:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:19:32,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:32,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:19:32,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:32,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:19:32,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:32,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 00:19:32,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:32,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:19:32,371 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-26 00:19:32,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801139340] [2021-03-26 00:19:32,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:19:32,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:19:32,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252583722] [2021-03-26 00:19:32,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:19:32,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:19:32,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:19:32,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:19:32,373 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 212 [2021-03-26 00:19:32,374 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 67 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:32,374 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:19:32,374 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 212 [2021-03-26 00:19:32,374 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:19:32,604 INFO L129 PetriNetUnfolder]: 784/1390 cut-off events. [2021-03-26 00:19:32,604 INFO L130 PetriNetUnfolder]: For 3857/5870 co-relation queries the response was YES. [2021-03-26 00:19:32,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5392 conditions, 1390 events. 784/1390 cut-off events. For 3857/5870 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 8817 event pairs, 166 based on Foata normal form. 116/1365 useless extension candidates. Maximal degree in co-relation 5370. Up to 654 conditions per place. [2021-03-26 00:19:32,615 INFO L132 encePairwiseOnDemand]: 205/212 looper letters, 25 selfloop transitions, 20 changer transitions 0/74 dead transitions. [2021-03-26 00:19:32,615 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 74 transitions, 518 flow [2021-03-26 00:19:32,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:19:32,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:19:32,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 667 transitions. [2021-03-26 00:19:32,617 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7865566037735849 [2021-03-26 00:19:32,618 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 667 transitions. [2021-03-26 00:19:32,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 667 transitions. [2021-03-26 00:19:32,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:19:32,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 667 transitions. [2021-03-26 00:19:32,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:32,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:32,621 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:32,621 INFO L185 Difference]: Start difference. First operand has 59 places, 67 transitions, 378 flow. Second operand 4 states and 667 transitions. [2021-03-26 00:19:32,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 74 transitions, 518 flow [2021-03-26 00:19:32,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 513 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:19:32,626 INFO L241 Difference]: Finished difference. Result has 62 places, 71 transitions, 470 flow [2021-03-26 00:19:32,626 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=470, PETRI_PLACES=62, PETRI_TRANSITIONS=71} [2021-03-26 00:19:32,626 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2021-03-26 00:19:32,626 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:19:32,626 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 71 transitions, 470 flow [2021-03-26 00:19:32,626 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 71 transitions, 470 flow [2021-03-26 00:19:32,627 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 71 transitions, 470 flow [2021-03-26 00:19:32,733 INFO L129 PetriNetUnfolder]: 720/1343 cut-off events. [2021-03-26 00:19:32,733 INFO L130 PetriNetUnfolder]: For 4008/4930 co-relation queries the response was YES. [2021-03-26 00:19:32,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5114 conditions, 1343 events. 720/1343 cut-off events. For 4008/4930 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 9113 event pairs, 207 based on Foata normal form. 43/1202 useless extension candidates. Maximal degree in co-relation 5092. Up to 600 conditions per place. [2021-03-26 00:19:32,749 INFO L142 LiptonReduction]: Number of co-enabled transitions 1242 [2021-03-26 00:19:32,789 INFO L154 LiptonReduction]: Checked pairs total: 776 [2021-03-26 00:19:32,789 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:19:32,789 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 163 [2021-03-26 00:19:32,790 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 71 transitions, 470 flow [2021-03-26 00:19:32,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:32,790 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:19:32,790 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:19:32,790 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:19:32,790 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:19:32,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:19:32,791 INFO L82 PathProgramCache]: Analyzing trace with hash 231599502, now seen corresponding path program 1 times [2021-03-26 00:19:32,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:19:32,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512272703] [2021-03-26 00:19:32,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:19:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:19:32,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:32,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:32,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:32,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:32,845 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:19:32,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:19:32,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:32,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:19:32,853 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-26 00:19:32,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512272703] [2021-03-26 00:19:32,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:19:32,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:19:32,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046129218] [2021-03-26 00:19:32,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:19:32,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:19:32,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:19:32,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:19:32,854 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2021-03-26 00:19:32,855 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 71 transitions, 470 flow. Second operand has 5 states, 5 states have (on average 180.8) internal successors, (904), 5 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:32,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:19:32,855 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2021-03-26 00:19:32,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:19:32,980 INFO L129 PetriNetUnfolder]: 422/931 cut-off events. [2021-03-26 00:19:32,980 INFO L130 PetriNetUnfolder]: For 2963/5079 co-relation queries the response was YES. [2021-03-26 00:19:32,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 931 events. 422/931 cut-off events. For 2963/5079 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6562 event pairs, 45 based on Foata normal form. 438/1291 useless extension candidates. Maximal degree in co-relation 3792. Up to 516 conditions per place. [2021-03-26 00:19:32,987 INFO L132 encePairwiseOnDemand]: 205/212 looper letters, 11 selfloop transitions, 19 changer transitions 0/84 dead transitions. [2021-03-26 00:19:32,988 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 84 transitions, 606 flow [2021-03-26 00:19:32,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:19:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:19:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1291 transitions. [2021-03-26 00:19:32,990 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8699460916442049 [2021-03-26 00:19:32,990 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1291 transitions. [2021-03-26 00:19:32,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1291 transitions. [2021-03-26 00:19:32,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:19:32,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1291 transitions. [2021-03-26 00:19:32,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 184.42857142857142) internal successors, (1291), 7 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:32,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:32,995 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:32,995 INFO L185 Difference]: Start difference. First operand has 62 places, 71 transitions, 470 flow. Second operand 7 states and 1291 transitions. [2021-03-26 00:19:32,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 84 transitions, 606 flow [2021-03-26 00:19:32,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 573 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-26 00:19:33,000 INFO L241 Difference]: Finished difference. Result has 68 places, 80 transitions, 575 flow [2021-03-26 00:19:33,000 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=575, PETRI_PLACES=68, PETRI_TRANSITIONS=80} [2021-03-26 00:19:33,000 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 9 predicate places. [2021-03-26 00:19:33,000 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:19:33,000 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 80 transitions, 575 flow [2021-03-26 00:19:33,000 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 80 transitions, 575 flow [2021-03-26 00:19:33,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 80 transitions, 575 flow [2021-03-26 00:19:33,068 INFO L129 PetriNetUnfolder]: 416/924 cut-off events. [2021-03-26 00:19:33,068 INFO L130 PetriNetUnfolder]: For 3750/6149 co-relation queries the response was YES. [2021-03-26 00:19:33,071 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4091 conditions, 924 events. 416/924 cut-off events. For 3750/6149 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6709 event pairs, 44 based on Foata normal form. 52/891 useless extension candidates. Maximal degree in co-relation 4067. Up to 507 conditions per place. [2021-03-26 00:19:33,078 INFO L142 LiptonReduction]: Number of co-enabled transitions 1506 [2021-03-26 00:19:33,113 INFO L154 LiptonReduction]: Checked pairs total: 902 [2021-03-26 00:19:33,114 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:19:33,114 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 114 [2021-03-26 00:19:33,114 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 80 transitions, 575 flow [2021-03-26 00:19:33,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 180.8) internal successors, (904), 5 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:33,115 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:19:33,115 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:19:33,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:19:33,115 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:19:33,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:19:33,115 INFO L82 PathProgramCache]: Analyzing trace with hash 815835842, now seen corresponding path program 1 times [2021-03-26 00:19:33,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:19:33,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115999650] [2021-03-26 00:19:33,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:19:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:19:33,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:33,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:33,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:33,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:33,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:33,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:33,179 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:19:33,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:19:33,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:33,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:19:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:19:33,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115999650] [2021-03-26 00:19:33,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:19:33,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:19:33,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571458107] [2021-03-26 00:19:33,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:19:33,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:19:33,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:19:33,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:19:33,188 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2021-03-26 00:19:33,189 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 80 transitions, 575 flow. Second operand has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:33,189 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:19:33,189 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2021-03-26 00:19:33,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:19:33,351 INFO L129 PetriNetUnfolder]: 302/739 cut-off events. [2021-03-26 00:19:33,351 INFO L130 PetriNetUnfolder]: For 3956/7442 co-relation queries the response was YES. [2021-03-26 00:19:33,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3700 conditions, 739 events. 302/739 cut-off events. For 3956/7442 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5287 event pairs, 5 based on Foata normal form. 559/1236 useless extension candidates. Maximal degree in co-relation 3674. Up to 478 conditions per place. [2021-03-26 00:19:33,358 INFO L132 encePairwiseOnDemand]: 205/212 looper letters, 6 selfloop transitions, 28 changer transitions 4/92 dead transitions. [2021-03-26 00:19:33,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 92 transitions, 763 flow [2021-03-26 00:19:33,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:19:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:19:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1660 transitions. [2021-03-26 00:19:33,362 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.870020964360587 [2021-03-26 00:19:33,362 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1660 transitions. [2021-03-26 00:19:33,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1660 transitions. [2021-03-26 00:19:33,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:19:33,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1660 transitions. [2021-03-26 00:19:33,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 184.44444444444446) internal successors, (1660), 9 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:33,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:33,369 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:33,369 INFO L185 Difference]: Start difference. First operand has 68 places, 80 transitions, 575 flow. Second operand 9 states and 1660 transitions. [2021-03-26 00:19:33,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 92 transitions, 763 flow [2021-03-26 00:19:33,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 92 transitions, 705 flow, removed 21 selfloop flow, removed 3 redundant places. [2021-03-26 00:19:33,380 INFO L241 Difference]: Finished difference. Result has 76 places, 88 transitions, 681 flow [2021-03-26 00:19:33,381 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=681, PETRI_PLACES=76, PETRI_TRANSITIONS=88} [2021-03-26 00:19:33,381 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 17 predicate places. [2021-03-26 00:19:33,381 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:19:33,381 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 88 transitions, 681 flow [2021-03-26 00:19:33,381 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 88 transitions, 681 flow [2021-03-26 00:19:33,382 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 88 transitions, 681 flow [2021-03-26 00:19:33,439 INFO L129 PetriNetUnfolder]: 294/727 cut-off events. [2021-03-26 00:19:33,439 INFO L130 PetriNetUnfolder]: For 3563/4150 co-relation queries the response was YES. [2021-03-26 00:19:33,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3258 conditions, 727 events. 294/727 cut-off events. For 3563/4150 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5194 event pairs, 6 based on Foata normal form. 22/699 useless extension candidates. Maximal degree in co-relation 3231. Up to 288 conditions per place. [2021-03-26 00:19:33,449 INFO L142 LiptonReduction]: Number of co-enabled transitions 1604 [2021-03-26 00:19:33,478 INFO L154 LiptonReduction]: Checked pairs total: 2079 [2021-03-26 00:19:33,478 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:19:33,478 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 97 [2021-03-26 00:19:33,479 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 85 transitions, 655 flow [2021-03-26 00:19:33,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:33,480 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:19:33,480 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:19:33,480 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:19:33,480 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:19:33,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:19:33,480 INFO L82 PathProgramCache]: Analyzing trace with hash -633282279, now seen corresponding path program 1 times [2021-03-26 00:19:33,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:19:33,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501965822] [2021-03-26 00:19:33,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:19:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:19:33,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:33,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:19:33,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:33,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:33,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:33,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:33,516 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-26 00:19:33,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501965822] [2021-03-26 00:19:33,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:19:33,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:19:33,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326364252] [2021-03-26 00:19:33,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:19:33,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:19:33,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:19:33,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:19:33,518 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 212 [2021-03-26 00:19:33,518 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 85 transitions, 655 flow. Second operand has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:33,518 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:19:33,518 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 212 [2021-03-26 00:19:33,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:19:33,593 INFO L129 PetriNetUnfolder]: 327/750 cut-off events. [2021-03-26 00:19:33,593 INFO L130 PetriNetUnfolder]: For 2512/3297 co-relation queries the response was YES. [2021-03-26 00:19:33,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 750 events. 327/750 cut-off events. For 2512/3297 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4657 event pairs, 9 based on Foata normal form. 15/716 useless extension candidates. Maximal degree in co-relation 2965. Up to 245 conditions per place. [2021-03-26 00:19:33,599 INFO L132 encePairwiseOnDemand]: 209/212 looper letters, 4 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2021-03-26 00:19:33,599 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 75 transitions, 549 flow [2021-03-26 00:19:33,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:19:33,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:19:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 759 transitions. [2021-03-26 00:19:33,601 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8950471698113207 [2021-03-26 00:19:33,601 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 759 transitions. [2021-03-26 00:19:33,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 759 transitions. [2021-03-26 00:19:33,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:19:33,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 759 transitions. [2021-03-26 00:19:33,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 189.75) internal successors, (759), 4 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:33,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:33,604 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:33,604 INFO L185 Difference]: Start difference. First operand has 76 places, 85 transitions, 655 flow. Second operand 4 states and 759 transitions. [2021-03-26 00:19:33,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 75 transitions, 549 flow [2021-03-26 00:19:33,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 75 transitions, 486 flow, removed 25 selfloop flow, removed 7 redundant places. [2021-03-26 00:19:33,611 INFO L241 Difference]: Finished difference. Result has 66 places, 74 transitions, 473 flow [2021-03-26 00:19:33,611 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=473, PETRI_PLACES=66, PETRI_TRANSITIONS=74} [2021-03-26 00:19:33,612 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 7 predicate places. [2021-03-26 00:19:33,612 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:19:33,612 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 74 transitions, 473 flow [2021-03-26 00:19:33,612 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 74 transitions, 473 flow [2021-03-26 00:19:33,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 74 transitions, 473 flow [2021-03-26 00:19:33,655 INFO L129 PetriNetUnfolder]: 298/666 cut-off events. [2021-03-26 00:19:33,656 INFO L130 PetriNetUnfolder]: For 1107/1356 co-relation queries the response was YES. [2021-03-26 00:19:33,657 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2271 conditions, 666 events. 298/666 cut-off events. For 1107/1356 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4048 event pairs, 12 based on Foata normal form. 4/628 useless extension candidates. Maximal degree in co-relation 2247. Up to 202 conditions per place. [2021-03-26 00:19:33,661 INFO L142 LiptonReduction]: Number of co-enabled transitions 1080 [2021-03-26 00:19:33,671 INFO L154 LiptonReduction]: Checked pairs total: 247 [2021-03-26 00:19:33,671 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:19:33,671 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 59 [2021-03-26 00:19:33,671 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 74 transitions, 473 flow [2021-03-26 00:19:33,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:33,672 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:19:33,672 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:19:33,672 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:19:33,672 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:19:33,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:19:33,672 INFO L82 PathProgramCache]: Analyzing trace with hash -970076295, now seen corresponding path program 2 times [2021-03-26 00:19:33,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:19:33,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705605058] [2021-03-26 00:19:33,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:19:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:19:33,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:33,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:33,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:33,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:33,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:33,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:33,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:33,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:33,737 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:19:33,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:19:33,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:33,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:19:33,746 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-26 00:19:33,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705605058] [2021-03-26 00:19:33,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:19:33,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:19:33,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405111131] [2021-03-26 00:19:33,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:19:33,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:19:33,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:19:33,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:19:33,748 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2021-03-26 00:19:33,749 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 74 transitions, 473 flow. Second operand has 7 states, 7 states have (on average 180.85714285714286) internal successors, (1266), 7 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:33,749 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:19:33,749 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2021-03-26 00:19:33,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:19:33,851 INFO L129 PetriNetUnfolder]: 304/694 cut-off events. [2021-03-26 00:19:33,851 INFO L130 PetriNetUnfolder]: For 1387/2335 co-relation queries the response was YES. [2021-03-26 00:19:33,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 694 events. 304/694 cut-off events. For 1387/2335 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4324 event pairs, 4 based on Foata normal form. 159/805 useless extension candidates. Maximal degree in co-relation 2581. Up to 221 conditions per place. [2021-03-26 00:19:33,855 INFO L132 encePairwiseOnDemand]: 205/212 looper letters, 2 selfloop transitions, 18 changer transitions 4/79 dead transitions. [2021-03-26 00:19:33,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 79 transitions, 569 flow [2021-03-26 00:19:33,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:19:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:19:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1466 transitions. [2021-03-26 00:19:33,858 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8643867924528302 [2021-03-26 00:19:33,858 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1466 transitions. [2021-03-26 00:19:33,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1466 transitions. [2021-03-26 00:19:33,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:19:33,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1466 transitions. [2021-03-26 00:19:33,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 183.25) internal successors, (1466), 8 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:33,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:33,863 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:33,863 INFO L185 Difference]: Start difference. First operand has 66 places, 74 transitions, 473 flow. Second operand 8 states and 1466 transitions. [2021-03-26 00:19:33,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 79 transitions, 569 flow [2021-03-26 00:19:33,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 79 transitions, 525 flow, removed 20 selfloop flow, removed 2 redundant places. [2021-03-26 00:19:33,868 INFO L241 Difference]: Finished difference. Result has 74 places, 75 transitions, 497 flow [2021-03-26 00:19:33,869 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=497, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2021-03-26 00:19:33,869 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 15 predicate places. [2021-03-26 00:19:33,869 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:19:33,869 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 75 transitions, 497 flow [2021-03-26 00:19:33,869 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 75 transitions, 497 flow [2021-03-26 00:19:33,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 75 transitions, 497 flow [2021-03-26 00:19:33,913 INFO L129 PetriNetUnfolder]: 300/688 cut-off events. [2021-03-26 00:19:33,913 INFO L130 PetriNetUnfolder]: For 1418/2071 co-relation queries the response was YES. [2021-03-26 00:19:33,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2521 conditions, 688 events. 300/688 cut-off events. For 1418/2071 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4349 event pairs, 6 based on Foata normal form. 4/651 useless extension candidates. Maximal degree in co-relation 2494. Up to 221 conditions per place. [2021-03-26 00:19:33,919 INFO L142 LiptonReduction]: Number of co-enabled transitions 1046 [2021-03-26 00:19:34,508 WARN L205 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 186 [2021-03-26 00:19:34,730 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2021-03-26 00:19:35,951 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 341 DAG size of output: 264 [2021-03-26 00:19:36,443 WARN L205 SmtUtils]: Spent 482.00 ms on a formula simplification that was a NOOP. DAG size: 246 [2021-03-26 00:19:36,666 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-26 00:19:36,894 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-26 00:19:37,425 WARN L205 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-26 00:19:37,943 WARN L205 SmtUtils]: Spent 516.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-26 00:19:37,970 INFO L154 LiptonReduction]: Checked pairs total: 846 [2021-03-26 00:19:37,970 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:19:37,970 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4101 [2021-03-26 00:19:37,971 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 481 flow [2021-03-26 00:19:37,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 180.85714285714286) internal successors, (1266), 7 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:37,972 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:19:37,972 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:19:37,972 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:19:37,972 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:19:37,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:19:37,972 INFO L82 PathProgramCache]: Analyzing trace with hash -677208203, now seen corresponding path program 1 times [2021-03-26 00:19:37,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:19:37,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677984449] [2021-03-26 00:19:37,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:19:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:19:38,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:38,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:19:38,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:38,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:38,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:38,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:38,011 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-26 00:19:38,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677984449] [2021-03-26 00:19:38,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:19:38,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:19:38,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100830759] [2021-03-26 00:19:38,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:19:38,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:19:38,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:19:38,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:19:38,013 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 214 [2021-03-26 00:19:38,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 481 flow. Second operand has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:38,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:19:38,013 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 214 [2021-03-26 00:19:38,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:19:38,105 INFO L129 PetriNetUnfolder]: 495/1075 cut-off events. [2021-03-26 00:19:38,106 INFO L130 PetriNetUnfolder]: For 4858/5807 co-relation queries the response was YES. [2021-03-26 00:19:38,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3996 conditions, 1075 events. 495/1075 cut-off events. For 4858/5807 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 7467 event pairs, 9 based on Foata normal form. 81/1081 useless extension candidates. Maximal degree in co-relation 3967. Up to 356 conditions per place. [2021-03-26 00:19:38,112 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 3 selfloop transitions, 2 changer transitions 5/73 dead transitions. [2021-03-26 00:19:38,112 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 73 transitions, 493 flow [2021-03-26 00:19:38,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:19:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:19:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 746 transitions. [2021-03-26 00:19:38,115 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8714953271028038 [2021-03-26 00:19:38,115 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 746 transitions. [2021-03-26 00:19:38,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 746 transitions. [2021-03-26 00:19:38,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:19:38,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 746 transitions. [2021-03-26 00:19:38,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.5) internal successors, (746), 4 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:38,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:38,127 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:38,127 INFO L185 Difference]: Start difference. First operand has 70 places, 72 transitions, 481 flow. Second operand 4 states and 746 transitions. [2021-03-26 00:19:38,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 73 transitions, 493 flow [2021-03-26 00:19:38,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 73 transitions, 432 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-03-26 00:19:38,138 INFO L241 Difference]: Finished difference. Result has 67 places, 68 transitions, 406 flow [2021-03-26 00:19:38,139 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=406, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2021-03-26 00:19:38,139 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 8 predicate places. [2021-03-26 00:19:38,139 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:19:38,139 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 68 transitions, 406 flow [2021-03-26 00:19:38,139 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 68 transitions, 406 flow [2021-03-26 00:19:38,139 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 68 transitions, 406 flow [2021-03-26 00:19:38,198 INFO L129 PetriNetUnfolder]: 422/934 cut-off events. [2021-03-26 00:19:38,198 INFO L130 PetriNetUnfolder]: For 1679/2274 co-relation queries the response was YES. [2021-03-26 00:19:38,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3044 conditions, 934 events. 422/934 cut-off events. For 1679/2274 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6454 event pairs, 13 based on Foata normal form. 22/894 useless extension candidates. Maximal degree in co-relation 3020. Up to 308 conditions per place. [2021-03-26 00:19:38,207 INFO L142 LiptonReduction]: Number of co-enabled transitions 894 [2021-03-26 00:19:38,212 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:19:38,212 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:19:38,212 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 73 [2021-03-26 00:19:38,213 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 406 flow [2021-03-26 00:19:38,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:38,213 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:19:38,213 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:19:38,213 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:19:38,213 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:19:38,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:19:38,214 INFO L82 PathProgramCache]: Analyzing trace with hash -908208395, now seen corresponding path program 1 times [2021-03-26 00:19:38,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:19:38,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927746251] [2021-03-26 00:19:38,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:19:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:19:38,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:38,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:19:38,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:19:38,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:19:38,276 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-26 00:19:38,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927746251] [2021-03-26 00:19:38,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:19:38,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:19:38,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131605679] [2021-03-26 00:19:38,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:19:38,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:19:38,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:19:38,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:19:38,278 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 214 [2021-03-26 00:19:38,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:38,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:19:38,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 214 [2021-03-26 00:19:38,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:19:38,383 INFO L129 PetriNetUnfolder]: 637/1335 cut-off events. [2021-03-26 00:19:38,383 INFO L130 PetriNetUnfolder]: For 3302/4127 co-relation queries the response was YES. [2021-03-26 00:19:38,387 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4408 conditions, 1335 events. 637/1335 cut-off events. For 3302/4127 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 9551 event pairs, 22 based on Foata normal form. 67/1295 useless extension candidates. Maximal degree in co-relation 4382. Up to 425 conditions per place. [2021-03-26 00:19:38,389 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 2 selfloop transitions, 2 changer transitions 22/68 dead transitions. [2021-03-26 00:19:38,389 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 418 flow [2021-03-26 00:19:38,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:19:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:19:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2021-03-26 00:19:38,391 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.883177570093458 [2021-03-26 00:19:38,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2021-03-26 00:19:38,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2021-03-26 00:19:38,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:19:38,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2021-03-26 00:19:38,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 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-26 00:19:38,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:38,393 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:38,393 INFO L185 Difference]: Start difference. First operand has 67 places, 68 transitions, 406 flow. Second operand 3 states and 567 transitions. [2021-03-26 00:19:38,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 418 flow [2021-03-26 00:19:38,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:19:38,408 INFO L241 Difference]: Finished difference. Result has 69 places, 46 transitions, 285 flow [2021-03-26 00:19:38,408 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2021-03-26 00:19:38,409 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places. [2021-03-26 00:19:38,409 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:19:38,409 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 46 transitions, 285 flow [2021-03-26 00:19:38,409 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 46 transitions, 285 flow [2021-03-26 00:19:38,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 46 transitions, 285 flow [2021-03-26 00:19:38,432 INFO L129 PetriNetUnfolder]: 168/388 cut-off events. [2021-03-26 00:19:38,432 INFO L130 PetriNetUnfolder]: For 1051/1327 co-relation queries the response was YES. [2021-03-26 00:19:38,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 388 events. 168/388 cut-off events. For 1051/1327 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2164 event pairs, 16 based on Foata normal form. 18/376 useless extension candidates. Maximal degree in co-relation 1300. Up to 115 conditions per place. [2021-03-26 00:19:38,436 INFO L142 LiptonReduction]: Number of co-enabled transitions 440 [2021-03-26 00:19:38,522 INFO L154 LiptonReduction]: Checked pairs total: 83 [2021-03-26 00:19:38,522 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:19:38,522 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 113 [2021-03-26 00:19:38,523 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 286 flow [2021-03-26 00:19:38,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:19:38,523 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:19:38,523 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:19:38,523 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:19:38,523 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:19:38,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:19:38,523 INFO L82 PathProgramCache]: Analyzing trace with hash 191827215, now seen corresponding path program 1 times [2021-03-26 00:19:38,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:19:38,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256763273] [2021-03-26 00:19:38,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:19:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:19:38,549 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:19:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:19:38,590 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:19:38,622 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:19:38,623 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:19:38,623 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:19:38,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:19:38 BasicIcfg [2021-03-26 00:19:38,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:19:38,712 INFO L168 Benchmark]: Toolchain (without parser) took 24579.45 ms. Allocated memory was 255.9 MB in the beginning and 778.0 MB in the end (delta: 522.2 MB). Free memory was 237.0 MB in the beginning and 591.4 MB in the end (delta: -354.4 MB). Peak memory consumption was 166.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:19:38,712 INFO L168 Benchmark]: CDTParser took 0.34 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-26 00:19:38,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 493.86 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 237.0 MB in the beginning and 308.6 MB in the end (delta: -71.7 MB). Peak memory consumption was 21.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:19:38,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.91 ms. Allocated memory is still 350.2 MB. Free memory was 308.6 MB in the beginning and 305.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:19:38,714 INFO L168 Benchmark]: Boogie Preprocessor took 18.53 ms. Allocated memory is still 350.2 MB. Free memory was 305.8 MB in the beginning and 303.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:19:38,718 INFO L168 Benchmark]: RCFGBuilder took 1367.37 ms. Allocated memory is still 350.2 MB. Free memory was 303.0 MB in the beginning and 181.5 MB in the end (delta: 121.5 MB). Peak memory consumption was 120.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:19:38,718 INFO L168 Benchmark]: TraceAbstraction took 22644.51 ms. Allocated memory was 350.2 MB in the beginning and 778.0 MB in the end (delta: 427.8 MB). Free memory was 180.4 MB in the beginning and 591.4 MB in the end (delta: -411.0 MB). Peak memory consumption was 15.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:19:38,719 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.34 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 493.86 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 237.0 MB in the beginning and 308.6 MB in the end (delta: -71.7 MB). Peak memory consumption was 21.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 51.91 ms. Allocated memory is still 350.2 MB. Free memory was 308.6 MB in the beginning and 305.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 18.53 ms. Allocated memory is still 350.2 MB. Free memory was 305.8 MB in the beginning and 303.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1367.37 ms. Allocated memory is still 350.2 MB. Free memory was 303.0 MB in the beginning and 181.5 MB in the end (delta: 121.5 MB). Peak memory consumption was 120.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 22644.51 ms. Allocated memory was 350.2 MB in the beginning and 778.0 MB in the end (delta: 427.8 MB). Free memory was 180.4 MB in the beginning and 591.4 MB in the end (delta: -411.0 MB). Peak memory consumption was 15.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8050.7ms, 126 PlacesBefore, 59 PlacesAfterwards, 115 TransitionsBefore, 47 TransitionsAfterwards, 2868 CoEnabledTransitionPairs, 5 FixpointIterations, 30 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 5220 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2690, positive: 2579, positive conditional: 2579, positive unconditional: 0, negative: 111, negative conditional: 111, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2041, positive: 1988, positive conditional: 0, positive unconditional: 1988, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2041, positive: 1988, positive conditional: 0, positive unconditional: 1988, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2041, positive: 1966, positive conditional: 0, positive unconditional: 1966, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 859, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 800, negative conditional: 0, negative unconditional: 800, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2690, positive: 591, positive conditional: 591, positive unconditional: 0, negative: 58, negative conditional: 58, negative unconditional: 0, unknown: 2041, unknown conditional: 2041, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 113, Positive conditional cache size: 113, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3184.2ms, 55 PlacesBefore, 41 PlacesAfterwards, 41 TransitionsBefore, 30 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 2261 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 625, positive: 506, positive conditional: 506, positive unconditional: 0, negative: 119, negative conditional: 119, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 117, positive: 93, positive conditional: 17, positive unconditional: 76, negative: 24, negative conditional: 4, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 117, positive: 93, positive conditional: 17, positive unconditional: 76, negative: 24, negative conditional: 4, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 117, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 24, negative conditional: 4, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 316, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 297, negative conditional: 81, negative unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 625, positive: 413, positive conditional: 413, positive unconditional: 0, negative: 95, negative conditional: 95, negative unconditional: 0, unknown: 117, unknown conditional: 117, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 148, Positive conditional cache size: 148, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1269.6ms, 42 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 30 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1536 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 361, positive: 283, positive conditional: 283, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, positive: 26, positive conditional: 5, positive unconditional: 21, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, positive: 26, positive conditional: 5, positive unconditional: 21, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 361, positive: 257, positive conditional: 257, positive unconditional: 0, negative: 75, negative conditional: 75, negative unconditional: 0, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 174, Positive conditional cache size: 174, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 57.3ms, 42 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 949 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 249, positive: 202, positive conditional: 202, positive unconditional: 0, negative: 47, negative conditional: 47, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 40, positive conditional: 39, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, positive: 40, positive conditional: 39, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 40, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 249, positive: 162, positive conditional: 162, positive unconditional: 0, negative: 47, negative conditional: 47, negative unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 156, Positive conditional cache size: 156, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 107.3ms, 44 PlacesBefore, 44 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 336 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 120, positive: 105, positive conditional: 105, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, positive: 51, positive conditional: 28, positive unconditional: 23, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 53, positive: 51, positive conditional: 28, positive unconditional: 23, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 53, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, positive: 54, positive conditional: 54, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 53, unknown conditional: 53, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 207, Positive conditional cache size: 207, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 97.4ms, 49 PlacesBefore, 49 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 646 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 332 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 167, positive: 154, positive conditional: 154, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 34, positive conditional: 13, positive unconditional: 21, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, positive: 34, positive conditional: 13, positive unconditional: 21, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 167, positive: 120, positive conditional: 120, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 36, unknown conditional: 36, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 241, Positive conditional cache size: 241, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 742.0ms, 58 PlacesBefore, 58 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 900 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1508 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 772, positive: 726, positive conditional: 726, positive unconditional: 0, negative: 46, negative conditional: 46, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, positive: 114, positive conditional: 86, positive unconditional: 28, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 114, positive: 114, positive conditional: 86, positive unconditional: 28, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 114, positive: 112, positive conditional: 0, positive unconditional: 112, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 772, positive: 612, positive conditional: 612, positive unconditional: 0, negative: 46, negative conditional: 46, negative unconditional: 0, unknown: 114, unknown conditional: 114, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 316, Positive conditional cache size: 316, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 837.2ms, 59 PlacesBefore, 59 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1112 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1141 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 584, positive: 556, positive conditional: 556, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, positive: 63, positive conditional: 48, positive unconditional: 15, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 63, positive: 63, positive conditional: 48, positive unconditional: 15, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 63, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 584, positive: 493, positive conditional: 493, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 63, unknown conditional: 63, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 386, Positive cache size: 360, Positive conditional cache size: 360, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 162.7ms, 62 PlacesBefore, 62 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 776 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 393, positive: 375, positive conditional: 375, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 20, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 20, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 393, positive: 338, positive conditional: 338, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 423, Positive cache size: 397, Positive conditional cache size: 397, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 113.3ms, 68 PlacesBefore, 68 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1506 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 902 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 598, positive: 579, positive conditional: 579, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 117, positive: 116, positive conditional: 86, positive unconditional: 30, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 117, positive: 116, positive conditional: 86, positive unconditional: 30, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 117, positive: 116, positive conditional: 0, positive unconditional: 116, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 598, positive: 463, positive conditional: 463, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 117, unknown conditional: 117, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 540, Positive cache size: 513, Positive conditional cache size: 513, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 97.0ms, 76 PlacesBefore, 76 PlacesAfterwards, 88 TransitionsBefore, 85 TransitionsAfterwards, 1604 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 2079 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1002, positive: 964, positive conditional: 964, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 172, positive: 172, positive conditional: 160, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 172, positive: 172, positive conditional: 160, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 172, positive: 172, positive conditional: 0, positive unconditional: 172, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1002, positive: 792, positive conditional: 792, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 172, unknown conditional: 172, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 567, Positive cache size: 544, Positive conditional cache size: 544, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 58.7ms, 66 PlacesBefore, 66 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 1080 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 247 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 83, positive: 77, positive conditional: 77, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 6, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 6, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, positive: 68, positive conditional: 68, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 576, Positive cache size: 553, Positive conditional cache size: 553, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4101.3ms, 74 PlacesBefore, 70 PlacesAfterwards, 75 TransitionsBefore, 72 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 846 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 299, positive: 278, positive conditional: 278, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 24, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 24, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 299, positive: 251, positive conditional: 251, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 520, Positive cache size: 507, Positive conditional cache size: 507, Positive unconditional cache size: 0, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 73.0ms, 67 PlacesBefore, 67 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 894 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 520, Positive cache size: 507, Positive conditional cache size: 507, Positive unconditional cache size: 0, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 113.2ms, 69 PlacesBefore, 62 PlacesAfterwards, 46 TransitionsBefore, 44 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 83 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 61, positive: 60, positive conditional: 60, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 39, positive conditional: 33, positive unconditional: 6, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, positive: 39, positive conditional: 33, positive unconditional: 6, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 40, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 272, Positive conditional cache size: 272, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t1187; [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L822] 4 z = 2 [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L834] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L834] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L834] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L835] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L869] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L869] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L871] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L873] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L880] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L881] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L881] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L881] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L881] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L882] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L882] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L882] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L882] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L883] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L883] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L883] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L883] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L884] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L885] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L885] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L886] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L886] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 22456.3ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1914.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8125.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 55 SDtfs, 30 SDslu, 20 SDs, 0 SdLazy, 314 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 343.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 260.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=681occurred in iteration=10, InterpolantAutomatonStates: 69, 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: 44.4ms SsaConstructionTime, 416.3ms SatisfiabilityAnalysisTime, 682.0ms InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 1106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...