/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/mix055_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:14:38,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:14:38,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:14:38,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:14:38,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:14:38,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:14:38,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:14:38,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:14:38,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:14:38,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:14:38,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:14:38,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:14:38,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:14:38,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:14:38,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:14:38,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:14:38,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:14:38,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:14:38,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:14:38,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:14:38,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:14:38,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:14:38,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:14:38,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:14:38,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:14:38,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:14:38,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:14:38,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:14:38,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:14:38,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:14:38,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:14:38,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:14:38,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:14:38,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:14:38,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:14:38,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:14:38,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:14:38,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:14:38,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:14:38,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:14:38,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:14:38,497 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:14:38,532 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:14:38,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:14:38,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:14:38,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:14:38,536 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:14:38,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:14:38,536 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:14:38,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:14:38,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:14:38,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:14:38,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:14:38,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:14:38,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:14:38,538 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:14:38,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:14:38,538 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:14:38,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:14:38,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:14:38,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:14:38,539 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:14:38,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:14:38,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:14:38,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:14:38,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:14:38,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:14:38,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:14:38,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:14:38,540 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:14:38,540 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:14:38,540 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:14:38,541 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:14:38,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:14:38,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:14:38,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:14:38,838 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:14:38,838 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:14:38,839 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2021-03-26 10:14:38,890 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a74359272/3933a1cddade46b79a77e6f7fd5c4503/FLAGd4306537e [2021-03-26 10:14:39,441 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:14:39,441 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2021-03-26 10:14:39,455 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a74359272/3933a1cddade46b79a77e6f7fd5c4503/FLAGd4306537e [2021-03-26 10:14:39,872 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a74359272/3933a1cddade46b79a77e6f7fd5c4503 [2021-03-26 10:14:39,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:14:39,875 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:14:39,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:14:39,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:14:39,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:14:39,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:14:39" (1/1) ... [2021-03-26 10:14:39,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25aef6b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:39, skipping insertion in model container [2021-03-26 10:14:39,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:14:39" (1/1) ... [2021-03-26 10:14:39,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:14:39,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:14:40,029 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/mix055_tso.opt.i[948,961] [2021-03-26 10:14:40,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:14:40,221 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:14:40,234 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/mix055_tso.opt.i[948,961] [2021-03-26 10:14:40,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:14:40,353 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:14:40,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:40 WrapperNode [2021-03-26 10:14:40,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:14:40,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:14:40,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:14:40,355 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:14:40,361 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:14:40" (1/1) ... [2021-03-26 10:14:40,375 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:14:40" (1/1) ... [2021-03-26 10:14:40,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:14:40,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:14:40,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:14:40,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:14:40,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:40" (1/1) ... [2021-03-26 10:14:40,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:40" (1/1) ... [2021-03-26 10:14:40,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:40" (1/1) ... [2021-03-26 10:14:40,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:40" (1/1) ... [2021-03-26 10:14:40,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:40" (1/1) ... [2021-03-26 10:14:40,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:40" (1/1) ... [2021-03-26 10:14:40,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:40" (1/1) ... [2021-03-26 10:14:40,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:14:40,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:14:40,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:14:40,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:14:40,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:40" (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:14:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:14:40,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:14:40,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:14:40,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:14:40,521 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:14:40,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:14:40,522 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:14:40,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:14:40,522 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:14:40,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:14:40,522 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:14:40,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:14:40,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:14:40,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:14:40,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:14:40,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:14:40,528 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:14:42,229 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:14:42,230 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:14:42,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:14:42 BoogieIcfgContainer [2021-03-26 10:14:42,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:14:42,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:14:42,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:14:42,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:14:42,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:14:39" (1/3) ... [2021-03-26 10:14:42,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505a8adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:14:42, skipping insertion in model container [2021-03-26 10:14:42,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:40" (2/3) ... [2021-03-26 10:14:42,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505a8adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:14:42, skipping insertion in model container [2021-03-26 10:14:42,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:14:42" (3/3) ... [2021-03-26 10:14:42,239 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_tso.opt.i [2021-03-26 10:14:42,245 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:14:42,248 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:14:42,249 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:14:42,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,290 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,290 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,291 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,291 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,292 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,292 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,293 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,293 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,295 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,295 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,295 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,296 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,299 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,300 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,300 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,300 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,300 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,301 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,301 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,301 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,306 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,306 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,309 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,309 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,311 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,311 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,313 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,314 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,314 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:42,315 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:14:42,330 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 10:14:42,347 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:14:42,347 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:14:42,347 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:14:42,347 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:14:42,347 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:14:42,347 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:14:42,347 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:14:42,347 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:14:42,356 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2021-03-26 10:14:42,390 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2021-03-26 10:14:42,391 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:42,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-26 10:14:42,395 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 113 transitions, 246 flow [2021-03-26 10:14:42,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 109 transitions, 230 flow [2021-03-26 10:14:42,400 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:42,411 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 109 transitions, 230 flow [2021-03-26 10:14:42,414 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 109 transitions, 230 flow [2021-03-26 10:14:42,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 109 transitions, 230 flow [2021-03-26 10:14:42,433 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2021-03-26 10:14:42,433 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:42,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-26 10:14:42,437 INFO L142 LiptonReduction]: Number of co-enabled transitions 2406 [2021-03-26 10:14:44,085 WARN L205 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-26 10:14:44,680 WARN L205 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-03-26 10:14:46,074 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 10:14:46,614 WARN L205 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:14:47,160 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:14:47,515 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:14:47,653 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:14:48,866 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:14:49,171 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:14:49,827 WARN L205 SmtUtils]: Spent 653.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:14:50,445 WARN L205 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:14:50,983 INFO L154 LiptonReduction]: Checked pairs total: 4266 [2021-03-26 10:14:50,983 INFO L156 LiptonReduction]: Total number of compositions: 72 [2021-03-26 10:14:50,985 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8586 [2021-03-26 10:14:50,995 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 10:14:50,995 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:50,996 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:50,996 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:50,997 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:51,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:51,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1508011334, now seen corresponding path program 1 times [2021-03-26 10:14:51,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:51,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206411063] [2021-03-26 10:14:51,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:51,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:51,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:51,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:51,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:51,298 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:14:51,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206411063] [2021-03-26 10:14:51,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:51,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:14:51,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636709237] [2021-03-26 10:14:51,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:14:51,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:51,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:14:51,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:14:51,324 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2021-03-26 10:14:51,330 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:51,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:51,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2021-03-26 10:14:51,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:51,418 INFO L129 PetriNetUnfolder]: 23/110 cut-off events. [2021-03-26 10:14:51,418 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:51,420 INFO L84 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 110 events. 23/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 9 based on Foata normal form. 6/109 useless extension candidates. Maximal degree in co-relation 150. Up to 37 conditions per place. [2021-03-26 10:14:51,422 INFO L132 encePairwiseOnDemand]: 181/185 looper letters, 7 selfloop transitions, 2 changer transitions 6/46 dead transitions. [2021-03-26 10:14:51,422 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 126 flow [2021-03-26 10:14:51,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:14:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:14:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2021-03-26 10:14:51,441 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9117117117117117 [2021-03-26 10:14:51,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 506 transitions. [2021-03-26 10:14:51,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 506 transitions. [2021-03-26 10:14:51,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:51,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 506 transitions. [2021-03-26 10:14:51,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:51,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:51,464 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:51,465 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 506 transitions. [2021-03-26 10:14:51,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 126 flow [2021-03-26 10:14:51,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 46 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:14:51,470 INFO L241 Difference]: Finished difference. Result has 53 places, 37 transitions, 86 flow [2021-03-26 10:14:51,472 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2021-03-26 10:14:51,472 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-26 10:14:51,473 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:51,473 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 37 transitions, 86 flow [2021-03-26 10:14:51,474 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 37 transitions, 86 flow [2021-03-26 10:14:51,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 37 transitions, 86 flow [2021-03-26 10:14:51,484 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-26 10:14:51,484 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:51,484 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:14:51,485 INFO L142 LiptonReduction]: Number of co-enabled transitions 362 [2021-03-26 10:14:51,795 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:14:51,941 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:14:52,461 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:14:52,763 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:14:53,443 WARN L205 SmtUtils]: Spent 669.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:14:54,047 WARN L205 SmtUtils]: Spent 602.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:14:54,800 INFO L154 LiptonReduction]: Checked pairs total: 1530 [2021-03-26 10:14:54,800 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-26 10:14:54,800 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3327 [2021-03-26 10:14:54,801 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2021-03-26 10:14:54,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:54,802 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:54,802 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:14:54,802 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:14:54,802 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:54,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:54,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1703571502, now seen corresponding path program 1 times [2021-03-26 10:14:54,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:54,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118554189] [2021-03-26 10:14:54,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:54,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:54,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:54,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:54,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:55,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:55,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:14:55,012 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:14:55,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118554189] [2021-03-26 10:14:55,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:55,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:55,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827634106] [2021-03-26 10:14:55,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:14:55,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:55,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:14:55,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:14:55,018 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 195 [2021-03-26 10:14:55,019 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states 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:14:55,019 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:55,019 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 195 [2021-03-26 10:14:55,019 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:55,041 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-26 10:14:55,041 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:55,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 37 events. 3/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 1 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-03-26 10:14:55,042 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-26 10:14:55,042 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 82 flow [2021-03-26 10:14:55,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:14:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:14:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2021-03-26 10:14:55,045 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-03-26 10:14:55,045 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2021-03-26 10:14:55,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2021-03-26 10:14:55,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:55,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2021-03-26 10:14:55,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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:14:55,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:55,048 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:55,048 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 520 transitions. [2021-03-26 10:14:55,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 82 flow [2021-03-26 10:14:55,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:14:55,050 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 81 flow [2021-03-26 10:14:55,050 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-26 10:14:55,050 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -18 predicate places. [2021-03-26 10:14:55,050 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:55,051 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-26 10:14:55,051 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-26 10:14:55,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 81 flow [2021-03-26 10:14:55,055 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-26 10:14:55,055 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:55,056 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 37 events. 3/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 1 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-26 10:14:55,056 INFO L142 LiptonReduction]: Number of co-enabled transitions 356 [2021-03-26 10:14:55,749 WARN L205 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 10:14:55,896 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 10:14:56,213 WARN L205 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 10:14:56,364 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 10:14:56,369 INFO L154 LiptonReduction]: Checked pairs total: 1020 [2021-03-26 10:14:56,369 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:14:56,369 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1319 [2021-03-26 10:14:56,370 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2021-03-26 10:14:56,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states 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:14:56,371 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:56,371 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:56,371 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:14:56,372 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:56,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:56,372 INFO L82 PathProgramCache]: Analyzing trace with hash 582134895, now seen corresponding path program 1 times [2021-03-26 10:14:56,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:56,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248490219] [2021-03-26 10:14:56,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:56,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:56,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:56,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:56,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:14:56,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:56,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:14:56,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:56,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:56,514 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:14:56,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248490219] [2021-03-26 10:14:56,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:56,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:14:56,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273436064] [2021-03-26 10:14:56,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:14:56,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:56,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:14:56,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:14:56,519 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 197 [2021-03-26 10:14:56,521 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 77 flow. Second operand has 6 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:56,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:56,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 197 [2021-03-26 10:14:56,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:56,579 INFO L129 PetriNetUnfolder]: 47/131 cut-off events. [2021-03-26 10:14:56,580 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-03-26 10:14:56,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 131 events. 47/131 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 30 based on Foata normal form. 2/117 useless extension candidates. Maximal degree in co-relation 246. Up to 67 conditions per place. [2021-03-26 10:14:56,582 INFO L132 encePairwiseOnDemand]: 192/197 looper letters, 8 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2021-03-26 10:14:56,582 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 115 flow [2021-03-26 10:14:56,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 635 transitions. [2021-03-26 10:14:56,585 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8058375634517766 [2021-03-26 10:14:56,585 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 635 transitions. [2021-03-26 10:14:56,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 635 transitions. [2021-03-26 10:14:56,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:56,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 635 transitions. [2021-03-26 10:14:56,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 0 states have call successors, (0), 0 states 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:14:56,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:56,589 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:56,590 INFO L185 Difference]: Start difference. First operand has 37 places, 27 transitions, 77 flow. Second operand 4 states and 635 transitions. [2021-03-26 10:14:56,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 115 flow [2021-03-26 10:14:56,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 112 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:56,591 INFO L241 Difference]: Finished difference. Result has 41 places, 31 transitions, 108 flow [2021-03-26 10:14:56,592 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2021-03-26 10:14:56,592 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -16 predicate places. [2021-03-26 10:14:56,592 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:56,592 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 108 flow [2021-03-26 10:14:56,593 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 108 flow [2021-03-26 10:14:56,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 108 flow [2021-03-26 10:14:56,603 INFO L129 PetriNetUnfolder]: 15/62 cut-off events. [2021-03-26 10:14:56,604 INFO L130 PetriNetUnfolder]: For 40/43 co-relation queries the response was YES. [2021-03-26 10:14:56,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 62 events. 15/62 cut-off events. For 40/43 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 190 event pairs, 6 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 129. Up to 25 conditions per place. [2021-03-26 10:14:56,605 INFO L142 LiptonReduction]: Number of co-enabled transitions 428 [2021-03-26 10:14:56,661 INFO L154 LiptonReduction]: Checked pairs total: 314 [2021-03-26 10:14:56,661 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:56,661 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 69 [2021-03-26 10:14:56,662 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 108 flow [2021-03-26 10:14:56,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:56,663 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:56,663 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:56,663 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:14:56,664 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:56,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:56,664 INFO L82 PathProgramCache]: Analyzing trace with hash 438995751, now seen corresponding path program 1 times [2021-03-26 10:14:56,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:56,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230006076] [2021-03-26 10:14:56,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:56,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:56,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:56,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:56,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:56,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:56,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:14:56,783 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:14:56,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230006076] [2021-03-26 10:14:56,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:56,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:56,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335017269] [2021-03-26 10:14:56,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:56,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:56,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:56,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:56,790 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 197 [2021-03-26 10:14:56,792 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states 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:14:56,792 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:56,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 197 [2021-03-26 10:14:56,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:56,869 INFO L129 PetriNetUnfolder]: 37/108 cut-off events. [2021-03-26 10:14:56,869 INFO L130 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2021-03-26 10:14:56,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 108 events. 37/108 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 19 based on Foata normal form. 2/100 useless extension candidates. Maximal degree in co-relation 261. Up to 52 conditions per place. [2021-03-26 10:14:56,872 INFO L132 encePairwiseOnDemand]: 192/197 looper letters, 9 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2021-03-26 10:14:56,872 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 148 flow [2021-03-26 10:14:56,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 634 transitions. [2021-03-26 10:14:56,875 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8045685279187818 [2021-03-26 10:14:56,875 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 634 transitions. [2021-03-26 10:14:56,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 634 transitions. [2021-03-26 10:14:56,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:56,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 634 transitions. [2021-03-26 10:14:56,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 158.5) internal successors, (634), 4 states have internal predecessors, (634), 0 states have call successors, (0), 0 states 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:14:56,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:56,880 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:56,880 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 108 flow. Second operand 4 states and 634 transitions. [2021-03-26 10:14:56,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 148 flow [2021-03-26 10:14:56,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:14:56,883 INFO L241 Difference]: Finished difference. Result has 46 places, 33 transitions, 140 flow [2021-03-26 10:14:56,883 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2021-03-26 10:14:56,884 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -11 predicate places. [2021-03-26 10:14:56,884 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:56,884 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 33 transitions, 140 flow [2021-03-26 10:14:56,884 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 33 transitions, 140 flow [2021-03-26 10:14:56,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 33 transitions, 140 flow [2021-03-26 10:14:56,903 INFO L129 PetriNetUnfolder]: 19/74 cut-off events. [2021-03-26 10:14:56,904 INFO L130 PetriNetUnfolder]: For 134/140 co-relation queries the response was YES. [2021-03-26 10:14:56,904 INFO L84 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 74 events. 19/74 cut-off events. For 134/140 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 256 event pairs, 8 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 196. Up to 28 conditions per place. [2021-03-26 10:14:56,905 INFO L142 LiptonReduction]: Number of co-enabled transitions 464 [2021-03-26 10:14:57,097 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:14:57,505 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-26 10:14:57,623 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-26 10:14:57,628 INFO L154 LiptonReduction]: Checked pairs total: 580 [2021-03-26 10:14:57,629 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:14:57,629 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 745 [2021-03-26 10:14:57,629 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 143 flow [2021-03-26 10:14:57,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states 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:14:57,630 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:57,630 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:57,630 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:14:57,631 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash -183385002, now seen corresponding path program 1 times [2021-03-26 10:14:57,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:57,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488667548] [2021-03-26 10:14:57,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:57,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:57,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:14:57,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:57,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:57,754 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-03-26 10:14:57,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 10:14:57,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:57,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:14:57,778 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:14:57,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488667548] [2021-03-26 10:14:57,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:57,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:57,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419942052] [2021-03-26 10:14:57,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:57,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:57,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:57,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:57,781 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 198 [2021-03-26 10:14:57,782 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 0 states have call successors, (0), 0 states 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:14:57,782 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:57,782 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 198 [2021-03-26 10:14:57,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:57,860 INFO L129 PetriNetUnfolder]: 40/119 cut-off events. [2021-03-26 10:14:57,860 INFO L130 PetriNetUnfolder]: For 176/176 co-relation queries the response was YES. [2021-03-26 10:14:57,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 119 events. 40/119 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 435 event pairs, 8 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 347. Up to 55 conditions per place. [2021-03-26 10:14:57,862 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 10 selfloop transitions, 9 changer transitions 0/39 dead transitions. [2021-03-26 10:14:57,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 202 flow [2021-03-26 10:14:57,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:14:57,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:14:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 786 transitions. [2021-03-26 10:14:57,866 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.793939393939394 [2021-03-26 10:14:57,866 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 786 transitions. [2021-03-26 10:14:57,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 786 transitions. [2021-03-26 10:14:57,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:57,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 786 transitions. [2021-03-26 10:14:57,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.2) internal successors, (786), 5 states have internal predecessors, (786), 0 states have call successors, (0), 0 states 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:14:57,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:57,872 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:57,872 INFO L185 Difference]: Start difference. First operand has 46 places, 33 transitions, 143 flow. Second operand 5 states and 786 transitions. [2021-03-26 10:14:57,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 202 flow [2021-03-26 10:14:57,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 189 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:57,875 INFO L241 Difference]: Finished difference. Result has 51 places, 37 transitions, 179 flow [2021-03-26 10:14:57,875 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2021-03-26 10:14:57,875 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -6 predicate places. [2021-03-26 10:14:57,875 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:57,876 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 37 transitions, 179 flow [2021-03-26 10:14:57,876 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 37 transitions, 179 flow [2021-03-26 10:14:57,876 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 37 transitions, 179 flow [2021-03-26 10:14:57,891 INFO L129 PetriNetUnfolder]: 35/103 cut-off events. [2021-03-26 10:14:57,892 INFO L130 PetriNetUnfolder]: For 335/338 co-relation queries the response was YES. [2021-03-26 10:14:57,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 103 events. 35/103 cut-off events. For 335/338 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 387 event pairs, 7 based on Foata normal form. 1/88 useless extension candidates. Maximal degree in co-relation 343. Up to 45 conditions per place. [2021-03-26 10:14:57,894 INFO L142 LiptonReduction]: Number of co-enabled transitions 532 [2021-03-26 10:14:57,947 INFO L154 LiptonReduction]: Checked pairs total: 355 [2021-03-26 10:14:57,947 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:57,947 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 72 [2021-03-26 10:14:57,949 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 179 flow [2021-03-26 10:14:57,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 0 states have call successors, (0), 0 states 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:14:57,949 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:57,949 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:57,950 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:14:57,950 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:57,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:57,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1479929583, now seen corresponding path program 1 times [2021-03-26 10:14:57,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:57,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5476279] [2021-03-26 10:14:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:58,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:58,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:14:58,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:58,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:58,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:58,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:58,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:58,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:58,045 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:14:58,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5476279] [2021-03-26 10:14:58,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:58,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:14:58,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477519005] [2021-03-26 10:14:58,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:14:58,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:58,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:14:58,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:14:58,047 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 198 [2021-03-26 10:14:58,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 150.83333333333334) internal successors, (905), 6 states have internal predecessors, (905), 0 states have call successors, (0), 0 states 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:14:58,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:58,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 198 [2021-03-26 10:14:58,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:58,152 INFO L129 PetriNetUnfolder]: 43/127 cut-off events. [2021-03-26 10:14:58,152 INFO L130 PetriNetUnfolder]: For 362/365 co-relation queries the response was YES. [2021-03-26 10:14:58,153 INFO L84 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 127 events. 43/127 cut-off events. For 362/365 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 475 event pairs, 5 based on Foata normal form. 3/120 useless extension candidates. Maximal degree in co-relation 424. Up to 60 conditions per place. [2021-03-26 10:14:58,155 INFO L132 encePairwiseOnDemand]: 190/198 looper letters, 12 selfloop transitions, 12 changer transitions 0/44 dead transitions. [2021-03-26 10:14:58,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 44 transitions, 265 flow [2021-03-26 10:14:58,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:14:58,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:14:58,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 766 transitions. [2021-03-26 10:14:58,158 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7737373737373737 [2021-03-26 10:14:58,158 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 766 transitions. [2021-03-26 10:14:58,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 766 transitions. [2021-03-26 10:14:58,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:58,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 766 transitions. [2021-03-26 10:14:58,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.2) internal successors, (766), 5 states have internal predecessors, (766), 0 states have call successors, (0), 0 states 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:14:58,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:58,162 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:58,162 INFO L185 Difference]: Start difference. First operand has 51 places, 37 transitions, 179 flow. Second operand 5 states and 766 transitions. [2021-03-26 10:14:58,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 44 transitions, 265 flow [2021-03-26 10:14:58,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 44 transitions, 247 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:58,167 INFO L241 Difference]: Finished difference. Result has 55 places, 42 transitions, 235 flow [2021-03-26 10:14:58,168 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2021-03-26 10:14:58,168 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places. [2021-03-26 10:14:58,168 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:58,168 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 42 transitions, 235 flow [2021-03-26 10:14:58,168 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 42 transitions, 235 flow [2021-03-26 10:14:58,169 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 42 transitions, 235 flow [2021-03-26 10:14:58,183 INFO L129 PetriNetUnfolder]: 37/108 cut-off events. [2021-03-26 10:14:58,183 INFO L130 PetriNetUnfolder]: For 324/337 co-relation queries the response was YES. [2021-03-26 10:14:58,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 108 events. 37/108 cut-off events. For 324/337 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 389 event pairs, 7 based on Foata normal form. 4/99 useless extension candidates. Maximal degree in co-relation 360. Up to 51 conditions per place. [2021-03-26 10:14:58,185 INFO L142 LiptonReduction]: Number of co-enabled transitions 614 [2021-03-26 10:14:58,192 INFO L154 LiptonReduction]: Checked pairs total: 501 [2021-03-26 10:14:58,192 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:58,192 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-26 10:14:58,194 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 235 flow [2021-03-26 10:14:58,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 150.83333333333334) internal successors, (905), 6 states have internal predecessors, (905), 0 states have call successors, (0), 0 states 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:14:58,195 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:58,195 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:58,195 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:14:58,195 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:58,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:58,195 INFO L82 PathProgramCache]: Analyzing trace with hash -973634099, now seen corresponding path program 2 times [2021-03-26 10:14:58,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:58,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080631956] [2021-03-26 10:14:58,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:58,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:58,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:58,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:58,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:14:58,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:58,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:14:58,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:58,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:14:58,360 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:14:58,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080631956] [2021-03-26 10:14:58,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:58,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:14:58,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354432289] [2021-03-26 10:14:58,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:14:58,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:58,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:14:58,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:14:58,363 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 198 [2021-03-26 10:14:58,364 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states 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:14:58,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:58,365 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 198 [2021-03-26 10:14:58,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:58,563 INFO L129 PetriNetUnfolder]: 37/117 cut-off events. [2021-03-26 10:14:58,564 INFO L130 PetriNetUnfolder]: For 346/350 co-relation queries the response was YES. [2021-03-26 10:14:58,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 117 events. 37/117 cut-off events. For 346/350 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 422 event pairs, 5 based on Foata normal form. 3/111 useless extension candidates. Maximal degree in co-relation 419. Up to 46 conditions per place. [2021-03-26 10:14:58,567 INFO L132 encePairwiseOnDemand]: 192/198 looper letters, 12 selfloop transitions, 16 changer transitions 0/48 dead transitions. [2021-03-26 10:14:58,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 333 flow [2021-03-26 10:14:58,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:14:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:14:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 764 transitions. [2021-03-26 10:14:58,570 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7717171717171717 [2021-03-26 10:14:58,570 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 764 transitions. [2021-03-26 10:14:58,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 764 transitions. [2021-03-26 10:14:58,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:58,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 764 transitions. [2021-03-26 10:14:58,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:58,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:58,574 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:58,574 INFO L185 Difference]: Start difference. First operand has 55 places, 42 transitions, 235 flow. Second operand 5 states and 764 transitions. [2021-03-26 10:14:58,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 333 flow [2021-03-26 10:14:58,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 310 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-26 10:14:58,578 INFO L241 Difference]: Finished difference. Result has 58 places, 45 transitions, 292 flow [2021-03-26 10:14:58,578 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2021-03-26 10:14:58,578 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 1 predicate places. [2021-03-26 10:14:58,578 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:58,578 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 45 transitions, 292 flow [2021-03-26 10:14:58,579 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 45 transitions, 292 flow [2021-03-26 10:14:58,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 45 transitions, 292 flow [2021-03-26 10:14:58,594 INFO L129 PetriNetUnfolder]: 30/98 cut-off events. [2021-03-26 10:14:58,594 INFO L130 PetriNetUnfolder]: For 365/370 co-relation queries the response was YES. [2021-03-26 10:14:58,595 INFO L84 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 98 events. 30/98 cut-off events. For 365/370 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 363 event pairs, 5 based on Foata normal form. 2/90 useless extension candidates. Maximal degree in co-relation 362. Up to 42 conditions per place. [2021-03-26 10:14:58,597 INFO L142 LiptonReduction]: Number of co-enabled transitions 668 [2021-03-26 10:14:58,775 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:14:59,134 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-26 10:14:59,248 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-26 10:14:59,258 INFO L154 LiptonReduction]: Checked pairs total: 1147 [2021-03-26 10:14:59,258 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:14:59,258 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 680 [2021-03-26 10:14:59,258 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 297 flow [2021-03-26 10:14:59,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states 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:14:59,259 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:59,259 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:59,259 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:14:59,260 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:59,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:59,260 INFO L82 PathProgramCache]: Analyzing trace with hash 165066440, now seen corresponding path program 1 times [2021-03-26 10:14:59,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:59,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616814456] [2021-03-26 10:14:59,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:59,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:59,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:59,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:59,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:59,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:59,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:59,329 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:14:59,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616814456] [2021-03-26 10:14:59,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:59,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:59,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747283182] [2021-03-26 10:14:59,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:14:59,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:59,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:14:59,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:14:59,331 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 199 [2021-03-26 10:14:59,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 297 flow. Second operand has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:59,332 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:59,332 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 199 [2021-03-26 10:14:59,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:59,448 INFO L129 PetriNetUnfolder]: 343/652 cut-off events. [2021-03-26 10:14:59,449 INFO L130 PetriNetUnfolder]: For 1841/2013 co-relation queries the response was YES. [2021-03-26 10:14:59,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2143 conditions, 652 events. 343/652 cut-off events. For 1841/2013 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 4032 event pairs, 146 based on Foata normal form. 76/620 useless extension candidates. Maximal degree in co-relation 2120. Up to 341 conditions per place. [2021-03-26 10:14:59,457 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 12 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2021-03-26 10:14:59,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 367 flow [2021-03-26 10:14:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:14:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:14:59,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 852 transitions. [2021-03-26 10:14:59,460 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8562814070351759 [2021-03-26 10:14:59,460 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 852 transitions. [2021-03-26 10:14:59,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 852 transitions. [2021-03-26 10:14:59,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:59,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 852 transitions. [2021-03-26 10:14:59,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.4) internal successors, (852), 5 states have internal predecessors, (852), 0 states have call successors, (0), 0 states 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:14:59,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states 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:14:59,464 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states 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:14:59,464 INFO L185 Difference]: Start difference. First operand has 58 places, 45 transitions, 297 flow. Second operand 5 states and 852 transitions. [2021-03-26 10:14:59,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 367 flow [2021-03-26 10:14:59,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 352 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:59,471 INFO L241 Difference]: Finished difference. Result has 64 places, 54 transitions, 365 flow [2021-03-26 10:14:59,471 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=282, 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=365, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2021-03-26 10:14:59,472 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2021-03-26 10:14:59,472 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:59,472 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 54 transitions, 365 flow [2021-03-26 10:14:59,472 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 54 transitions, 365 flow [2021-03-26 10:14:59,473 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 54 transitions, 365 flow [2021-03-26 10:14:59,544 INFO L129 PetriNetUnfolder]: 331/608 cut-off events. [2021-03-26 10:14:59,544 INFO L130 PetriNetUnfolder]: For 2026/2154 co-relation queries the response was YES. [2021-03-26 10:14:59,548 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 608 events. 331/608 cut-off events. For 2026/2154 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 3485 event pairs, 142 based on Foata normal form. 12/532 useless extension candidates. Maximal degree in co-relation 2380. Up to 334 conditions per place. [2021-03-26 10:14:59,554 INFO L142 LiptonReduction]: Number of co-enabled transitions 904 [2021-03-26 10:14:59,615 INFO L154 LiptonReduction]: Checked pairs total: 523 [2021-03-26 10:14:59,615 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:59,615 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 143 [2021-03-26 10:14:59,616 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 365 flow [2021-03-26 10:14:59,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:59,616 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:59,616 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:14:59,617 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:14:59,617 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:59,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:59,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1915850499, now seen corresponding path program 1 times [2021-03-26 10:14:59,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:59,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405030507] [2021-03-26 10:14:59,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:59,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:59,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:59,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:59,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:59,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:59,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:14:59,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:59,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:14:59,736 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:14:59,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405030507] [2021-03-26 10:14:59,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:59,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:14:59,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147508306] [2021-03-26 10:14:59,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:14:59,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:59,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:14:59,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:14:59,738 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 199 [2021-03-26 10:14:59,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 365 flow. Second operand has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states 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:14:59,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:59,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 199 [2021-03-26 10:14:59,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:59,941 INFO L129 PetriNetUnfolder]: 462/861 cut-off events. [2021-03-26 10:14:59,941 INFO L130 PetriNetUnfolder]: For 3786/4326 co-relation queries the response was YES. [2021-03-26 10:14:59,947 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 861 events. 462/861 cut-off events. For 3786/4326 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 5732 event pairs, 171 based on Foata normal form. 60/774 useless extension candidates. Maximal degree in co-relation 3469. Up to 540 conditions per place. [2021-03-26 10:14:59,953 INFO L132 encePairwiseOnDemand]: 194/199 looper letters, 15 selfloop transitions, 13 changer transitions 0/57 dead transitions. [2021-03-26 10:14:59,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 57 transitions, 451 flow [2021-03-26 10:14:59,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:14:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:14:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 760 transitions. [2021-03-26 10:14:59,956 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7638190954773869 [2021-03-26 10:14:59,956 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 760 transitions. [2021-03-26 10:14:59,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 760 transitions. [2021-03-26 10:14:59,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:59,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 760 transitions. [2021-03-26 10:14:59,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.0) internal successors, (760), 5 states have internal predecessors, (760), 0 states have call successors, (0), 0 states 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:14:59,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states 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:14:59,960 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states 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:14:59,960 INFO L185 Difference]: Start difference. First operand has 64 places, 54 transitions, 365 flow. Second operand 5 states and 760 transitions. [2021-03-26 10:14:59,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 57 transitions, 451 flow [2021-03-26 10:14:59,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 57 transitions, 446 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:59,967 INFO L241 Difference]: Finished difference. Result has 68 places, 54 transitions, 400 flow [2021-03-26 10:14:59,968 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=400, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2021-03-26 10:14:59,968 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2021-03-26 10:14:59,968 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:59,968 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 54 transitions, 400 flow [2021-03-26 10:14:59,968 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 54 transitions, 400 flow [2021-03-26 10:14:59,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 54 transitions, 400 flow [2021-03-26 10:15:00,096 INFO L129 PetriNetUnfolder]: 414/763 cut-off events. [2021-03-26 10:15:00,096 INFO L130 PetriNetUnfolder]: For 2459/2776 co-relation queries the response was YES. [2021-03-26 10:15:00,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2918 conditions, 763 events. 414/763 cut-off events. For 2459/2776 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 4788 event pairs, 183 based on Foata normal form. 10/626 useless extension candidates. Maximal degree in co-relation 2891. Up to 512 conditions per place. [2021-03-26 10:15:00,108 INFO L142 LiptonReduction]: Number of co-enabled transitions 900 [2021-03-26 10:15:00,128 INFO L154 LiptonReduction]: Checked pairs total: 513 [2021-03-26 10:15:00,128 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:00,128 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 160 [2021-03-26 10:15:00,129 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 400 flow [2021-03-26 10:15:00,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states 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:15:00,129 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:00,129 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:15:00,130 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:15:00,130 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:00,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:00,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1771327414, now seen corresponding path program 1 times [2021-03-26 10:15:00,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:00,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088269962] [2021-03-26 10:15:00,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:00,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:00,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:00,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:00,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:00,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:00,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:00,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:00,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:00,223 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:15:00,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088269962] [2021-03-26 10:15:00,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:00,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:15:00,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527369673] [2021-03-26 10:15:00,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:15:00,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:00,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:15:00,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:15:00,225 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 199 [2021-03-26 10:15:00,227 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 54 transitions, 400 flow. Second operand has 5 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:00,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:00,227 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 199 [2021-03-26 10:15:00,228 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:00,363 INFO L129 PetriNetUnfolder]: 304/619 cut-off events. [2021-03-26 10:15:00,363 INFO L130 PetriNetUnfolder]: For 2397/3373 co-relation queries the response was YES. [2021-03-26 10:15:00,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2720 conditions, 619 events. 304/619 cut-off events. For 2397/3373 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 3918 event pairs, 58 based on Foata normal form. 138/655 useless extension candidates. Maximal degree in co-relation 2691. Up to 429 conditions per place. [2021-03-26 10:15:00,371 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 12 selfloop transitions, 19 changer transitions 0/67 dead transitions. [2021-03-26 10:15:00,371 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 538 flow [2021-03-26 10:15:00,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:15:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:15:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1193 transitions. [2021-03-26 10:15:00,375 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8564249820531228 [2021-03-26 10:15:00,375 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1193 transitions. [2021-03-26 10:15:00,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1193 transitions. [2021-03-26 10:15:00,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:00,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1193 transitions. [2021-03-26 10:15:00,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 170.42857142857142) internal successors, (1193), 7 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states 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:15:00,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states 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:15:00,381 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states 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:15:00,381 INFO L185 Difference]: Start difference. First operand has 68 places, 54 transitions, 400 flow. Second operand 7 states and 1193 transitions. [2021-03-26 10:15:00,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 538 flow [2021-03-26 10:15:00,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 494 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-03-26 10:15:00,388 INFO L241 Difference]: Finished difference. Result has 72 places, 63 transitions, 498 flow [2021-03-26 10:15:00,389 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=356, 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=498, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2021-03-26 10:15:00,389 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2021-03-26 10:15:00,389 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:00,389 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 63 transitions, 498 flow [2021-03-26 10:15:00,389 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 63 transitions, 498 flow [2021-03-26 10:15:00,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 63 transitions, 498 flow [2021-03-26 10:15:00,461 INFO L129 PetriNetUnfolder]: 307/618 cut-off events. [2021-03-26 10:15:00,461 INFO L130 PetriNetUnfolder]: For 2851/3482 co-relation queries the response was YES. [2021-03-26 10:15:00,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3065 conditions, 618 events. 307/618 cut-off events. For 2851/3482 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 3929 event pairs, 50 based on Foata normal form. 10/527 useless extension candidates. Maximal degree in co-relation 3037. Up to 429 conditions per place. [2021-03-26 10:15:00,472 INFO L142 LiptonReduction]: Number of co-enabled transitions 1074 [2021-03-26 10:15:00,483 INFO L154 LiptonReduction]: Checked pairs total: 575 [2021-03-26 10:15:00,483 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:00,483 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 94 [2021-03-26 10:15:00,485 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 498 flow [2021-03-26 10:15:00,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:00,486 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:00,486 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:15:00,486 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:15:00,486 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:00,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:00,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1047574259, now seen corresponding path program 1 times [2021-03-26 10:15:00,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:00,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063877966] [2021-03-26 10:15:00,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:00,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:00,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:00,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:00,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:00,525 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:15:00,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063877966] [2021-03-26 10:15:00,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:00,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:15:00,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116643275] [2021-03-26 10:15:00,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:15:00,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:00,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:15:00,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:15:00,527 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 199 [2021-03-26 10:15:00,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states 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:15:00,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:00,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 199 [2021-03-26 10:15:00,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:00,642 INFO L129 PetriNetUnfolder]: 469/897 cut-off events. [2021-03-26 10:15:00,643 INFO L130 PetriNetUnfolder]: For 4578/5825 co-relation queries the response was YES. [2021-03-26 10:15:00,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4495 conditions, 897 events. 469/897 cut-off events. For 4578/5825 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 5884 event pairs, 95 based on Foata normal form. 33/761 useless extension candidates. Maximal degree in co-relation 4465. Up to 670 conditions per place. [2021-03-26 10:15:00,651 INFO L132 encePairwiseOnDemand]: 196/199 looper letters, 3 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2021-03-26 10:15:00,651 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 63 transitions, 510 flow [2021-03-26 10:15:00,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:15:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:15:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2021-03-26 10:15:00,654 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8994974874371859 [2021-03-26 10:15:00,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 537 transitions. [2021-03-26 10:15:00,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 537 transitions. [2021-03-26 10:15:00,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:00,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 537 transitions. [2021-03-26 10:15:00,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:00,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states 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:15:00,657 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states 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:15:00,657 INFO L185 Difference]: Start difference. First operand has 72 places, 63 transitions, 498 flow. Second operand 3 states and 537 transitions. [2021-03-26 10:15:00,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 63 transitions, 510 flow [2021-03-26 10:15:00,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 63 transitions, 458 flow, removed 18 selfloop flow, removed 3 redundant places. [2021-03-26 10:15:00,672 INFO L241 Difference]: Finished difference. Result has 72 places, 63 transitions, 457 flow [2021-03-26 10:15:00,672 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=457, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2021-03-26 10:15:00,672 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2021-03-26 10:15:00,672 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:00,673 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 63 transitions, 457 flow [2021-03-26 10:15:00,673 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 63 transitions, 457 flow [2021-03-26 10:15:00,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 63 transitions, 457 flow [2021-03-26 10:15:00,772 INFO L129 PetriNetUnfolder]: 472/903 cut-off events. [2021-03-26 10:15:00,772 INFO L130 PetriNetUnfolder]: For 4195/4403 co-relation queries the response was YES. [2021-03-26 10:15:00,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4117 conditions, 903 events. 472/903 cut-off events. For 4195/4403 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 6127 event pairs, 79 based on Foata normal form. 13/753 useless extension candidates. Maximal degree in co-relation 4089. Up to 604 conditions per place. [2021-03-26 10:15:00,787 INFO L142 LiptonReduction]: Number of co-enabled transitions 1074 [2021-03-26 10:15:00,807 INFO L154 LiptonReduction]: Checked pairs total: 622 [2021-03-26 10:15:00,807 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:00,808 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 136 [2021-03-26 10:15:00,810 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 457 flow [2021-03-26 10:15:00,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states 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:15:00,811 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:00,811 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:15:00,811 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:15:00,811 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:00,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:00,811 INFO L82 PathProgramCache]: Analyzing trace with hash -236511910, now seen corresponding path program 1 times [2021-03-26 10:15:00,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:00,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683750222] [2021-03-26 10:15:00,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:00,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:00,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:00,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:00,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:00,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:00,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:00,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:00,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:00,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:00,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:00,901 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:15:00,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683750222] [2021-03-26 10:15:00,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:00,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:15:00,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516764287] [2021-03-26 10:15:00,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:15:00,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:00,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:15:00,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:15:00,903 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 199 [2021-03-26 10:15:00,904 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 457 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:15:00,904 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:00,904 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 199 [2021-03-26 10:15:00,905 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:01,071 INFO L129 PetriNetUnfolder]: 339/679 cut-off events. [2021-03-26 10:15:01,072 INFO L130 PetriNetUnfolder]: For 3873/5438 co-relation queries the response was YES. [2021-03-26 10:15:01,075 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3502 conditions, 679 events. 339/679 cut-off events. For 3873/5438 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 4296 event pairs, 12 based on Foata normal form. 185/720 useless extension candidates. Maximal degree in co-relation 3472. Up to 481 conditions per place. [2021-03-26 10:15:01,078 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 7 selfloop transitions, 28 changer transitions 4/71 dead transitions. [2021-03-26 10:15:01,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 71 transitions, 612 flow [2021-03-26 10:15:01,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 10:15:01,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 10:15:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1534 transitions. [2021-03-26 10:15:01,082 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8565047459519821 [2021-03-26 10:15:01,082 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1534 transitions. [2021-03-26 10:15:01,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1534 transitions. [2021-03-26 10:15:01,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:01,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1534 transitions. [2021-03-26 10:15:01,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 170.44444444444446) internal successors, (1534), 9 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states 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:15:01,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states 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:15:01,090 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states 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:15:01,090 INFO L185 Difference]: Start difference. First operand has 72 places, 63 transitions, 457 flow. Second operand 9 states and 1534 transitions. [2021-03-26 10:15:01,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 71 transitions, 612 flow [2021-03-26 10:15:01,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 71 transitions, 589 flow, removed 7 selfloop flow, removed 3 redundant places. [2021-03-26 10:15:01,097 INFO L241 Difference]: Finished difference. Result has 80 places, 67 transitions, 567 flow [2021-03-26 10:15:01,097 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=567, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2021-03-26 10:15:01,097 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2021-03-26 10:15:01,097 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:01,097 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 67 transitions, 567 flow [2021-03-26 10:15:01,098 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 67 transitions, 567 flow [2021-03-26 10:15:01,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 67 transitions, 567 flow [2021-03-26 10:15:01,203 INFO L129 PetriNetUnfolder]: 303/632 cut-off events. [2021-03-26 10:15:01,203 INFO L130 PetriNetUnfolder]: For 4083/4438 co-relation queries the response was YES. [2021-03-26 10:15:01,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 632 events. 303/632 cut-off events. For 4083/4438 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 4075 event pairs, 12 based on Foata normal form. 5/497 useless extension candidates. Maximal degree in co-relation 3465. Up to 433 conditions per place. [2021-03-26 10:15:01,213 INFO L142 LiptonReduction]: Number of co-enabled transitions 1124 [2021-03-26 10:15:01,223 INFO L154 LiptonReduction]: Checked pairs total: 711 [2021-03-26 10:15:01,223 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:01,223 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 126 [2021-03-26 10:15:01,224 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 567 flow [2021-03-26 10:15:01,224 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:15:01,224 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:01,224 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:15:01,225 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:15:01,225 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:01,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:01,225 INFO L82 PathProgramCache]: Analyzing trace with hash -80337942, now seen corresponding path program 1 times [2021-03-26 10:15:01,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:01,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987974777] [2021-03-26 10:15:01,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:01,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:01,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:01,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:01,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:01,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:01,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:01,290 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:15:01,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987974777] [2021-03-26 10:15:01,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:01,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:15:01,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608660896] [2021-03-26 10:15:01,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:15:01,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:01,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:15:01,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:15:01,292 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 199 [2021-03-26 10:15:01,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 567 flow. Second operand has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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:15:01,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:01,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 199 [2021-03-26 10:15:01,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:01,453 INFO L129 PetriNetUnfolder]: 609/1257 cut-off events. [2021-03-26 10:15:01,453 INFO L130 PetriNetUnfolder]: For 8433/9486 co-relation queries the response was YES. [2021-03-26 10:15:01,461 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6929 conditions, 1257 events. 609/1257 cut-off events. For 8433/9486 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 9707 event pairs, 22 based on Foata normal form. 16/1026 useless extension candidates. Maximal degree in co-relation 6896. Up to 869 conditions per place. [2021-03-26 10:15:01,466 INFO L132 encePairwiseOnDemand]: 196/199 looper letters, 4 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2021-03-26 10:15:01,466 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 69 transitions, 597 flow [2021-03-26 10:15:01,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:15:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:15:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 707 transitions. [2021-03-26 10:15:01,469 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8881909547738693 [2021-03-26 10:15:01,469 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 707 transitions. [2021-03-26 10:15:01,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 707 transitions. [2021-03-26 10:15:01,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:01,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 707 transitions. [2021-03-26 10:15:01,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states 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:15:01,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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:15:01,472 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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:15:01,473 INFO L185 Difference]: Start difference. First operand has 80 places, 67 transitions, 567 flow. Second operand 4 states and 707 transitions. [2021-03-26 10:15:01,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 69 transitions, 597 flow [2021-03-26 10:15:01,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 69 transitions, 500 flow, removed 34 selfloop flow, removed 4 redundant places. [2021-03-26 10:15:01,532 INFO L241 Difference]: Finished difference. Result has 81 places, 68 transitions, 483 flow [2021-03-26 10:15:01,533 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=483, PETRI_PLACES=81, PETRI_TRANSITIONS=68} [2021-03-26 10:15:01,533 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2021-03-26 10:15:01,533 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:01,533 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 68 transitions, 483 flow [2021-03-26 10:15:01,533 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 68 transitions, 483 flow [2021-03-26 10:15:01,534 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 68 transitions, 483 flow [2021-03-26 10:15:01,642 INFO L129 PetriNetUnfolder]: 608/1255 cut-off events. [2021-03-26 10:15:01,642 INFO L130 PetriNetUnfolder]: For 4162/4240 co-relation queries the response was YES. [2021-03-26 10:15:01,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4817 conditions, 1255 events. 608/1255 cut-off events. For 4162/4240 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 9719 event pairs, 24 based on Foata normal form. 7/987 useless extension candidates. Maximal degree in co-relation 4784. Up to 419 conditions per place. [2021-03-26 10:15:01,663 INFO L142 LiptonReduction]: Number of co-enabled transitions 1156 [2021-03-26 10:15:01,685 INFO L154 LiptonReduction]: Checked pairs total: 384 [2021-03-26 10:15:01,686 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:01,686 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 153 [2021-03-26 10:15:01,686 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 68 transitions, 483 flow [2021-03-26 10:15:01,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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:15:01,687 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:01,687 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:15:01,687 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:15:01,687 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:01,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:01,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2101773162, now seen corresponding path program 2 times [2021-03-26 10:15:01,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:01,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202961427] [2021-03-26 10:15:01,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:01,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:01,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:01,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:01,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:01,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:01,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:01,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:01,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:01,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:01,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:01,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:01,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:01,780 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:15:01,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202961427] [2021-03-26 10:15:01,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:01,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:15:01,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325551161] [2021-03-26 10:15:01,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:15:01,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:01,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:15:01,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:15:01,783 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 199 [2021-03-26 10:15:01,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 68 transitions, 483 flow. Second operand has 7 states, 7 states have (on average 166.85714285714286) internal successors, (1168), 7 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states 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:15:01,784 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:01,784 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 199 [2021-03-26 10:15:01,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:02,012 INFO L129 PetriNetUnfolder]: 549/1138 cut-off events. [2021-03-26 10:15:02,013 INFO L130 PetriNetUnfolder]: For 4710/7463 co-relation queries the response was YES. [2021-03-26 10:15:02,019 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5068 conditions, 1138 events. 549/1138 cut-off events. For 4710/7463 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 8684 event pairs, 0 based on Foata normal form. 353/1254 useless extension candidates. Maximal degree in co-relation 5033. Up to 400 conditions per place. [2021-03-26 10:15:02,023 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 2 selfloop transitions, 33 changer transitions 4/71 dead transitions. [2021-03-26 10:15:02,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 71 transitions, 591 flow [2021-03-26 10:15:02,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 10:15:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 10:15:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1867 transitions. [2021-03-26 10:15:02,028 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8529008679762449 [2021-03-26 10:15:02,028 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1867 transitions. [2021-03-26 10:15:02,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1867 transitions. [2021-03-26 10:15:02,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:02,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1867 transitions. [2021-03-26 10:15:02,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 169.72727272727272) internal successors, (1867), 11 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states 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:15:02,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 199.0) internal successors, (2388), 12 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states 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:15:02,049 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 199.0) internal successors, (2388), 12 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states 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:15:02,050 INFO L185 Difference]: Start difference. First operand has 81 places, 68 transitions, 483 flow. Second operand 11 states and 1867 transitions. [2021-03-26 10:15:02,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 71 transitions, 591 flow [2021-03-26 10:15:02,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 71 transitions, 563 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-03-26 10:15:02,077 INFO L241 Difference]: Finished difference. Result has 90 places, 67 transitions, 523 flow [2021-03-26 10:15:02,077 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=523, PETRI_PLACES=90, PETRI_TRANSITIONS=67} [2021-03-26 10:15:02,077 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2021-03-26 10:15:02,077 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:02,077 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 67 transitions, 523 flow [2021-03-26 10:15:02,078 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 67 transitions, 523 flow [2021-03-26 10:15:02,079 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 67 transitions, 523 flow [2021-03-26 10:15:02,172 INFO L129 PetriNetUnfolder]: 525/1106 cut-off events. [2021-03-26 10:15:02,172 INFO L130 PetriNetUnfolder]: For 4019/4500 co-relation queries the response was YES. [2021-03-26 10:15:02,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4909 conditions, 1106 events. 525/1106 cut-off events. For 4019/4500 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 8608 event pairs, 0 based on Foata normal form. 7/861 useless extension candidates. Maximal degree in co-relation 4874. Up to 400 conditions per place. [2021-03-26 10:15:02,192 INFO L142 LiptonReduction]: Number of co-enabled transitions 1126 [2021-03-26 10:15:03,056 WARN L205 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-26 10:15:03,277 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 10:15:04,579 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 339 DAG size of output: 260 [2021-03-26 10:15:05,118 WARN L205 SmtUtils]: Spent 528.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-03-26 10:15:05,443 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:15:05,682 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:15:06,175 WARN L205 SmtUtils]: Spent 490.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 10:15:06,658 WARN L205 SmtUtils]: Spent 482.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 10:15:06,674 INFO L154 LiptonReduction]: Checked pairs total: 1011 [2021-03-26 10:15:06,674 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 10:15:06,674 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4597 [2021-03-26 10:15:06,675 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 61 transitions, 483 flow [2021-03-26 10:15:06,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 166.85714285714286) internal successors, (1168), 7 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states 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:15:06,675 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:06,676 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:15:06,676 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:15:06,676 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:06,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:06,676 INFO L82 PathProgramCache]: Analyzing trace with hash 256399871, now seen corresponding path program 1 times [2021-03-26 10:15:06,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:06,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787275708] [2021-03-26 10:15:06,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:06,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:06,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:15:06,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:06,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:15:06,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:06,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:15:06,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:06,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:15:06,751 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:15:06,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787275708] [2021-03-26 10:15:06,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:06,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:15:06,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351661532] [2021-03-26 10:15:06,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:15:06,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:06,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:15:06,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:15:06,754 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 201 [2021-03-26 10:15:06,754 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 61 transitions, 483 flow. Second operand has 6 states, 6 states have (on average 152.33333333333334) internal successors, (914), 6 states have internal predecessors, (914), 0 states have call successors, (0), 0 states 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:15:06,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:06,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 201 [2021-03-26 10:15:06,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:06,928 INFO L129 PetriNetUnfolder]: 462/987 cut-off events. [2021-03-26 10:15:06,928 INFO L130 PetriNetUnfolder]: For 5911/6352 co-relation queries the response was YES. [2021-03-26 10:15:06,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4114 conditions, 987 events. 462/987 cut-off events. For 5911/6352 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 7012 event pairs, 1 based on Foata normal form. 36/896 useless extension candidates. Maximal degree in co-relation 4077. Up to 382 conditions per place. [2021-03-26 10:15:06,937 INFO L132 encePairwiseOnDemand]: 196/201 looper letters, 8 selfloop transitions, 3 changer transitions 27/67 dead transitions. [2021-03-26 10:15:06,937 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 67 transitions, 541 flow [2021-03-26 10:15:06,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:15:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:15:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1078 transitions. [2021-03-26 10:15:06,941 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7661691542288557 [2021-03-26 10:15:06,941 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1078 transitions. [2021-03-26 10:15:06,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1078 transitions. [2021-03-26 10:15:06,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:06,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1078 transitions. [2021-03-26 10:15:06,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states 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:15:06,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states 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:15:06,946 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states 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:15:06,946 INFO L185 Difference]: Start difference. First operand has 87 places, 61 transitions, 483 flow. Second operand 7 states and 1078 transitions. [2021-03-26 10:15:06,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 67 transitions, 541 flow [2021-03-26 10:15:06,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 454 flow, removed 28 selfloop flow, removed 13 redundant places. [2021-03-26 10:15:06,972 INFO L241 Difference]: Finished difference. Result has 73 places, 39 transitions, 222 flow [2021-03-26 10:15:06,972 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=73, PETRI_TRANSITIONS=39} [2021-03-26 10:15:06,972 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2021-03-26 10:15:06,972 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:06,973 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 39 transitions, 222 flow [2021-03-26 10:15:06,973 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 39 transitions, 222 flow [2021-03-26 10:15:06,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 39 transitions, 222 flow [2021-03-26 10:15:06,985 INFO L129 PetriNetUnfolder]: 55/143 cut-off events. [2021-03-26 10:15:06,985 INFO L130 PetriNetUnfolder]: For 346/371 co-relation queries the response was YES. [2021-03-26 10:15:06,986 INFO L84 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 143 events. 55/143 cut-off events. For 346/371 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 576 event pairs, 0 based on Foata normal form. 6/136 useless extension candidates. Maximal degree in co-relation 412. Up to 48 conditions per place. [2021-03-26 10:15:06,987 INFO L142 LiptonReduction]: Number of co-enabled transitions 298 [2021-03-26 10:15:07,229 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:15:07,681 WARN L205 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2021-03-26 10:15:07,822 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-03-26 10:15:08,095 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-26 10:15:08,224 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-26 10:15:08,282 INFO L154 LiptonReduction]: Checked pairs total: 101 [2021-03-26 10:15:08,282 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:15:08,282 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1310 [2021-03-26 10:15:08,283 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 37 transitions, 230 flow [2021-03-26 10:15:08,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 152.33333333333334) internal successors, (914), 6 states have internal predecessors, (914), 0 states have call successors, (0), 0 states 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:15:08,283 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:08,284 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:15:08,284 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 10:15:08,284 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:08,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:08,284 INFO L82 PathProgramCache]: Analyzing trace with hash 906285611, now seen corresponding path program 1 times [2021-03-26 10:15:08,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:08,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777416058] [2021-03-26 10:15:08,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:15:08,305 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:15:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:15:08,328 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:15:08,353 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:15:08,354 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:15:08,354 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 10:15:08,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:15:08 BasicIcfg [2021-03-26 10:15:08,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:15:08,443 INFO L168 Benchmark]: Toolchain (without parser) took 28568.06 ms. Allocated memory was 255.9 MB in the beginning and 792.7 MB in the end (delta: 536.9 MB). Free memory was 235.1 MB in the beginning and 638.5 MB in the end (delta: -403.3 MB). Peak memory consumption was 132.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:15:08,443 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:15:08,443 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.69 ms. Allocated memory was 255.9 MB in the beginning and 379.6 MB in the end (delta: 123.7 MB). Free memory was 234.7 MB in the beginning and 339.8 MB in the end (delta: -105.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:15:08,443 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.16 ms. Allocated memory is still 379.6 MB. Free memory was 339.8 MB in the beginning and 336.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:15:08,443 INFO L168 Benchmark]: Boogie Preprocessor took 36.59 ms. Allocated memory is still 379.6 MB. Free memory was 336.7 MB in the beginning and 334.6 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:15:08,444 INFO L168 Benchmark]: RCFGBuilder took 1792.44 ms. Allocated memory is still 379.6 MB. Free memory was 334.1 MB in the beginning and 254.5 MB in the end (delta: 79.7 MB). Peak memory consumption was 84.3 MB. Max. memory is 16.0 GB. [2021-03-26 10:15:08,444 INFO L168 Benchmark]: TraceAbstraction took 26208.42 ms. Allocated memory was 379.6 MB in the beginning and 792.7 MB in the end (delta: 413.1 MB). Free memory was 254.5 MB in the beginning and 638.5 MB in the end (delta: -384.0 MB). Peak memory consumption was 29.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:15:08,445 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.15 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 478.69 ms. Allocated memory was 255.9 MB in the beginning and 379.6 MB in the end (delta: 123.7 MB). Free memory was 234.7 MB in the beginning and 339.8 MB in the end (delta: -105.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 47.16 ms. Allocated memory is still 379.6 MB. Free memory was 339.8 MB in the beginning and 336.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 36.59 ms. Allocated memory is still 379.6 MB. Free memory was 336.7 MB in the beginning and 334.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1792.44 ms. Allocated memory is still 379.6 MB. Free memory was 334.1 MB in the beginning and 254.5 MB in the end (delta: 79.7 MB). Peak memory consumption was 84.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 26208.42 ms. Allocated memory was 379.6 MB in the beginning and 792.7 MB in the end (delta: 413.1 MB). Free memory was 254.5 MB in the beginning and 638.5 MB in the end (delta: -384.0 MB). Peak memory consumption was 29.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8569.7ms, 120 PlacesBefore, 57 PlacesAfterwards, 109 TransitionsBefore, 45 TransitionsAfterwards, 2406 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, 4266 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2336, positive: 2237, positive conditional: 2237, positive unconditional: 0, negative: 99, negative conditional: 99, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2336, positive: 2237, positive conditional: 0, positive unconditional: 2237, negative: 99, negative conditional: 0, negative unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2336, positive: 2237, positive conditional: 0, positive unconditional: 2237, negative: 99, negative conditional: 0, negative unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1657, positive: 1612, positive conditional: 0, positive unconditional: 1612, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1657, positive: 1594, positive conditional: 0, positive unconditional: 1594, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 741, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 689, negative conditional: 0, negative unconditional: 689, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2336, positive: 625, positive conditional: 0, positive unconditional: 625, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 1657, unknown conditional: 0, unknown unconditional: 1657] , Statistics on independence cache: Total cache size (in pairs): 1657, Positive cache size: 1612, Positive conditional cache size: 0, Positive unconditional cache size: 1612, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3325.9ms, 53 PlacesBefore, 38 PlacesAfterwards, 37 TransitionsBefore, 27 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 1530 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 430, positive: 337, positive conditional: 337, positive unconditional: 0, negative: 93, negative conditional: 93, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 430, positive: 337, positive conditional: 47, positive unconditional: 290, negative: 93, negative conditional: 22, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 430, positive: 337, positive conditional: 47, positive unconditional: 290, negative: 93, negative conditional: 22, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 76, positive: 56, positive conditional: 7, positive unconditional: 49, negative: 20, negative conditional: 7, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 76, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 20, negative conditional: 7, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 350, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 336, negative conditional: 162, negative unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 430, positive: 281, positive conditional: 40, positive unconditional: 241, negative: 73, negative conditional: 15, negative unconditional: 58, unknown: 76, unknown conditional: 14, unknown unconditional: 62] , Statistics on independence cache: Total cache size (in pairs): 1733, Positive cache size: 1668, Positive conditional cache size: 7, Positive unconditional cache size: 1661, Negative cache size: 65, Negative conditional cache size: 7, Negative unconditional cache size: 58, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1318.4ms, 39 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1020 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 241, positive: 181, positive conditional: 181, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 241, positive: 181, positive conditional: 0, positive unconditional: 181, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 241, positive: 181, positive conditional: 0, positive unconditional: 181, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 11, positive conditional: 0, positive unconditional: 11, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 241, positive: 170, positive conditional: 0, positive unconditional: 170, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 1746, Positive cache size: 1679, Positive conditional cache size: 7, Positive unconditional cache size: 1672, Negative cache size: 67, Negative conditional cache size: 7, Negative unconditional cache size: 60, Eliminated conditions: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 68.7ms, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 314 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, positive: 55, positive conditional: 55, 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: 72, positive: 55, positive conditional: 6, positive unconditional: 49, 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: 72, positive: 55, positive conditional: 6, positive unconditional: 49, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, positive: 54, positive conditional: 6, positive unconditional: 48, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1749, Positive cache size: 1680, Positive conditional cache size: 7, Positive unconditional cache size: 1673, Negative cache size: 69, Negative conditional cache size: 7, Negative unconditional cache size: 62, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 744.2ms, 46 PlacesBefore, 46 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 580 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 115, positive: 86, positive conditional: 86, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 115, positive: 86, positive conditional: 7, positive unconditional: 79, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 115, positive: 86, positive conditional: 7, positive unconditional: 79, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 1, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 115, positive: 79, positive conditional: 6, positive unconditional: 73, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1756, Positive cache size: 1687, Positive conditional cache size: 8, Positive unconditional cache size: 1679, Negative cache size: 69, Negative conditional cache size: 7, Negative unconditional cache size: 62, Eliminated conditions: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.1ms, 51 PlacesBefore, 51 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 355 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97, positive: 80, positive conditional: 80, 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: 97, positive: 80, positive conditional: 27, positive unconditional: 53, 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: 97, positive: 80, positive conditional: 27, positive unconditional: 53, 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: 20, positive: 18, positive conditional: 13, positive unconditional: 5, 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: 20, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 97, positive: 62, positive conditional: 14, positive unconditional: 48, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 20, unknown conditional: 13, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 1776, Positive cache size: 1705, Positive conditional cache size: 21, Positive unconditional cache size: 1684, Negative cache size: 71, Negative conditional cache size: 7, Negative unconditional cache size: 64, Eliminated conditions: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.4ms, 55 PlacesBefore, 55 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 614 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 501 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, positive: 140, positive conditional: 140, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, positive: 140, positive conditional: 66, positive unconditional: 74, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, positive: 140, positive conditional: 66, positive unconditional: 74, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 11, 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: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 163, positive: 125, positive conditional: 55, positive unconditional: 70, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 15, unknown conditional: 11, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1791, Positive cache size: 1720, Positive conditional cache size: 32, Positive unconditional cache size: 1688, Negative cache size: 71, Negative conditional cache size: 7, Negative unconditional cache size: 64, Eliminated conditions: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 679.2ms, 58 PlacesBefore, 58 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 668 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1147 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 335, positive: 284, positive conditional: 284, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 335, positive: 284, positive conditional: 132, positive unconditional: 152, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 335, positive: 284, positive conditional: 132, positive unconditional: 152, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 6, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 335, positive: 275, positive conditional: 126, positive unconditional: 149, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 9, unknown conditional: 6, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1800, Positive cache size: 1729, Positive conditional cache size: 38, Positive unconditional cache size: 1691, Negative cache size: 71, Negative conditional cache size: 7, Negative unconditional cache size: 64, Eliminated conditions: 44 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 143.1ms, 64 PlacesBefore, 64 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 904 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 523 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 151, positive: 134, positive conditional: 134, 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: 151, positive: 134, positive conditional: 69, positive unconditional: 65, 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: 151, positive: 134, positive conditional: 69, positive unconditional: 65, 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: 16, positive: 16, positive conditional: 5, 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: 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: 151, positive: 118, positive conditional: 64, positive unconditional: 54, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 16, unknown conditional: 5, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 1816, Positive cache size: 1745, Positive conditional cache size: 43, Positive unconditional cache size: 1702, Negative cache size: 71, Negative conditional cache size: 7, Negative unconditional cache size: 64, Eliminated conditions: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 159.9ms, 68 PlacesBefore, 68 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 900 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 513 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, positive: 82, positive conditional: 82, 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: 99, positive: 82, positive conditional: 36, positive unconditional: 46, 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: 99, positive: 82, positive conditional: 36, positive unconditional: 46, 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: 99, positive: 82, positive conditional: 36, positive unconditional: 46, 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): 1816, Positive cache size: 1745, Positive conditional cache size: 43, Positive unconditional cache size: 1702, Negative cache size: 71, Negative conditional cache size: 7, Negative unconditional cache size: 64, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 93.9ms, 72 PlacesBefore, 72 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 1074 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 575 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 248, positive: 232, positive conditional: 232, 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: 248, positive: 232, positive conditional: 135, positive unconditional: 97, 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: 248, positive: 232, positive conditional: 135, positive unconditional: 97, 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: 3, positive: 3, positive conditional: 1, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 248, positive: 229, positive conditional: 134, positive unconditional: 95, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1819, Positive cache size: 1748, Positive conditional cache size: 44, Positive unconditional cache size: 1704, Negative cache size: 71, Negative conditional cache size: 7, Negative unconditional cache size: 64, Eliminated conditions: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 134.7ms, 72 PlacesBefore, 72 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 1074 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 622 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 216, positive: 199, positive conditional: 199, 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: 216, positive: 199, positive conditional: 96, positive unconditional: 103, 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: 216, positive: 199, positive conditional: 96, positive unconditional: 103, 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: 216, positive: 199, positive conditional: 96, positive unconditional: 103, 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): 1819, Positive cache size: 1748, Positive conditional cache size: 44, Positive unconditional cache size: 1704, Negative cache size: 71, Negative conditional cache size: 7, Negative unconditional cache size: 64, Eliminated conditions: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 125.6ms, 80 PlacesBefore, 80 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 711 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 207, positive: 189, positive conditional: 189, 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: 207, positive: 189, positive conditional: 127, positive unconditional: 62, 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: 207, positive: 189, positive conditional: 127, positive unconditional: 62, 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: 8, positive: 8, positive conditional: 8, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 207, positive: 181, positive conditional: 119, positive unconditional: 62, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1827, Positive cache size: 1756, Positive conditional cache size: 52, Positive unconditional cache size: 1704, Negative cache size: 71, Negative conditional cache size: 7, Negative unconditional cache size: 64, Eliminated conditions: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 152.5ms, 81 PlacesBefore, 81 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 1156 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 384 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 203, positive: 194, positive conditional: 194, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 203, positive: 194, positive conditional: 131, positive unconditional: 63, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203, positive: 194, positive conditional: 131, positive unconditional: 63, negative: 9, negative conditional: 0, negative unconditional: 9, 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: 203, positive: 194, positive conditional: 131, positive unconditional: 63, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1827, Positive cache size: 1756, Positive conditional cache size: 52, Positive unconditional cache size: 1704, Negative cache size: 71, Negative conditional cache size: 7, Negative unconditional cache size: 64, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4596.6ms, 90 PlacesBefore, 87 PlacesAfterwards, 67 TransitionsBefore, 61 TransitionsAfterwards, 1126 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 1011 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 635, positive: 611, positive conditional: 611, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 635, positive: 611, positive conditional: 462, positive unconditional: 149, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 635, positive: 611, positive conditional: 462, positive unconditional: 149, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 10, 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: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 635, positive: 601, positive conditional: 452, positive unconditional: 149, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1837, Positive cache size: 1766, Positive conditional cache size: 62, Positive unconditional cache size: 1704, Negative cache size: 71, Negative conditional cache size: 7, Negative unconditional cache size: 64, Eliminated conditions: 53 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1309.1ms, 73 PlacesBefore, 62 PlacesAfterwards, 39 TransitionsBefore, 37 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 101 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, positive: 85, positive conditional: 85, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 86, positive: 85, positive conditional: 34, positive unconditional: 51, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 86, positive: 85, positive conditional: 34, positive unconditional: 51, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 5, positive unconditional: 13, 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: 19, positive: 18, positive conditional: 0, positive unconditional: 18, 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: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, positive: 67, positive conditional: 29, positive unconditional: 38, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 19, unknown conditional: 5, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 1856, Positive cache size: 1784, Positive conditional cache size: 67, Positive unconditional cache size: 1717, Negative cache size: 72, Negative conditional cache size: 7, Negative unconditional cache size: 65, Eliminated conditions: 39 - 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 a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1485; [L837] FCALL, FORK 0 pthread_create(&t1485, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1486; [L839] FCALL, FORK 0 pthread_create(&t1486, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1487; [L841] FCALL, FORK 0 pthread_create(&t1487, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t1488; [L843] FCALL, FORK 0 pthread_create(&t1488, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L778] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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] [L781] 3 z = 1 [L784] 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) [L784] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L784] 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) [L784] 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) [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L786] 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 [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L788] 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 [L814] 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) [L814] 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) [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] 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 [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L818] 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 [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L849] 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) [L849] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L849] 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) [L849] 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) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 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 [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 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 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 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) [L860] 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) [L861] 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)) [L861] 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)) [L862] 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)) [L862] 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)) [L863] 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)) [L863] 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)) [L864] 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)) [L864] 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)) [L865] 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)) [L865] 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)) [L866] 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)) [L866] 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)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 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=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, 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, 112 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: 26011.2ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2427.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8642.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 60 SDtfs, 43 SDslu, 36 SDs, 0 SdLazy, 388 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 463.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 524.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=567occurred in iteration=12, InterpolantAutomatonStates: 80, 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: 51.5ms SsaConstructionTime, 479.2ms SatisfiabilityAnalysisTime, 1152.1ms InterpolantComputationTime, 286 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 1539 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...