/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:09:44,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:09:44,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:09:44,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:09:44,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:09:44,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:09:44,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:09:44,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:09:44,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:09:44,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:09:44,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:09:44,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:09:44,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:09:44,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:09:44,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:09:44,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:09:44,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:09:44,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:09:44,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:09:44,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:09:44,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:09:44,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:09:44,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:09:44,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:09:44,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:09:44,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:09:44,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:09:44,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:09:44,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:09:44,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:09:44,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:09:44,227 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:09:44,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:09:44,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:09:44,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:09:44,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:09:44,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:09:44,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:09:44,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:09:44,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:09:44,231 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:09:44,236 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:09:44,273 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:09:44,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:09:44,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:09:44,276 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:09:44,276 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:09:44,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:09:44,276 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:09:44,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:09:44,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:09:44,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:09:44,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:09:44,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:09:44,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:09:44,278 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:09:44,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:09:44,278 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:09:44,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:09:44,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:09:44,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:09:44,279 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:09:44,279 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:09:44,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:09:44,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:09:44,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:09:44,280 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:09:44,280 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:09:44,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:09:44,280 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:09:44,280 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:09:44,280 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:09:44,280 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 10:09:44,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:09:44,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:09:44,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:09:44,628 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:09:44,629 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:09:44,630 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_power.opt.i [2021-03-26 10:09:44,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db71aa95/ed518bf35a6941e1bf9a7b4f52b0d746/FLAGf23c91a40 [2021-03-26 10:09:45,274 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:09:45,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_power.opt.i [2021-03-26 10:09:45,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db71aa95/ed518bf35a6941e1bf9a7b4f52b0d746/FLAGf23c91a40 [2021-03-26 10:09:45,685 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db71aa95/ed518bf35a6941e1bf9a7b4f52b0d746 [2021-03-26 10:09:45,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:09:45,688 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:09:45,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:09:45,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:09:45,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:09:45,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:09:45" (1/1) ... [2021-03-26 10:09:45,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b83a7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:45, skipping insertion in model container [2021-03-26 10:09:45,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:09:45" (1/1) ... [2021-03-26 10:09:45,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:09:45,766 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:09:45,960 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_power.opt.i[950,963] [2021-03-26 10:09:46,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:09:46,197 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:09:46,208 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_power.opt.i[950,963] [2021-03-26 10:09:46,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:09:46,350 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:09:46,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:46 WrapperNode [2021-03-26 10:09:46,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:09:46,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:09:46,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:09:46,354 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:09:46,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:46" (1/1) ... [2021-03-26 10:09:46,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:46" (1/1) ... [2021-03-26 10:09:46,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:09:46,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:09:46,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:09:46,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:09:46,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:46" (1/1) ... [2021-03-26 10:09:46,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:46" (1/1) ... [2021-03-26 10:09:46,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:46" (1/1) ... [2021-03-26 10:09:46,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:46" (1/1) ... [2021-03-26 10:09:46,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:46" (1/1) ... [2021-03-26 10:09:46,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:46" (1/1) ... [2021-03-26 10:09:46,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:46" (1/1) ... [2021-03-26 10:09:46,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:09:46,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:09:46,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:09:46,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:09:46,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:46" (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 10:09:46,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:09:46,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:09:46,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:09:46,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:09:46,565 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:09:46,565 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:09:46,566 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:09:46,566 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:09:46,566 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:09:46,566 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:09:46,566 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:09:46,566 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:09:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:09:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:09:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:09:46,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:09:46,569 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 10:09:48,194 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:09:48,194 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:09:48,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:09:48 BoogieIcfgContainer [2021-03-26 10:09:48,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:09:48,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:09:48,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:09:48,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:09:48,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:09:45" (1/3) ... [2021-03-26 10:09:48,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392ec4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:09:48, skipping insertion in model container [2021-03-26 10:09:48,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:09:46" (2/3) ... [2021-03-26 10:09:48,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392ec4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:09:48, skipping insertion in model container [2021-03-26 10:09:48,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:09:48" (3/3) ... [2021-03-26 10:09:48,202 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_power.opt.i [2021-03-26 10:09:48,207 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:09:48,211 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:09:48,211 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:09:48,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,239 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,239 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,239 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,239 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,240 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,240 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,241 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,241 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,242 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,242 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,242 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,242 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,245 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,245 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,245 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,246 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,246 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,246 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,246 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,246 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,247 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,247 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,247 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,247 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,247 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,247 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,247 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,247 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,248 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,248 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,248 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,248 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,248 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,248 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,248 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,248 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,249 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,249 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,249 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,249 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,249 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,249 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,251 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,251 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,253 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,253 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,254 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,255 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,256 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,256 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,257 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,258 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:09:48,259 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:09:48,274 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 10:09:48,290 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:09:48,291 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:09:48,291 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:09:48,291 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:09:48,291 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:09:48,291 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:09:48,291 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:09:48,291 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:09:48,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-26 10:09:48,336 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 10:09:48,336 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:09:48,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 10:09:48,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-26 10:09:48,343 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-26 10:09:48,344 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:09:48,355 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-26 10:09:48,357 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-26 10:09:48,359 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-26 10:09:48,379 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 10:09:48,379 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:09:48,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 10:09:48,383 INFO L142 LiptonReduction]: Number of co-enabled transitions 2598 [2021-03-26 10:09:49,862 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:09:50,309 WARN L205 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 10:09:50,436 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:09:51,191 WARN L205 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-26 10:09:51,871 WARN L205 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-03-26 10:09:53,254 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-26 10:09:53,895 WARN L205 SmtUtils]: Spent 639.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:09:55,239 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 10:09:55,514 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 10:09:56,723 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 269 DAG size of output: 268 [2021-03-26 10:09:57,315 WARN L205 SmtUtils]: Spent 590.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:09:57,516 INFO L154 LiptonReduction]: Checked pairs total: 4166 [2021-03-26 10:09:57,516 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-26 10:09:57,518 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9175 [2021-03-26 10:09:57,529 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-26 10:09:57,529 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:09:57,529 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:09:57,530 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 10:09:57,530 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:09:57,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:09:57,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1459371111, now seen corresponding path program 1 times [2021-03-26 10:09:57,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:09:57,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481023019] [2021-03-26 10:09:57,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:09:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:09:57,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:57,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:09:57,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:09:57,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:09:57,741 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 10:09:57,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481023019] [2021-03-26 10:09:57,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:09:57,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:09:57,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760200711] [2021-03-26 10:09:57,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:09:57,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:09:57,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:09:57,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:09:57,762 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 191 [2021-03-26 10:09:57,765 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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 10:09:57,765 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:09:57,765 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 191 [2021-03-26 10:09:57,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:09:57,838 INFO L129 PetriNetUnfolder]: 23/111 cut-off events. [2021-03-26 10:09:57,838 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:09:57,839 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 111 events. 23/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 394 event pairs, 3 based on Foata normal form. 6/110 useless extension candidates. Maximal degree in co-relation 148. Up to 37 conditions per place. [2021-03-26 10:09:57,841 INFO L132 encePairwiseOnDemand]: 187/191 looper letters, 7 selfloop transitions, 2 changer transitions 5/49 dead transitions. [2021-03-26 10:09:57,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 132 flow [2021-03-26 10:09:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:09:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:09:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2021-03-26 10:09:57,854 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9144851657940664 [2021-03-26 10:09:57,854 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2021-03-26 10:09:57,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2021-03-26 10:09:57,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:09:57,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2021-03-26 10:09:57,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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 10:09:57,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:57,872 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:09:57,873 INFO L185 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 3 states and 524 transitions. [2021-03-26 10:09:57,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 132 flow [2021-03-26 10:09:57,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:09:57,878 INFO L241 Difference]: Finished difference. Result has 56 places, 41 transitions, 94 flow [2021-03-26 10:09:57,880 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2021-03-26 10:09:57,881 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2021-03-26 10:09:57,881 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:09:57,881 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 41 transitions, 94 flow [2021-03-26 10:09:57,882 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 41 transitions, 94 flow [2021-03-26 10:09:57,883 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 94 flow [2021-03-26 10:09:57,889 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-26 10:09:57,889 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:09:57,890 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 4. Compared 38 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:09:57,890 INFO L142 LiptonReduction]: Number of co-enabled transitions 392 [2021-03-26 10:09:58,286 WARN L205 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-26 10:09:58,643 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-26 10:09:59,927 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 270 DAG size of output: 269 [2021-03-26 10:10:00,536 WARN L205 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 10:10:01,718 INFO L154 LiptonReduction]: Checked pairs total: 1274 [2021-03-26 10:10:01,718 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 10:10:01,725 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3844 [2021-03-26 10:10:01,726 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-26 10:10:01,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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 10:10:01,727 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:01,727 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 10:10:01,727 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:10:01,727 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:01,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:01,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1826671133, now seen corresponding path program 1 times [2021-03-26 10:10:01,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:01,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189870632] [2021-03-26 10:10:01,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:01,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:01,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:01,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:01,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:01,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:01,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:10:01,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:01,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:01,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:01,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:01,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:01,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:01,948 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:10:01,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:10:01,953 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 10:10:01,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189870632] [2021-03-26 10:10:01,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:01,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:10:01,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916712275] [2021-03-26 10:10:01,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:10:01,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:01,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:10:01,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:10:01,958 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 203 [2021-03-26 10:10:01,959 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states 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 10:10:01,959 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:01,959 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 203 [2021-03-26 10:10:01,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:02,025 INFO L129 PetriNetUnfolder]: 24/81 cut-off events. [2021-03-26 10:10:02,025 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-26 10:10:02,027 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 81 events. 24/81 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 231 event pairs, 16 based on Foata normal form. 2/82 useless extension candidates. Maximal degree in co-relation 138. Up to 45 conditions per place. [2021-03-26 10:10:02,028 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 8 selfloop transitions, 7 changer transitions 0/35 dead transitions. [2021-03-26 10:10:02,028 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 114 flow [2021-03-26 10:10:02,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:02,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 822 transitions. [2021-03-26 10:10:02,033 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8098522167487685 [2021-03-26 10:10:02,033 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 822 transitions. [2021-03-26 10:10:02,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 822 transitions. [2021-03-26 10:10:02,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:02,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 822 transitions. [2021-03-26 10:10:02,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.4) internal successors, (822), 5 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:02,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states 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 10:10:02,039 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states 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 10:10:02,039 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 5 states and 822 transitions. [2021-03-26 10:10:02,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 114 flow [2021-03-26 10:10:02,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:02,041 INFO L241 Difference]: Finished difference. Result has 44 places, 33 transitions, 106 flow [2021-03-26 10:10:02,041 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, 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=5, PETRI_FLOW=106, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2021-03-26 10:10:02,042 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -16 predicate places. [2021-03-26 10:10:02,042 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:02,042 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 106 flow [2021-03-26 10:10:02,042 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 106 flow [2021-03-26 10:10:02,043 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 106 flow [2021-03-26 10:10:02,051 INFO L129 PetriNetUnfolder]: 4/42 cut-off events. [2021-03-26 10:10:02,051 INFO L130 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2021-03-26 10:10:02,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 42 events. 4/42 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 1 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 64. Up to 10 conditions per place. [2021-03-26 10:10:02,052 INFO L142 LiptonReduction]: Number of co-enabled transitions 398 [2021-03-26 10:10:02,583 INFO L154 LiptonReduction]: Checked pairs total: 1098 [2021-03-26 10:10:02,583 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:10:02,584 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 542 [2021-03-26 10:10:02,584 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 100 flow [2021-03-26 10:10:02,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states 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 10:10:02,585 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:02,585 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:02,586 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:10:02,586 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:02,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:02,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1746384294, now seen corresponding path program 1 times [2021-03-26 10:10:02,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:02,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929093840] [2021-03-26 10:10:02,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:02,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:02,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:02,734 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 10:10:02,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929093840] [2021-03-26 10:10:02,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:02,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:10:02,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526677303] [2021-03-26 10:10:02,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:10:02,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:02,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:10:02,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:10:02,737 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 205 [2021-03-26 10:10:02,738 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states 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 10:10:02,738 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:02,738 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 205 [2021-03-26 10:10:02,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:02,751 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-26 10:10:02,751 INFO L130 PetriNetUnfolder]: For 15/18 co-relation queries the response was YES. [2021-03-26 10:10:02,752 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 37 events. 3/37 cut-off events. For 15/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 1 based on Foata normal form. 2/38 useless extension candidates. Maximal degree in co-relation 63. Up to 9 conditions per place. [2021-03-26 10:10:02,752 INFO L132 encePairwiseOnDemand]: 202/205 looper letters, 1 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2021-03-26 10:10:02,752 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 108 flow [2021-03-26 10:10:02,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:02,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2021-03-26 10:10:02,754 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9040650406504065 [2021-03-26 10:10:02,754 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2021-03-26 10:10:02,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2021-03-26 10:10:02,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:02,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2021-03-26 10:10:02,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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 10:10:02,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states 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 10:10:02,758 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states 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 10:10:02,758 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 100 flow. Second operand 3 states and 556 transitions. [2021-03-26 10:10:02,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 108 flow [2021-03-26 10:10:02,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 31 transitions, 108 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:10:02,760 INFO L241 Difference]: Finished difference. Result has 44 places, 31 transitions, 111 flow [2021-03-26 10:10:02,760 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2021-03-26 10:10:02,760 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -16 predicate places. [2021-03-26 10:10:02,760 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:02,760 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 31 transitions, 111 flow [2021-03-26 10:10:02,761 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 31 transitions, 111 flow [2021-03-26 10:10:02,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 31 transitions, 111 flow [2021-03-26 10:10:02,766 INFO L129 PetriNetUnfolder]: 3/38 cut-off events. [2021-03-26 10:10:02,766 INFO L130 PetriNetUnfolder]: For 14/16 co-relation queries the response was YES. [2021-03-26 10:10:02,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 38 events. 3/38 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 1 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 66. Up to 9 conditions per place. [2021-03-26 10:10:02,767 INFO L142 LiptonReduction]: Number of co-enabled transitions 398 [2021-03-26 10:10:03,110 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-26 10:10:03,287 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 10:10:03,582 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-26 10:10:03,720 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 10:10:03,727 INFO L154 LiptonReduction]: Checked pairs total: 768 [2021-03-26 10:10:03,727 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:10:03,728 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 968 [2021-03-26 10:10:03,729 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 107 flow [2021-03-26 10:10:03,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states 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 10:10:03,729 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:03,729 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:03,729 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:10:03,730 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:03,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:03,730 INFO L82 PathProgramCache]: Analyzing trace with hash 313342461, now seen corresponding path program 1 times [2021-03-26 10:10:03,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:03,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915044980] [2021-03-26 10:10:03,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:03,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:03,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:03,834 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 10:10:03,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915044980] [2021-03-26 10:10:03,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:03,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:10:03,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613835350] [2021-03-26 10:10:03,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:10:03,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:03,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:10:03,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:10:03,837 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 206 [2021-03-26 10:10:03,837 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states 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 10:10:03,837 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:03,837 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 206 [2021-03-26 10:10:03,838 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:03,857 INFO L129 PetriNetUnfolder]: 9/56 cut-off events. [2021-03-26 10:10:03,857 INFO L130 PetriNetUnfolder]: For 84/92 co-relation queries the response was YES. [2021-03-26 10:10:03,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 56 events. 9/56 cut-off events. For 84/92 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 165 event pairs, 4 based on Foata normal form. 5/54 useless extension candidates. Maximal degree in co-relation 121. Up to 18 conditions per place. [2021-03-26 10:10:03,859 INFO L132 encePairwiseOnDemand]: 202/206 looper letters, 3 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2021-03-26 10:10:03,859 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 32 transitions, 123 flow [2021-03-26 10:10:03,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:03,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2021-03-26 10:10:03,861 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9093851132686084 [2021-03-26 10:10:03,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2021-03-26 10:10:03,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2021-03-26 10:10:03,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:03,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2021-03-26 10:10:03,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states 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 10:10:03,865 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 10:10:03,865 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 10:10:03,865 INFO L185 Difference]: Start difference. First operand has 43 places, 30 transitions, 107 flow. Second operand 3 states and 562 transitions. [2021-03-26 10:10:03,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 32 transitions, 123 flow [2021-03-26 10:10:03,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 32 transitions, 113 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:03,868 INFO L241 Difference]: Finished difference. Result has 44 places, 32 transitions, 116 flow [2021-03-26 10:10:03,868 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=116, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2021-03-26 10:10:03,868 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -16 predicate places. [2021-03-26 10:10:03,868 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:03,869 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 32 transitions, 116 flow [2021-03-26 10:10:03,869 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 32 transitions, 116 flow [2021-03-26 10:10:03,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 32 transitions, 116 flow [2021-03-26 10:10:03,878 INFO L129 PetriNetUnfolder]: 9/54 cut-off events. [2021-03-26 10:10:03,878 INFO L130 PetriNetUnfolder]: For 34/37 co-relation queries the response was YES. [2021-03-26 10:10:03,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 54 events. 9/54 cut-off events. For 34/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 163 event pairs, 4 based on Foata normal form. 1/48 useless extension candidates. Maximal degree in co-relation 110. Up to 18 conditions per place. [2021-03-26 10:10:03,880 INFO L142 LiptonReduction]: Number of co-enabled transitions 468 [2021-03-26 10:10:03,883 INFO L154 LiptonReduction]: Checked pairs total: 333 [2021-03-26 10:10:03,883 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:03,883 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-26 10:10:03,888 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 116 flow [2021-03-26 10:10:03,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states 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 10:10:03,888 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:03,888 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:03,889 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:10:03,889 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:03,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:03,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1471815535, now seen corresponding path program 1 times [2021-03-26 10:10:03,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:03,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846235767] [2021-03-26 10:10:03,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:04,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:04,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:10:04,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:04,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:04,036 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 10:10:04,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 10:10:04,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:04,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:04,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846235767] [2021-03-26 10:10:04,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:04,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:04,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929311757] [2021-03-26 10:10:04,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:04,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:04,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:04,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:04,063 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 206 [2021-03-26 10:10:04,064 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 states 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 10:10:04,064 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:04,064 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 206 [2021-03-26 10:10:04,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:04,151 INFO L129 PetriNetUnfolder]: 41/116 cut-off events. [2021-03-26 10:10:04,151 INFO L130 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2021-03-26 10:10:04,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 116 events. 41/116 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 388 event pairs, 11 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 288. Up to 55 conditions per place. [2021-03-26 10:10:04,153 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 10 selfloop transitions, 9 changer transitions 0/40 dead transitions. [2021-03-26 10:10:04,153 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 175 flow [2021-03-26 10:10:04,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 847 transitions. [2021-03-26 10:10:04,156 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8223300970873786 [2021-03-26 10:10:04,156 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 847 transitions. [2021-03-26 10:10:04,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 847 transitions. [2021-03-26 10:10:04,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:04,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 847 transitions. [2021-03-26 10:10:04,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 169.4) internal successors, (847), 5 states have internal predecessors, (847), 0 states have call successors, (0), 0 states 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 10:10:04,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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 10:10:04,161 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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 10:10:04,161 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 116 flow. Second operand 5 states and 847 transitions. [2021-03-26 10:10:04,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 175 flow [2021-03-26 10:10:04,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 40 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:10:04,163 INFO L241 Difference]: Finished difference. Result has 49 places, 37 transitions, 163 flow [2021-03-26 10:10:04,164 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2021-03-26 10:10:04,164 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -11 predicate places. [2021-03-26 10:10:04,164 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:04,164 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 37 transitions, 163 flow [2021-03-26 10:10:04,165 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 37 transitions, 163 flow [2021-03-26 10:10:04,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 37 transitions, 163 flow [2021-03-26 10:10:04,179 INFO L129 PetriNetUnfolder]: 33/108 cut-off events. [2021-03-26 10:10:04,179 INFO L130 PetriNetUnfolder]: For 141/145 co-relation queries the response was YES. [2021-03-26 10:10:04,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 108 events. 33/108 cut-off events. For 141/145 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 418 event pairs, 12 based on Foata normal form. 2/95 useless extension candidates. Maximal degree in co-relation 281. Up to 39 conditions per place. [2021-03-26 10:10:04,182 INFO L142 LiptonReduction]: Number of co-enabled transitions 562 [2021-03-26 10:10:04,192 INFO L154 LiptonReduction]: Checked pairs total: 371 [2021-03-26 10:10:04,193 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:04,193 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29 [2021-03-26 10:10:04,195 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 163 flow [2021-03-26 10:10:04,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 states 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 10:10:04,197 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:04,197 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:04,197 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:10:04,198 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:04,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:04,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1114959717, now seen corresponding path program 2 times [2021-03-26 10:10:04,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:04,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632152205] [2021-03-26 10:10:04,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:04,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:04,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:04,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:04,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:04,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:04,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:10:04,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:04,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:04,327 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 10:10:04,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632152205] [2021-03-26 10:10:04,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:04,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:10:04,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511451749] [2021-03-26 10:10:04,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:10:04,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:04,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:10:04,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:10:04,334 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 206 [2021-03-26 10:10:04,335 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states 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 10:10:04,335 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:04,335 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 206 [2021-03-26 10:10:04,335 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:04,425 INFO L129 PetriNetUnfolder]: 42/123 cut-off events. [2021-03-26 10:10:04,425 INFO L130 PetriNetUnfolder]: For 157/159 co-relation queries the response was YES. [2021-03-26 10:10:04,426 INFO L84 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 123 events. 42/123 cut-off events. For 157/159 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 445 event pairs, 8 based on Foata normal form. 3/115 useless extension candidates. Maximal degree in co-relation 374. Up to 56 conditions per place. [2021-03-26 10:10:04,427 INFO L132 encePairwiseOnDemand]: 200/206 looper letters, 10 selfloop transitions, 12 changer transitions 0/43 dead transitions. [2021-03-26 10:10:04,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 240 flow [2021-03-26 10:10:04,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 846 transitions. [2021-03-26 10:10:04,431 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8213592233009709 [2021-03-26 10:10:04,431 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 846 transitions. [2021-03-26 10:10:04,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 846 transitions. [2021-03-26 10:10:04,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:04,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 846 transitions. [2021-03-26 10:10:04,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 169.2) internal successors, (846), 5 states have internal predecessors, (846), 0 states have call successors, (0), 0 states 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 10:10:04,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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 10:10:04,435 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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 10:10:04,435 INFO L185 Difference]: Start difference. First operand has 49 places, 37 transitions, 163 flow. Second operand 5 states and 846 transitions. [2021-03-26 10:10:04,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 240 flow [2021-03-26 10:10:04,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 43 transitions, 230 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 10:10:04,440 INFO L241 Difference]: Finished difference. Result has 53 places, 41 transitions, 214 flow [2021-03-26 10:10:04,440 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2021-03-26 10:10:04,440 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2021-03-26 10:10:04,440 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:04,440 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 41 transitions, 214 flow [2021-03-26 10:10:04,441 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 41 transitions, 214 flow [2021-03-26 10:10:04,441 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 41 transitions, 214 flow [2021-03-26 10:10:04,457 INFO L129 PetriNetUnfolder]: 32/108 cut-off events. [2021-03-26 10:10:04,457 INFO L130 PetriNetUnfolder]: For 205/210 co-relation queries the response was YES. [2021-03-26 10:10:04,458 INFO L84 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 108 events. 32/108 cut-off events. For 205/210 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 389 event pairs, 8 based on Foata normal form. 3/98 useless extension candidates. Maximal degree in co-relation 314. Up to 38 conditions per place. [2021-03-26 10:10:04,460 INFO L142 LiptonReduction]: Number of co-enabled transitions 626 [2021-03-26 10:10:04,664 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:10:05,069 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2021-03-26 10:10:05,219 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-03-26 10:10:05,230 INFO L154 LiptonReduction]: Checked pairs total: 888 [2021-03-26 10:10:05,230 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:10:05,231 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 791 [2021-03-26 10:10:05,231 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 218 flow [2021-03-26 10:10:05,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states 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 10:10:05,232 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:05,232 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:05,232 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:10:05,232 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:05,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:05,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1500589797, now seen corresponding path program 3 times [2021-03-26 10:10:05,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:05,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448598778] [2021-03-26 10:10:05,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:05,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:05,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:05,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:05,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:05,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:05,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:10:05,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:05,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:05,296 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 10:10:05,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448598778] [2021-03-26 10:10:05,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:05,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:05,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548515148] [2021-03-26 10:10:05,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:05,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:05,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:05,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:05,299 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 207 [2021-03-26 10:10:05,300 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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 10:10:05,300 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:05,300 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 207 [2021-03-26 10:10:05,300 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:05,358 INFO L129 PetriNetUnfolder]: 37/117 cut-off events. [2021-03-26 10:10:05,359 INFO L130 PetriNetUnfolder]: For 278/284 co-relation queries the response was YES. [2021-03-26 10:10:05,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 117 events. 37/117 cut-off events. For 278/284 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 441 event pairs, 12 based on Foata normal form. 4/109 useless extension candidates. Maximal degree in co-relation 396. Up to 51 conditions per place. [2021-03-26 10:10:05,361 INFO L132 encePairwiseOnDemand]: 202/207 looper letters, 12 selfloop transitions, 11 changer transitions 0/44 dead transitions. [2021-03-26 10:10:05,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 44 transitions, 284 flow [2021-03-26 10:10:05,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:10:05,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:10:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 697 transitions. [2021-03-26 10:10:05,364 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8417874396135265 [2021-03-26 10:10:05,364 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 697 transitions. [2021-03-26 10:10:05,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 697 transitions. [2021-03-26 10:10:05,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:05,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 697 transitions. [2021-03-26 10:10:05,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:05,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:05,368 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:05,368 INFO L185 Difference]: Start difference. First operand has 53 places, 41 transitions, 218 flow. Second operand 4 states and 697 transitions. [2021-03-26 10:10:05,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 44 transitions, 284 flow [2021-03-26 10:10:05,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 44 transitions, 274 flow, removed 5 selfloop flow, removed 0 redundant places. [2021-03-26 10:10:05,373 INFO L241 Difference]: Finished difference. Result has 57 places, 43 transitions, 262 flow [2021-03-26 10:10:05,373 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2021-03-26 10:10:05,373 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2021-03-26 10:10:05,374 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:05,374 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 43 transitions, 262 flow [2021-03-26 10:10:05,374 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 43 transitions, 262 flow [2021-03-26 10:10:05,374 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 43 transitions, 262 flow [2021-03-26 10:10:05,392 INFO L129 PetriNetUnfolder]: 29/103 cut-off events. [2021-03-26 10:10:05,392 INFO L130 PetriNetUnfolder]: For 280/285 co-relation queries the response was YES. [2021-03-26 10:10:05,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 103 events. 29/103 cut-off events. For 280/285 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 371 event pairs, 8 based on Foata normal form. 3/94 useless extension candidates. Maximal degree in co-relation 345. Up to 35 conditions per place. [2021-03-26 10:10:05,394 INFO L142 LiptonReduction]: Number of co-enabled transitions 668 [2021-03-26 10:10:05,399 INFO L154 LiptonReduction]: Checked pairs total: 496 [2021-03-26 10:10:05,399 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:05,400 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-03-26 10:10:05,400 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 262 flow [2021-03-26 10:10:05,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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 10:10:05,401 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:05,401 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:05,401 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:10:05,401 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:05,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:05,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1452551329, now seen corresponding path program 1 times [2021-03-26 10:10:05,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:05,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124940150] [2021-03-26 10:10:05,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:05,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:05,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:05,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:05,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:05,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:05,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:10:05,492 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-03-26 10:10:05,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 10:10:05,512 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 10:10:05,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124940150] [2021-03-26 10:10:05,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:05,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:05,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840131227] [2021-03-26 10:10:05,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:05,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:05,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:05,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:05,514 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 207 [2021-03-26 10:10:05,515 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 262 flow. Second operand has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 states 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 10:10:05,515 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:05,515 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 207 [2021-03-26 10:10:05,515 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:05,591 INFO L129 PetriNetUnfolder]: 38/122 cut-off events. [2021-03-26 10:10:05,591 INFO L130 PetriNetUnfolder]: For 320/326 co-relation queries the response was YES. [2021-03-26 10:10:05,592 INFO L84 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 122 events. 38/122 cut-off events. For 320/326 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 474 event pairs, 5 based on Foata normal form. 1/113 useless extension candidates. Maximal degree in co-relation 464. Up to 48 conditions per place. [2021-03-26 10:10:05,595 INFO L132 encePairwiseOnDemand]: 202/207 looper letters, 13 selfloop transitions, 13 changer transitions 0/47 dead transitions. [2021-03-26 10:10:05,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 47 transitions, 343 flow [2021-03-26 10:10:05,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:10:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:10:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 664 transitions. [2021-03-26 10:10:05,598 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8019323671497585 [2021-03-26 10:10:05,598 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 664 transitions. [2021-03-26 10:10:05,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 664 transitions. [2021-03-26 10:10:05,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:05,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 664 transitions. [2021-03-26 10:10:05,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 10:10:05,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:05,603 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:05,603 INFO L185 Difference]: Start difference. First operand has 57 places, 43 transitions, 262 flow. Second operand 4 states and 664 transitions. [2021-03-26 10:10:05,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 47 transitions, 343 flow [2021-03-26 10:10:05,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 47 transitions, 314 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:05,606 INFO L241 Difference]: Finished difference. Result has 59 places, 45 transitions, 298 flow [2021-03-26 10:10:05,607 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2021-03-26 10:10:05,607 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2021-03-26 10:10:05,607 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:05,607 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 45 transitions, 298 flow [2021-03-26 10:10:05,607 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 45 transitions, 298 flow [2021-03-26 10:10:05,608 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 45 transitions, 298 flow [2021-03-26 10:10:05,622 INFO L129 PetriNetUnfolder]: 29/106 cut-off events. [2021-03-26 10:10:05,622 INFO L130 PetriNetUnfolder]: For 254/257 co-relation queries the response was YES. [2021-03-26 10:10:05,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 106 events. 29/106 cut-off events. For 254/257 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 400 event pairs, 7 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 349. Up to 36 conditions per place. [2021-03-26 10:10:05,625 INFO L142 LiptonReduction]: Number of co-enabled transitions 712 [2021-03-26 10:10:05,630 INFO L154 LiptonReduction]: Checked pairs total: 614 [2021-03-26 10:10:05,630 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:05,630 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-03-26 10:10:05,631 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 298 flow [2021-03-26 10:10:05,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 states 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 10:10:05,631 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:05,631 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:05,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:10:05,632 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:05,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:05,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1499289564, now seen corresponding path program 1 times [2021-03-26 10:10:05,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:05,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31569538] [2021-03-26 10:10:05,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:05,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:05,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:05,700 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:10:05,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:10:05,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:05,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:05,706 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 10:10:05,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31569538] [2021-03-26 10:10:05,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:05,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:05,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504955101] [2021-03-26 10:10:05,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:10:05,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:05,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:10:05,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:10:05,708 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 207 [2021-03-26 10:10:05,709 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 states 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 10:10:05,709 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:05,709 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 207 [2021-03-26 10:10:05,709 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:05,830 INFO L129 PetriNetUnfolder]: 376/701 cut-off events. [2021-03-26 10:10:05,830 INFO L130 PetriNetUnfolder]: For 973/1022 co-relation queries the response was YES. [2021-03-26 10:10:05,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 701 events. 376/701 cut-off events. For 973/1022 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 4448 event pairs, 161 based on Foata normal form. 55/594 useless extension candidates. Maximal degree in co-relation 1941. Up to 415 conditions per place. [2021-03-26 10:10:05,840 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 13 selfloop transitions, 10 changer transitions 0/59 dead transitions. [2021-03-26 10:10:05,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 59 transitions, 372 flow [2021-03-26 10:10:05,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:05,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 884 transitions. [2021-03-26 10:10:05,843 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8541062801932368 [2021-03-26 10:10:05,843 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 884 transitions. [2021-03-26 10:10:05,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 884 transitions. [2021-03-26 10:10:05,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:05,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 884 transitions. [2021-03-26 10:10:05,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states 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 10:10:05,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states 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 10:10:05,847 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states 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 10:10:05,847 INFO L185 Difference]: Start difference. First operand has 59 places, 45 transitions, 298 flow. Second operand 5 states and 884 transitions. [2021-03-26 10:10:05,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 59 transitions, 372 flow [2021-03-26 10:10:05,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 352 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:05,851 INFO L241 Difference]: Finished difference. Result has 64 places, 54 transitions, 357 flow [2021-03-26 10:10:05,852 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=357, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2021-03-26 10:10:05,852 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2021-03-26 10:10:05,852 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:05,852 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 54 transitions, 357 flow [2021-03-26 10:10:05,852 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 54 transitions, 357 flow [2021-03-26 10:10:05,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 54 transitions, 357 flow [2021-03-26 10:10:05,933 INFO L129 PetriNetUnfolder]: 323/614 cut-off events. [2021-03-26 10:10:05,933 INFO L130 PetriNetUnfolder]: For 1131/1347 co-relation queries the response was YES. [2021-03-26 10:10:05,938 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 614 events. 323/614 cut-off events. For 1131/1347 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 3844 event pairs, 130 based on Foata normal form. 28/538 useless extension candidates. Maximal degree in co-relation 2090. Up to 331 conditions per place. [2021-03-26 10:10:05,945 INFO L142 LiptonReduction]: Number of co-enabled transitions 976 [2021-03-26 10:10:05,958 INFO L154 LiptonReduction]: Checked pairs total: 442 [2021-03-26 10:10:05,958 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:05,958 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 106 [2021-03-26 10:10:05,959 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 357 flow [2021-03-26 10:10:05,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 states 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 10:10:05,960 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:05,960 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:05,960 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:10:05,960 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:05,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:05,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1755769010, now seen corresponding path program 1 times [2021-03-26 10:10:05,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:05,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063587808] [2021-03-26 10:10:05,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:06,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:06,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:06,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:06,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:06,039 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:10:06,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:10:06,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:06,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:06,047 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 10:10:06,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063587808] [2021-03-26 10:10:06,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:06,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:10:06,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369033369] [2021-03-26 10:10:06,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:06,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:06,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:06,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:06,049 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 207 [2021-03-26 10:10:06,050 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 357 flow. Second operand has 5 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 0 states 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 10:10:06,050 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:06,050 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 207 [2021-03-26 10:10:06,050 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:06,181 INFO L129 PetriNetUnfolder]: 287/567 cut-off events. [2021-03-26 10:10:06,181 INFO L130 PetriNetUnfolder]: For 1010/1816 co-relation queries the response was YES. [2021-03-26 10:10:06,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2175 conditions, 567 events. 287/567 cut-off events. For 1010/1816 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 3370 event pairs, 34 based on Foata normal form. 91/562 useless extension candidates. Maximal degree in co-relation 2148. Up to 365 conditions per place. [2021-03-26 10:10:06,188 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 14 selfloop transitions, 19 changer transitions 0/69 dead transitions. [2021-03-26 10:10:06,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 503 flow [2021-03-26 10:10:06,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:10:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:10:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1238 transitions. [2021-03-26 10:10:06,192 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8543823326432022 [2021-03-26 10:10:06,192 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1238 transitions. [2021-03-26 10:10:06,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1238 transitions. [2021-03-26 10:10:06,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:06,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1238 transitions. [2021-03-26 10:10:06,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 176.85714285714286) internal successors, (1238), 7 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states 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 10:10:06,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states 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 10:10:06,199 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states 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 10:10:06,199 INFO L185 Difference]: Start difference. First operand has 64 places, 54 transitions, 357 flow. Second operand 7 states and 1238 transitions. [2021-03-26 10:10:06,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 503 flow [2021-03-26 10:10:06,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 498 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:10:06,204 INFO L241 Difference]: Finished difference. Result has 72 places, 63 transitions, 490 flow [2021-03-26 10:10:06,204 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=490, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2021-03-26 10:10:06,205 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 12 predicate places. [2021-03-26 10:10:06,205 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:06,205 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 63 transitions, 490 flow [2021-03-26 10:10:06,205 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 63 transitions, 490 flow [2021-03-26 10:10:06,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 63 transitions, 490 flow [2021-03-26 10:10:06,305 INFO L129 PetriNetUnfolder]: 221/458 cut-off events. [2021-03-26 10:10:06,305 INFO L130 PetriNetUnfolder]: For 1478/2167 co-relation queries the response was YES. [2021-03-26 10:10:06,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2114 conditions, 458 events. 221/458 cut-off events. For 1478/2167 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2770 event pairs, 33 based on Foata normal form. 14/398 useless extension candidates. Maximal degree in co-relation 2085. Up to 294 conditions per place. [2021-03-26 10:10:06,314 INFO L142 LiptonReduction]: Number of co-enabled transitions 1180 [2021-03-26 10:10:06,322 INFO L154 LiptonReduction]: Checked pairs total: 605 [2021-03-26 10:10:06,322 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:06,322 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 117 [2021-03-26 10:10:06,324 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 490 flow [2021-03-26 10:10:06,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 0 states 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 10:10:06,324 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:06,324 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:06,324 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:10:06,325 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:06,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:06,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2061661944, now seen corresponding path program 1 times [2021-03-26 10:10:06,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:06,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295774925] [2021-03-26 10:10:06,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:06,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:06,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:06,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:06,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:06,393 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-26 10:10:06,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:10:06,407 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-26 10:10:06,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:10:06,429 INFO L142 QuantifierPusher]: treesize reduction 14, result has 39.1 percent of original size [2021-03-26 10:10:06,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:10:06,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:06,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:10:06,443 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 10:10:06,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295774925] [2021-03-26 10:10:06,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:06,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:10:06,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816964785] [2021-03-26 10:10:06,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:10:06,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:06,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:10:06,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:10:06,446 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 207 [2021-03-26 10:10:06,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 490 flow. Second operand has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states 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 10:10:06,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:06,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 207 [2021-03-26 10:10:06,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:06,761 INFO L129 PetriNetUnfolder]: 732/1513 cut-off events. [2021-03-26 10:10:06,761 INFO L130 PetriNetUnfolder]: For 6332/7903 co-relation queries the response was YES. [2021-03-26 10:10:06,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7174 conditions, 1513 events. 732/1513 cut-off events. For 6332/7903 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 11775 event pairs, 71 based on Foata normal form. 130/1509 useless extension candidates. Maximal degree in co-relation 7143. Up to 967 conditions per place. [2021-03-26 10:10:06,779 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 43 selfloop transitions, 19 changer transitions 2/104 dead transitions. [2021-03-26 10:10:06,780 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 104 transitions, 1012 flow [2021-03-26 10:10:06,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:10:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:10:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1177 transitions. [2021-03-26 10:10:06,783 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8122843340234644 [2021-03-26 10:10:06,783 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1177 transitions. [2021-03-26 10:10:06,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1177 transitions. [2021-03-26 10:10:06,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:06,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1177 transitions. [2021-03-26 10:10:06,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 168.14285714285714) internal successors, (1177), 7 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states 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 10:10:06,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states 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 10:10:06,789 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states 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 10:10:06,789 INFO L185 Difference]: Start difference. First operand has 72 places, 63 transitions, 490 flow. Second operand 7 states and 1177 transitions. [2021-03-26 10:10:06,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 104 transitions, 1012 flow [2021-03-26 10:10:06,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 104 transitions, 962 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-26 10:10:06,825 INFO L241 Difference]: Finished difference. Result has 80 places, 77 transitions, 685 flow [2021-03-26 10:10:06,825 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=685, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2021-03-26 10:10:06,826 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 20 predicate places. [2021-03-26 10:10:06,826 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:06,826 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 77 transitions, 685 flow [2021-03-26 10:10:06,826 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 77 transitions, 685 flow [2021-03-26 10:10:06,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 77 transitions, 685 flow [2021-03-26 10:10:06,973 INFO L129 PetriNetUnfolder]: 638/1278 cut-off events. [2021-03-26 10:10:06,973 INFO L130 PetriNetUnfolder]: For 6401/6936 co-relation queries the response was YES. [2021-03-26 10:10:06,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5637 conditions, 1278 events. 638/1278 cut-off events. For 6401/6936 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 9368 event pairs, 88 based on Foata normal form. 56/1140 useless extension candidates. Maximal degree in co-relation 5604. Up to 766 conditions per place. [2021-03-26 10:10:06,997 INFO L142 LiptonReduction]: Number of co-enabled transitions 1614 [2021-03-26 10:10:07,191 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:10:07,638 WARN L205 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:10:07,817 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:10:07,877 INFO L154 LiptonReduction]: Checked pairs total: 968 [2021-03-26 10:10:07,878 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:10:07,878 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1052 [2021-03-26 10:10:07,881 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 77 transitions, 687 flow [2021-03-26 10:10:07,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states 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 10:10:07,881 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:07,881 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:07,881 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:10:07,882 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:07,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:07,882 INFO L82 PathProgramCache]: Analyzing trace with hash 688805962, now seen corresponding path program 2 times [2021-03-26 10:10:07,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:07,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614127349] [2021-03-26 10:10:07,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:07,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:07,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:07,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:07,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:07,934 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 10:10:07,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614127349] [2021-03-26 10:10:07,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:07,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:10:07,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985656876] [2021-03-26 10:10:07,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:10:07,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:07,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:10:07,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:10:07,936 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 208 [2021-03-26 10:10:07,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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 10:10:07,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:07,937 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 208 [2021-03-26 10:10:07,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:08,228 INFO L129 PetriNetUnfolder]: 1007/1932 cut-off events. [2021-03-26 10:10:08,228 INFO L130 PetriNetUnfolder]: For 10567/11434 co-relation queries the response was YES. [2021-03-26 10:10:08,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8779 conditions, 1932 events. 1007/1932 cut-off events. For 10567/11434 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 15052 event pairs, 169 based on Foata normal form. 104/1748 useless extension candidates. Maximal degree in co-relation 8744. Up to 1250 conditions per place. [2021-03-26 10:10:08,250 INFO L132 encePairwiseOnDemand]: 205/208 looper letters, 3 selfloop transitions, 3 changer transitions 2/77 dead transitions. [2021-03-26 10:10:08,251 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 77 transitions, 699 flow [2021-03-26 10:10:08,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2021-03-26 10:10:08,253 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9086538461538461 [2021-03-26 10:10:08,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2021-03-26 10:10:08,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2021-03-26 10:10:08,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:08,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2021-03-26 10:10:08,255 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 10:10:08,256 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 10:10:08,256 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 10:10:08,256 INFO L185 Difference]: Start difference. First operand has 80 places, 77 transitions, 687 flow. Second operand 3 states and 567 transitions. [2021-03-26 10:10:08,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 77 transitions, 699 flow [2021-03-26 10:10:08,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 77 transitions, 685 flow, removed 7 selfloop flow, removed 0 redundant places. [2021-03-26 10:10:08,293 INFO L241 Difference]: Finished difference. Result has 83 places, 75 transitions, 655 flow [2021-03-26 10:10:08,293 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=83, PETRI_TRANSITIONS=75} [2021-03-26 10:10:08,293 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 23 predicate places. [2021-03-26 10:10:08,293 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:08,294 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 75 transitions, 655 flow [2021-03-26 10:10:08,294 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 75 transitions, 655 flow [2021-03-26 10:10:08,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 75 transitions, 655 flow [2021-03-26 10:10:08,531 INFO L129 PetriNetUnfolder]: 980/1899 cut-off events. [2021-03-26 10:10:08,531 INFO L130 PetriNetUnfolder]: For 9266/9962 co-relation queries the response was YES. [2021-03-26 10:10:08,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8520 conditions, 1899 events. 980/1899 cut-off events. For 9266/9962 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 15016 event pairs, 144 based on Foata normal form. 64/1676 useless extension candidates. Maximal degree in co-relation 8485. Up to 1235 conditions per place. [2021-03-26 10:10:08,573 INFO L142 LiptonReduction]: Number of co-enabled transitions 1604 [2021-03-26 10:10:08,781 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:10:09,157 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:10:09,297 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:10:09,382 INFO L154 LiptonReduction]: Checked pairs total: 716 [2021-03-26 10:10:09,382 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:10:09,382 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1089 [2021-03-26 10:10:09,383 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 657 flow [2021-03-26 10:10:09,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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 10:10:09,383 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:09,383 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:09,383 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:10:09,383 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:09,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:09,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2023540450, now seen corresponding path program 1 times [2021-03-26 10:10:09,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:09,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168734719] [2021-03-26 10:10:09,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:09,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:09,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:09,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:09,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:09,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:09,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:09,430 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:10:09,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:10:09,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:09,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:09,436 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 10:10:09,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168734719] [2021-03-26 10:10:09,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:09,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:10:09,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56214477] [2021-03-26 10:10:09,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:10:09,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:09,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:10:09,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:10:09,438 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 209 [2021-03-26 10:10:09,439 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 657 flow. Second operand has 6 states, 6 states have (on average 174.83333333333334) internal successors, (1049), 6 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states 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 10:10:09,439 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:09,439 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 209 [2021-03-26 10:10:09,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:09,792 INFO L129 PetriNetUnfolder]: 1051/1971 cut-off events. [2021-03-26 10:10:09,792 INFO L130 PetriNetUnfolder]: For 10902/16577 co-relation queries the response was YES. [2021-03-26 10:10:09,806 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9219 conditions, 1971 events. 1051/1971 cut-off events. For 10902/16577 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 14902 event pairs, 18 based on Foata normal form. 654/2283 useless extension candidates. Maximal degree in co-relation 9182. Up to 1233 conditions per place. [2021-03-26 10:10:09,815 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 10 selfloop transitions, 28 changer transitions 5/88 dead transitions. [2021-03-26 10:10:09,816 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 88 transitions, 834 flow [2021-03-26 10:10:09,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 10:10:09,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 10:10:09,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1610 transitions. [2021-03-26 10:10:09,819 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8559276980329612 [2021-03-26 10:10:09,820 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1610 transitions. [2021-03-26 10:10:09,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1610 transitions. [2021-03-26 10:10:09,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:09,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1610 transitions. [2021-03-26 10:10:09,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 178.88888888888889) internal successors, (1610), 9 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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 10:10:09,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states 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 10:10:09,826 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states 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 10:10:09,826 INFO L185 Difference]: Start difference. First operand has 83 places, 75 transitions, 657 flow. Second operand 9 states and 1610 transitions. [2021-03-26 10:10:09,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 88 transitions, 834 flow [2021-03-26 10:10:09,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 88 transitions, 798 flow, removed 5 selfloop flow, removed 5 redundant places. [2021-03-26 10:10:09,852 INFO L241 Difference]: Finished difference. Result has 89 places, 80 transitions, 744 flow [2021-03-26 10:10:09,852 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=744, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2021-03-26 10:10:09,852 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 29 predicate places. [2021-03-26 10:10:09,852 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:09,852 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 80 transitions, 744 flow [2021-03-26 10:10:09,852 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 80 transitions, 744 flow [2021-03-26 10:10:09,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 80 transitions, 744 flow [2021-03-26 10:10:10,001 INFO L129 PetriNetUnfolder]: 666/1418 cut-off events. [2021-03-26 10:10:10,002 INFO L130 PetriNetUnfolder]: For 9098/9655 co-relation queries the response was YES. [2021-03-26 10:10:10,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7601 conditions, 1418 events. 666/1418 cut-off events. For 9098/9655 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 11255 event pairs, 18 based on Foata normal form. 23/1220 useless extension candidates. Maximal degree in co-relation 7564. Up to 915 conditions per place. [2021-03-26 10:10:10,033 INFO L142 LiptonReduction]: Number of co-enabled transitions 1702 [2021-03-26 10:10:10,452 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:10:10,912 WARN L205 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 10:10:11,056 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:10:11,271 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:10:11,637 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:10:11,769 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:10:11,809 INFO L154 LiptonReduction]: Checked pairs total: 1187 [2021-03-26 10:10:11,809 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:10:11,809 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1957 [2021-03-26 10:10:11,810 INFO L480 AbstractCegarLoop]: Abstraction has has 89 places, 77 transitions, 722 flow [2021-03-26 10:10:11,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 174.83333333333334) internal successors, (1049), 6 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states 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 10:10:11,811 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:11,811 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:11,811 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:10:11,811 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:11,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:11,811 INFO L82 PathProgramCache]: Analyzing trace with hash 550467924, now seen corresponding path program 1 times [2021-03-26 10:10:11,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:11,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011581127] [2021-03-26 10:10:11,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:11,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:11,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:11,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:11,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:11,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:11,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:11,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:11,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:11,871 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:10:11,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:10:11,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:11,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:11,880 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 10:10:11,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011581127] [2021-03-26 10:10:11,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:11,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:10:11,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396304601] [2021-03-26 10:10:11,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:10:11,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:11,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:10:11,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:10:11,882 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 211 [2021-03-26 10:10:11,883 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 77 transitions, 722 flow. Second operand has 7 states, 7 states have (on average 176.85714285714286) internal successors, (1238), 7 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states 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 10:10:11,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:11,884 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 211 [2021-03-26 10:10:11,884 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:12,088 INFO L129 PetriNetUnfolder]: 564/1022 cut-off events. [2021-03-26 10:10:12,088 INFO L130 PetriNetUnfolder]: For 5521/7307 co-relation queries the response was YES. [2021-03-26 10:10:12,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5171 conditions, 1022 events. 564/1022 cut-off events. For 5521/7307 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 6285 event pairs, 0 based on Foata normal form. 156/981 useless extension candidates. Maximal degree in co-relation 5132. Up to 691 conditions per place. [2021-03-26 10:10:12,101 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 6 selfloop transitions, 18 changer transitions 5/74 dead transitions. [2021-03-26 10:10:12,101 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 74 transitions, 712 flow [2021-03-26 10:10:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:10:12,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:10:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1439 transitions. [2021-03-26 10:10:12,105 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8524881516587678 [2021-03-26 10:10:12,105 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1439 transitions. [2021-03-26 10:10:12,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1439 transitions. [2021-03-26 10:10:12,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:12,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1439 transitions. [2021-03-26 10:10:12,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 179.875) internal successors, (1439), 8 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states 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 10:10:12,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states 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 10:10:12,119 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states 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 10:10:12,119 INFO L185 Difference]: Start difference. First operand has 89 places, 77 transitions, 722 flow. Second operand 8 states and 1439 transitions. [2021-03-26 10:10:12,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 74 transitions, 712 flow [2021-03-26 10:10:12,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 74 transitions, 620 flow, removed 36 selfloop flow, removed 8 redundant places. [2021-03-26 10:10:12,140 INFO L241 Difference]: Finished difference. Result has 83 places, 66 transitions, 566 flow [2021-03-26 10:10:12,140 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=566, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2021-03-26 10:10:12,140 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 23 predicate places. [2021-03-26 10:10:12,141 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:12,141 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 66 transitions, 566 flow [2021-03-26 10:10:12,141 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 66 transitions, 566 flow [2021-03-26 10:10:12,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 66 transitions, 566 flow [2021-03-26 10:10:12,190 INFO L129 PetriNetUnfolder]: 194/479 cut-off events. [2021-03-26 10:10:12,190 INFO L130 PetriNetUnfolder]: For 1236/1382 co-relation queries the response was YES. [2021-03-26 10:10:12,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 479 events. 194/479 cut-off events. For 1236/1382 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3151 event pairs, 0 based on Foata normal form. 3/418 useless extension candidates. Maximal degree in co-relation 2030. Up to 219 conditions per place. [2021-03-26 10:10:12,199 INFO L142 LiptonReduction]: Number of co-enabled transitions 1030 [2021-03-26 10:10:12,545 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 10:10:12,716 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 10:10:13,402 WARN L205 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 196 [2021-03-26 10:10:13,635 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-26 10:10:15,709 WARN L205 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 350 DAG size of output: 276 [2021-03-26 10:10:16,295 WARN L205 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-26 10:10:16,304 INFO L154 LiptonReduction]: Checked pairs total: 744 [2021-03-26 10:10:16,304 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:10:16,304 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4163 [2021-03-26 10:10:16,305 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 63 transitions, 550 flow [2021-03-26 10:10:16,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 176.85714285714286) internal successors, (1238), 7 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states 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 10:10:16,305 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:16,305 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 10:10:16,305 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:10:16,305 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:16,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:16,306 INFO L82 PathProgramCache]: Analyzing trace with hash 732120510, now seen corresponding path program 1 times [2021-03-26 10:10:16,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:16,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233535228] [2021-03-26 10:10:16,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:16,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:16,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:16,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:16,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:16,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:16,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:16,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233535228] [2021-03-26 10:10:16,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:16,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:16,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940869054] [2021-03-26 10:10:16,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:10:16,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:16,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:10:16,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:10:16,367 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 213 [2021-03-26 10:10:16,367 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 63 transitions, 550 flow. Second operand has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:16,367 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:16,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 213 [2021-03-26 10:10:16,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:16,476 INFO L129 PetriNetUnfolder]: 395/836 cut-off events. [2021-03-26 10:10:16,476 INFO L130 PetriNetUnfolder]: For 3937/4399 co-relation queries the response was YES. [2021-03-26 10:10:16,482 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3508 conditions, 836 events. 395/836 cut-off events. For 3937/4399 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 5799 event pairs, 0 based on Foata normal form. 57/766 useless extension candidates. Maximal degree in co-relation 3471. Up to 336 conditions per place. [2021-03-26 10:10:16,484 INFO L132 encePairwiseOnDemand]: 210/213 looper letters, 3 selfloop transitions, 2 changer transitions 22/64 dead transitions. [2021-03-26 10:10:16,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 64 transitions, 562 flow [2021-03-26 10:10:16,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:10:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:10:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 750 transitions. [2021-03-26 10:10:16,487 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8802816901408451 [2021-03-26 10:10:16,487 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 750 transitions. [2021-03-26 10:10:16,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 750 transitions. [2021-03-26 10:10:16,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:16,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 750 transitions. [2021-03-26 10:10:16,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 187.5) internal successors, (750), 4 states have internal predecessors, (750), 0 states have call successors, (0), 0 states 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 10:10:16,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states 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 10:10:16,490 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states 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 10:10:16,490 INFO L185 Difference]: Start difference. First operand has 79 places, 63 transitions, 550 flow. Second operand 4 states and 750 transitions. [2021-03-26 10:10:16,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 64 transitions, 562 flow [2021-03-26 10:10:16,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 64 transitions, 493 flow, removed 19 selfloop flow, removed 8 redundant places. [2021-03-26 10:10:16,513 INFO L241 Difference]: Finished difference. Result has 76 places, 42 transitions, 263 flow [2021-03-26 10:10:16,514 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=76, PETRI_TRANSITIONS=42} [2021-03-26 10:10:16,514 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 16 predicate places. [2021-03-26 10:10:16,514 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:16,514 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 42 transitions, 263 flow [2021-03-26 10:10:16,514 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 42 transitions, 263 flow [2021-03-26 10:10:16,515 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 42 transitions, 263 flow [2021-03-26 10:10:16,528 INFO L129 PetriNetUnfolder]: 65/169 cut-off events. [2021-03-26 10:10:16,529 INFO L130 PetriNetUnfolder]: For 987/1035 co-relation queries the response was YES. [2021-03-26 10:10:16,530 INFO L84 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 169 events. 65/169 cut-off events. For 987/1035 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 725 event pairs, 0 based on Foata normal form. 9/159 useless extension candidates. Maximal degree in co-relation 510. Up to 56 conditions per place. [2021-03-26 10:10:16,531 INFO L142 LiptonReduction]: Number of co-enabled transitions 414 [2021-03-26 10:10:16,951 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 74 [2021-03-26 10:10:17,334 WARN L205 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 93 [2021-03-26 10:10:17,411 INFO L154 LiptonReduction]: Checked pairs total: 146 [2021-03-26 10:10:17,411 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:10:17,412 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 898 [2021-03-26 10:10:17,412 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 39 transitions, 267 flow [2021-03-26 10:10:17,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:17,412 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:17,413 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] [2021-03-26 10:10:17,413 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 10:10:17,413 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:17,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:17,413 INFO L82 PathProgramCache]: Analyzing trace with hash 892989424, now seen corresponding path program 1 times [2021-03-26 10:10:17,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:17,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027977630] [2021-03-26 10:10:17,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:10:17,435 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:10:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:10:17,457 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:10:17,484 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:10:17,485 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:10:17,485 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 10:10:17,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:10:17 BasicIcfg [2021-03-26 10:10:17,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:10:17,582 INFO L168 Benchmark]: Toolchain (without parser) took 31883.31 ms. Allocated memory was 255.9 MB in the beginning and 799.0 MB in the end (delta: 543.2 MB). Free memory was 234.8 MB in the beginning and 505.1 MB in the end (delta: -270.3 MB). Peak memory consumption was 272.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:17,582 INFO L168 Benchmark]: CDTParser took 0.16 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 10:10:17,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.48 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 234.4 MB in the beginning and 325.9 MB in the end (delta: -91.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:17,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.92 ms. Allocated memory is still 367.0 MB. Free memory was 325.9 MB in the beginning and 322.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:17,583 INFO L168 Benchmark]: Boogie Preprocessor took 50.76 ms. Allocated memory is still 367.0 MB. Free memory was 322.6 MB in the beginning and 320.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:17,583 INFO L168 Benchmark]: RCFGBuilder took 1709.75 ms. Allocated memory is still 367.0 MB. Free memory was 320.5 MB in the beginning and 240.7 MB in the end (delta: 79.8 MB). Peak memory consumption was 81.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:17,583 INFO L168 Benchmark]: TraceAbstraction took 29373.73 ms. Allocated memory was 367.0 MB in the beginning and 799.0 MB in the end (delta: 432.0 MB). Free memory was 240.7 MB in the beginning and 505.1 MB in the end (delta: -264.4 MB). Peak memory consumption was 167.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:17,584 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.16 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 663.48 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 234.4 MB in the beginning and 325.9 MB in the end (delta: -91.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 80.92 ms. Allocated memory is still 367.0 MB. Free memory was 325.9 MB in the beginning and 322.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 50.76 ms. Allocated memory is still 367.0 MB. Free memory was 322.6 MB in the beginning and 320.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1709.75 ms. Allocated memory is still 367.0 MB. Free memory was 320.5 MB in the beginning and 240.7 MB in the end (delta: 79.8 MB). Peak memory consumption was 81.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 29373.73 ms. Allocated memory was 367.0 MB in the beginning and 799.0 MB in the end (delta: 432.0 MB). Free memory was 240.7 MB in the beginning and 505.1 MB in the end (delta: -264.4 MB). Peak memory consumption was 167.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9159.4ms, 124 PlacesBefore, 60 PlacesAfterwards, 113 TransitionsBefore, 48 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 5 FixpointIterations, 28 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 4166 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2227, positive: 2135, positive conditional: 2135, positive unconditional: 0, negative: 92, negative conditional: 92, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2227, positive: 2135, positive conditional: 0, positive unconditional: 2135, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2227, positive: 2135, positive conditional: 0, positive unconditional: 2135, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1725, positive: 1684, positive conditional: 0, positive unconditional: 1684, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1725, positive: 1674, positive conditional: 0, positive unconditional: 1674, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 717, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 685, negative conditional: 0, negative unconditional: 685, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2227, positive: 451, positive conditional: 0, positive unconditional: 451, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 1725, unknown conditional: 0, unknown unconditional: 1725] , Statistics on independence cache: Total cache size (in pairs): 1725, Positive cache size: 1684, Positive conditional cache size: 0, Positive unconditional cache size: 1684, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3842.6ms, 56 PlacesBefore, 40 PlacesAfterwards, 41 TransitionsBefore, 29 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 3 FixpointIterations, 10 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1274 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 467, positive: 395, positive conditional: 395, positive unconditional: 0, negative: 72, negative conditional: 72, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 467, positive: 395, positive conditional: 20, positive unconditional: 375, negative: 72, negative conditional: 5, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 467, positive: 395, positive conditional: 20, positive unconditional: 375, negative: 72, negative conditional: 5, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 119, positive: 102, positive conditional: 12, positive unconditional: 90, negative: 17, negative conditional: 4, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 119, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 17, negative conditional: 4, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 338, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 266, negative conditional: 88, negative unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 467, positive: 293, positive conditional: 8, positive unconditional: 285, negative: 55, negative conditional: 1, negative unconditional: 54, unknown: 119, unknown conditional: 16, unknown unconditional: 103] , Statistics on independence cache: Total cache size (in pairs): 1844, Positive cache size: 1786, Positive conditional cache size: 12, Positive unconditional cache size: 1774, Negative cache size: 58, Negative conditional cache size: 4, Negative unconditional cache size: 54, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 540.9ms, 44 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1098 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 349, positive: 292, positive conditional: 292, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 349, positive: 292, positive conditional: 23, positive unconditional: 269, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 349, positive: 292, positive conditional: 23, positive unconditional: 269, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 11, positive conditional: 4, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 349, positive: 281, positive conditional: 19, positive unconditional: 262, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 12, unknown conditional: 4, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 1856, Positive cache size: 1797, Positive conditional cache size: 16, Positive unconditional cache size: 1781, Negative cache size: 59, Negative conditional cache size: 4, Negative unconditional cache size: 55, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 966.8ms, 44 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 768 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 311, positive: 271, positive conditional: 271, positive unconditional: 0, negative: 40, negative conditional: 40, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 315, positive: 271, positive conditional: 16, positive unconditional: 255, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 315, positive: 271, positive conditional: 16, positive unconditional: 255, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 11, positive conditional: 2, positive unconditional: 9, 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: 13, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 315, positive: 260, positive conditional: 14, positive unconditional: 246, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 13, unknown conditional: 2, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 1869, Positive cache size: 1808, Positive conditional cache size: 18, Positive unconditional cache size: 1790, Negative cache size: 61, Negative conditional cache size: 4, Negative unconditional cache size: 57, Eliminated conditions: 46 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.9ms, 44 PlacesBefore, 44 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 333 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, positive: 83, positive conditional: 83, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, positive: 83, positive conditional: 10, positive unconditional: 73, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, positive: 83, positive conditional: 10, positive unconditional: 73, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 100, positive: 83, positive conditional: 10, positive unconditional: 73, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1869, Positive cache size: 1808, Positive conditional cache size: 18, Positive unconditional cache size: 1790, Negative cache size: 61, Negative conditional cache size: 4, Negative unconditional cache size: 57, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.1ms, 49 PlacesBefore, 49 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 371 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 185, positive: 168, positive conditional: 168, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 185, positive: 168, positive conditional: 32, positive unconditional: 136, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 185, positive: 168, positive conditional: 32, positive unconditional: 136, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 6, positive unconditional: 4, 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: 11, positive: 10, positive conditional: 0, positive unconditional: 10, 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: 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] ], Cache Queries: [ total: 185, positive: 158, positive conditional: 26, positive unconditional: 132, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 11, unknown conditional: 6, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1880, Positive cache size: 1818, Positive conditional cache size: 24, Positive unconditional cache size: 1794, Negative cache size: 62, Negative conditional cache size: 4, Negative unconditional cache size: 58, Eliminated conditions: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 789.8ms, 53 PlacesBefore, 53 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 626 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 888 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 418, positive: 380, positive conditional: 380, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 418, positive: 380, positive conditional: 82, positive unconditional: 298, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 418, positive: 380, positive conditional: 82, positive unconditional: 298, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 6, positive unconditional: 11, 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: 17, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 418, positive: 363, positive conditional: 76, positive unconditional: 287, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 17, unknown conditional: 6, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 1897, Positive cache size: 1835, Positive conditional cache size: 30, Positive unconditional cache size: 1805, Negative cache size: 62, Negative conditional cache size: 4, Negative unconditional cache size: 58, Eliminated conditions: 80 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.5ms, 57 PlacesBefore, 57 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 668 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 496 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 232, positive: 211, positive conditional: 211, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 232, positive: 211, positive conditional: 57, positive unconditional: 154, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 232, positive: 211, positive conditional: 57, positive unconditional: 154, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 4, positive unconditional: 5, 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: 232, positive: 202, positive conditional: 53, positive unconditional: 149, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 9, unknown conditional: 4, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1906, Positive cache size: 1844, Positive conditional cache size: 34, Positive unconditional cache size: 1810, Negative cache size: 62, Negative conditional cache size: 4, Negative unconditional cache size: 58, Eliminated conditions: 38 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.5ms, 59 PlacesBefore, 59 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 712 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 614 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 282, positive: 255, positive conditional: 255, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 282, positive: 255, positive conditional: 80, positive unconditional: 175, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 282, positive: 255, positive conditional: 80, positive unconditional: 175, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 282, positive: 255, positive conditional: 80, positive unconditional: 175, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1906, Positive cache size: 1844, Positive conditional cache size: 34, Positive unconditional cache size: 1810, Negative cache size: 62, Negative conditional cache size: 4, Negative unconditional cache size: 58, Eliminated conditions: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 105.9ms, 64 PlacesBefore, 64 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 976 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 442 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 199, positive: 185, positive conditional: 185, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 199, positive: 185, positive conditional: 76, positive unconditional: 109, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 199, positive: 185, positive conditional: 76, positive unconditional: 109, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 1, positive unconditional: 4, 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: 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] , 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: 199, positive: 180, positive conditional: 75, positive unconditional: 105, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1911, Positive cache size: 1849, Positive conditional cache size: 35, Positive unconditional cache size: 1814, Negative cache size: 62, Negative conditional cache size: 4, Negative unconditional cache size: 58, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 117.0ms, 72 PlacesBefore, 72 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 1180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 605 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 232, positive: 216, positive conditional: 216, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 232, positive: 216, positive conditional: 120, positive unconditional: 96, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 232, positive: 216, positive conditional: 120, positive unconditional: 96, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 232, positive: 216, positive conditional: 120, positive unconditional: 96, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1911, Positive cache size: 1849, Positive conditional cache size: 35, Positive unconditional cache size: 1814, Negative cache size: 62, Negative conditional cache size: 4, Negative unconditional cache size: 58, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1051.6ms, 80 PlacesBefore, 80 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1614 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 968 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 476, positive: 458, positive conditional: 458, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 476, positive: 458, positive conditional: 290, positive unconditional: 168, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 476, positive: 458, positive conditional: 290, positive unconditional: 168, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 5, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 476, positive: 452, positive conditional: 285, positive unconditional: 167, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1917, Positive cache size: 1855, Positive conditional cache size: 40, Positive unconditional cache size: 1815, Negative cache size: 62, Negative conditional cache size: 4, Negative unconditional cache size: 58, Eliminated conditions: 66 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1088.2ms, 83 PlacesBefore, 83 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1604 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 716 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, positive: 168, positive conditional: 168, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, positive: 168, positive conditional: 104, positive unconditional: 64, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, positive: 168, positive conditional: 104, positive unconditional: 64, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 182, positive: 168, positive conditional: 104, positive unconditional: 64, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1917, Positive cache size: 1855, Positive conditional cache size: 40, Positive unconditional cache size: 1815, Negative cache size: 62, Negative conditional cache size: 4, Negative unconditional cache size: 58, Eliminated conditions: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1956.8ms, 89 PlacesBefore, 89 PlacesAfterwards, 80 TransitionsBefore, 77 TransitionsAfterwards, 1702 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 1187 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 351, positive: 331, positive conditional: 331, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 351, positive: 331, positive conditional: 236, positive unconditional: 95, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 351, positive: 331, positive conditional: 236, positive unconditional: 95, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 22, 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: 25, positive: 25, positive conditional: 0, positive unconditional: 25, 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: 351, positive: 306, positive conditional: 214, positive unconditional: 92, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 25, unknown conditional: 22, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1942, Positive cache size: 1880, Positive conditional cache size: 62, Positive unconditional cache size: 1818, Negative cache size: 62, Negative conditional cache size: 4, Negative unconditional cache size: 58, Eliminated conditions: 43 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4163.1ms, 83 PlacesBefore, 79 PlacesAfterwards, 66 TransitionsBefore, 63 TransitionsAfterwards, 1030 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 744 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 623, positive: 602, positive conditional: 602, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 623, positive: 602, positive conditional: 398, positive unconditional: 204, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 623, positive: 602, positive conditional: 398, positive unconditional: 204, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 14, positive unconditional: 2, 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: 16, positive: 16, positive conditional: 0, positive unconditional: 16, 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: 623, positive: 586, positive conditional: 384, positive unconditional: 202, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 16, unknown conditional: 14, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1958, Positive cache size: 1896, Positive conditional cache size: 76, Positive unconditional cache size: 1820, Negative cache size: 62, Negative conditional cache size: 4, Negative unconditional cache size: 58, Eliminated conditions: 69 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 897.1ms, 76 PlacesBefore, 67 PlacesAfterwards, 42 TransitionsBefore, 39 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, positive: 104, positive conditional: 104, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, positive: 104, positive conditional: 43, positive unconditional: 61, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, positive: 104, positive conditional: 43, positive unconditional: 61, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, positive: 22, positive conditional: 10, positive unconditional: 12, 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: 23, positive: 22, positive conditional: 0, positive unconditional: 22, 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: 10, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, positive: 82, positive conditional: 33, positive unconditional: 49, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 23, unknown conditional: 10, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 1981, Positive cache size: 1918, Positive conditional cache size: 86, Positive unconditional cache size: 1832, Negative cache size: 63, Negative conditional cache size: 4, Negative unconditional cache size: 59, Eliminated conditions: 48 - 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; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((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}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((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}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 [L818] 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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y 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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 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=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_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=52, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 29198.1ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2508.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9232.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 66 SDtfs, 61 SDslu, 43 SDs, 0 SdLazy, 369 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 403.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 295.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=744occurred in iteration=13, InterpolantAutomatonStates: 75, 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: 47.0ms SsaConstructionTime, 496.0ms SatisfiabilityAnalysisTime, 993.7ms InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 1220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...