/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/mix045_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:10:24,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:10:24,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:10:24,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:10:24,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:10:24,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:10:24,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:10:24,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:10:24,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:10:24,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:10:24,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:10:24,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:10:24,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:10:24,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:10:24,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:10:24,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:10:24,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:10:24,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:10:24,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:10:24,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:10:24,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:10:24,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:10:24,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:10:24,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:10:24,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:10:24,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:10:24,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:10:24,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:10:24,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:10:24,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:10:24,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:10:24,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:10:24,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:10:24,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:10:24,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:10:24,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:10:24,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:10:24,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:10:24,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:10:24,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:10:24,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:10:24,433 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:10:24,468 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:10:24,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:10:24,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:10:24,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:10:24,472 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:10:24,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:10:24,472 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:10:24,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:10:24,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:10:24,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:10:24,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:10:24,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:10:24,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:10:24,474 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:10:24,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:10:24,474 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:10:24,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:10:24,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:10:24,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:10:24,474 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:10:24,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:10:24,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:10:24,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:10:24,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:10:24,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:10:24,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:10:24,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:10:24,476 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:10:24,476 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:10:24,476 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:10:24,476 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:10:24,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:10:24,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:10:24,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:10:24,795 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:10:24,795 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:10:24,796 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2021-03-26 10:10:24,862 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472dfb9f3/e26bfcbc9d194787ab9d538494fb8768/FLAG6821115f1 [2021-03-26 10:10:25,542 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:10:25,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2021-03-26 10:10:25,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472dfb9f3/e26bfcbc9d194787ab9d538494fb8768/FLAG6821115f1 [2021-03-26 10:10:25,916 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472dfb9f3/e26bfcbc9d194787ab9d538494fb8768 [2021-03-26 10:10:25,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:10:25,920 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:10:25,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:10:25,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:10:25,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:10:25,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:10:25" (1/1) ... [2021-03-26 10:10:25,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9110135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:25, skipping insertion in model container [2021-03-26 10:10:25,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:10:25" (1/1) ... [2021-03-26 10:10:25,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:10:25,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:10:26,092 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i[948,961] [2021-03-26 10:10:26,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:10:26,338 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:10:26,349 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i[948,961] [2021-03-26 10:10:26,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:10:26,444 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:10:26,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:26 WrapperNode [2021-03-26 10:10:26,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:10:26,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:10:26,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:10:26,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:10:26,452 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:10:26" (1/1) ... [2021-03-26 10:10:26,466 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:10:26" (1/1) ... [2021-03-26 10:10:26,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:10:26,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:10:26,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:10:26,491 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:10:26,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:26" (1/1) ... [2021-03-26 10:10:26,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:26" (1/1) ... [2021-03-26 10:10:26,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:26" (1/1) ... [2021-03-26 10:10:26,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:26" (1/1) ... [2021-03-26 10:10:26,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:26" (1/1) ... [2021-03-26 10:10:26,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:26" (1/1) ... [2021-03-26 10:10:26,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:26" (1/1) ... [2021-03-26 10:10:26,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:10:26,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:10:26,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:10:26,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:10:26,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:26" (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:10:26,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:10:26,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:10:26,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:10:26,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:10:26,611 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:10:26,611 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:10:26,612 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:10:26,612 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:10:26,612 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:10:26,612 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:10:26,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:10:26,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:10:26,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:10:26,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:10:26,614 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:10:28,121 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:10:28,121 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:10:28,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:10:28 BoogieIcfgContainer [2021-03-26 10:10:28,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:10:28,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:10:28,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:10:28,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:10:28,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:10:25" (1/3) ... [2021-03-26 10:10:28,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59bcc94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:10:28, skipping insertion in model container [2021-03-26 10:10:28,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:26" (2/3) ... [2021-03-26 10:10:28,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59bcc94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:10:28, skipping insertion in model container [2021-03-26 10:10:28,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:10:28" (3/3) ... [2021-03-26 10:10:28,129 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_pso.opt.i [2021-03-26 10:10:28,135 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:10:28,139 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:10:28,139 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:10:28,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,176 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,176 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,177 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,177 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,179 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,179 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,185 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,185 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,185 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,185 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,186 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,186 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,193 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,193 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,197 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,197 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,201 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,201 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,202 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:28,206 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:10:28,224 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:10:28,245 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:10:28,245 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:10:28,245 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:10:28,245 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:10:28,245 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:10:28,246 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:10:28,246 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:10:28,246 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:10:28,255 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2021-03-26 10:10:28,308 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-26 10:10:28,309 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:28,312 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 10:10:28,312 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 100 transitions, 215 flow [2021-03-26 10:10:28,316 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 203 flow [2021-03-26 10:10:28,317 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:28,329 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-26 10:10:28,331 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-26 10:10:28,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 203 flow [2021-03-26 10:10:28,350 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-26 10:10:28,351 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:28,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 10:10:28,354 INFO L142 LiptonReduction]: Number of co-enabled transitions 1738 [2021-03-26 10:10:29,655 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-26 10:10:29,940 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:10:31,372 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 10:10:32,028 WARN L205 SmtUtils]: Spent 645.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:10:33,193 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:10:33,526 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:10:33,651 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:10:34,879 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:10:35,213 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:10:36,388 WARN L205 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 267 DAG size of output: 266 [2021-03-26 10:10:37,062 WARN L205 SmtUtils]: Spent 672.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 10:10:37,236 INFO L154 LiptonReduction]: Checked pairs total: 2726 [2021-03-26 10:10:37,236 INFO L156 LiptonReduction]: Total number of compositions: 67 [2021-03-26 10:10:37,238 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8922 [2021-03-26 10:10:37,247 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 10:10:37,247 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:37,247 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:37,248 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:37,248 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:37,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:37,256 INFO L82 PathProgramCache]: Analyzing trace with hash 429548733, now seen corresponding path program 1 times [2021-03-26 10:10:37,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:37,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046853772] [2021-03-26 10:10:37,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:37,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:37,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:37,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:37,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:37,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046853772] [2021-03-26 10:10:37,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:37,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:10:37,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746441578] [2021-03-26 10:10:37,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:10:37,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:37,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:10:37,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:10:37,489 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 167 [2021-03-26 10:10:37,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:37,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:37,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 167 [2021-03-26 10:10:37,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:37,603 INFO L129 PetriNetUnfolder]: 23/102 cut-off events. [2021-03-26 10:10:37,603 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:37,603 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 102 events. 23/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 3 based on Foata normal form. 5/99 useless extension candidates. Maximal degree in co-relation 139. Up to 37 conditions per place. [2021-03-26 10:10:37,612 INFO L132 encePairwiseOnDemand]: 163/167 looper letters, 7 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2021-03-26 10:10:37,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 113 flow [2021-03-26 10:10:37,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:37,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2021-03-26 10:10:37,623 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8902195608782435 [2021-03-26 10:10:37,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2021-03-26 10:10:37,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2021-03-26 10:10:37,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:37,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2021-03-26 10:10:37,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:37,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:37,637 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:37,638 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 3 states and 446 transitions. [2021-03-26 10:10:37,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 113 flow [2021-03-26 10:10:37,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 110 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:10:37,642 INFO L241 Difference]: Finished difference. Result has 46 places, 34 transitions, 78 flow [2021-03-26 10:10:37,643 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2021-03-26 10:10:37,644 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2021-03-26 10:10:37,644 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:37,644 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 34 transitions, 78 flow [2021-03-26 10:10:37,644 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 34 transitions, 78 flow [2021-03-26 10:10:37,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 78 flow [2021-03-26 10:10:37,656 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2021-03-26 10:10:37,656 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:37,657 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:10:37,657 INFO L142 LiptonReduction]: Number of co-enabled transitions 254 [2021-03-26 10:10:38,099 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:10:38,417 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:10:39,095 WARN L205 SmtUtils]: Spent 675.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:10:39,728 WARN L205 SmtUtils]: Spent 631.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:10:41,060 INFO L154 LiptonReduction]: Checked pairs total: 1054 [2021-03-26 10:10:41,060 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 10:10:41,060 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3416 [2021-03-26 10:10:41,061 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-03-26 10:10:41,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:41,062 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:41,062 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:41,062 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:10:41,062 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:41,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:41,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1980972199, now seen corresponding path program 1 times [2021-03-26 10:10:41,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:41,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788413691] [2021-03-26 10:10:41,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:41,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:41,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:41,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:41,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:41,198 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:10:41,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:10:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:41,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788413691] [2021-03-26 10:10:41,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:41,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:41,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343777439] [2021-03-26 10:10:41,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:10:41,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:41,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:10:41,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:10:41,217 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 178 [2021-03-26 10:10:41,218 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:41,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:41,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 178 [2021-03-26 10:10:41,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:41,240 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-26 10:10:41,240 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:41,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 35 events. 3/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 1 based on Foata normal form. 1/33 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2021-03-26 10:10:41,241 INFO L132 encePairwiseOnDemand]: 174/178 looper letters, 3 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2021-03-26 10:10:41,241 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 72 flow [2021-03-26 10:10:41,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2021-03-26 10:10:41,250 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8782771535580525 [2021-03-26 10:10:41,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2021-03-26 10:10:41,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2021-03-26 10:10:41,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:41,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2021-03-26 10:10:41,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:41,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:41,254 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:41,255 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 469 transitions. [2021-03-26 10:10:41,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 72 flow [2021-03-26 10:10:41,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 25 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:41,256 INFO L241 Difference]: Finished difference. Result has 33 places, 25 transitions, 71 flow [2021-03-26 10:10:41,256 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2021-03-26 10:10:41,256 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -16 predicate places. [2021-03-26 10:10:41,257 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:41,257 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 71 flow [2021-03-26 10:10:41,257 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 71 flow [2021-03-26 10:10:41,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 71 flow [2021-03-26 10:10:41,262 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 10:10:41,262 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:10:41,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 31 events. 3/31 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 42. Up to 10 conditions per place. [2021-03-26 10:10:41,263 INFO L142 LiptonReduction]: Number of co-enabled transitions 238 [2021-03-26 10:10:41,938 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-26 10:10:42,089 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 10:10:42,385 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-26 10:10:42,525 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 10:10:42,528 INFO L154 LiptonReduction]: Checked pairs total: 633 [2021-03-26 10:10:42,528 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:10:42,528 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1272 [2021-03-26 10:10:42,529 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 67 flow [2021-03-26 10:10:42,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:42,530 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:42,530 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:42,530 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:10:42,530 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:42,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:42,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1508873391, now seen corresponding path program 1 times [2021-03-26 10:10:42,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:42,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846025047] [2021-03-26 10:10:42,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:42,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:42,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:42,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:42,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:10:42,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:42,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:42,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:42,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:10:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:42,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846025047] [2021-03-26 10:10:42,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:42,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:10:42,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398212222] [2021-03-26 10:10:42,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:42,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:42,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:42,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:42,686 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 180 [2021-03-26 10:10:42,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:42,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:42,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 180 [2021-03-26 10:10:42,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:42,762 INFO L129 PetriNetUnfolder]: 66/150 cut-off events. [2021-03-26 10:10:42,762 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-03-26 10:10:42,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 150 events. 66/150 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 639 event pairs, 34 based on Foata normal form. 1/134 useless extension candidates. Maximal degree in co-relation 292. Up to 101 conditions per place. [2021-03-26 10:10:42,767 INFO L132 encePairwiseOnDemand]: 174/180 looper letters, 7 selfloop transitions, 7 changer transitions 0/30 dead transitions. [2021-03-26 10:10:42,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 111 flow [2021-03-26 10:10:42,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:10:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:10:42,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2021-03-26 10:10:42,771 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7819444444444444 [2021-03-26 10:10:42,771 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 563 transitions. [2021-03-26 10:10:42,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 563 transitions. [2021-03-26 10:10:42,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:42,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 563 transitions. [2021-03-26 10:10:42,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:42,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:42,778 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:42,778 INFO L185 Difference]: Start difference. First operand has 31 places, 23 transitions, 67 flow. Second operand 4 states and 563 transitions. [2021-03-26 10:10:42,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 111 flow [2021-03-26 10:10:42,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:10:42,781 INFO L241 Difference]: Finished difference. Result has 35 places, 29 transitions, 112 flow [2021-03-26 10:10:42,781 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2021-03-26 10:10:42,781 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -14 predicate places. [2021-03-26 10:10:42,781 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:42,781 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 112 flow [2021-03-26 10:10:42,782 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 112 flow [2021-03-26 10:10:42,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 112 flow [2021-03-26 10:10:42,797 INFO L129 PetriNetUnfolder]: 18/71 cut-off events. [2021-03-26 10:10:42,797 INFO L130 PetriNetUnfolder]: For 29/32 co-relation queries the response was YES. [2021-03-26 10:10:42,797 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 71 events. 18/71 cut-off events. For 29/32 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 257 event pairs, 8 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 155. Up to 31 conditions per place. [2021-03-26 10:10:42,798 INFO L142 LiptonReduction]: Number of co-enabled transitions 300 [2021-03-26 10:10:42,800 INFO L154 LiptonReduction]: Checked pairs total: 120 [2021-03-26 10:10:42,800 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:42,801 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-26 10:10:42,802 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 112 flow [2021-03-26 10:10:42,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:42,802 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:42,802 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:42,802 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:10:42,803 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:42,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:42,803 INFO L82 PathProgramCache]: Analyzing trace with hash -2024545157, now seen corresponding path program 1 times [2021-03-26 10:10:42,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:42,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064575814] [2021-03-26 10:10:42,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:42,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:42,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:42,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:42,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:42,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064575814] [2021-03-26 10:10:42,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:42,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:10:42,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421195892] [2021-03-26 10:10:42,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:10:42,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:42,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:10:42,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:10:42,895 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 180 [2021-03-26 10:10:42,896 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:42,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:42,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 180 [2021-03-26 10:10:42,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:42,927 INFO L129 PetriNetUnfolder]: 22/89 cut-off events. [2021-03-26 10:10:42,928 INFO L130 PetriNetUnfolder]: For 113/191 co-relation queries the response was YES. [2021-03-26 10:10:42,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 89 events. 22/89 cut-off events. For 113/191 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 8 based on Foata normal form. 7/85 useless extension candidates. Maximal degree in co-relation 204. Up to 37 conditions per place. [2021-03-26 10:10:42,929 INFO L132 encePairwiseOnDemand]: 177/180 looper letters, 4 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-26 10:10:42,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 126 flow [2021-03-26 10:10:42,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2021-03-26 10:10:42,933 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-03-26 10:10:42,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2021-03-26 10:10:42,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2021-03-26 10:10:42,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:42,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2021-03-26 10:10:42,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:42,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:42,937 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:42,937 INFO L185 Difference]: Start difference. First operand has 35 places, 29 transitions, 112 flow. Second operand 3 states and 480 transitions. [2021-03-26 10:10:42,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 126 flow [2021-03-26 10:10:42,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 126 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:10:42,939 INFO L241 Difference]: Finished difference. Result has 38 places, 29 transitions, 125 flow [2021-03-26 10:10:42,939 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2021-03-26 10:10:42,939 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -11 predicate places. [2021-03-26 10:10:42,939 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:42,939 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 125 flow [2021-03-26 10:10:42,940 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 125 flow [2021-03-26 10:10:42,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 125 flow [2021-03-26 10:10:42,952 INFO L129 PetriNetUnfolder]: 18/85 cut-off events. [2021-03-26 10:10:42,952 INFO L130 PetriNetUnfolder]: For 65/95 co-relation queries the response was YES. [2021-03-26 10:10:42,952 INFO L84 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 85 events. 18/85 cut-off events. For 65/95 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 8 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 190. Up to 33 conditions per place. [2021-03-26 10:10:42,954 INFO L142 LiptonReduction]: Number of co-enabled transitions 300 [2021-03-26 10:10:42,956 INFO L154 LiptonReduction]: Checked pairs total: 186 [2021-03-26 10:10:42,957 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:42,957 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-26 10:10:42,958 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 125 flow [2021-03-26 10:10:42,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:42,958 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:42,958 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:42,958 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:10:42,959 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:42,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:42,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1499624061, now seen corresponding path program 1 times [2021-03-26 10:10:42,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:42,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417606160] [2021-03-26 10:10:42,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:43,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:43,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:43,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:43,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:43,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:43,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:43,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417606160] [2021-03-26 10:10:43,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:43,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:43,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324437528] [2021-03-26 10:10:43,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:43,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:43,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:43,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:43,070 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 180 [2021-03-26 10:10:43,070 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,070 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:43,071 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 180 [2021-03-26 10:10:43,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:43,147 INFO L129 PetriNetUnfolder]: 48/145 cut-off events. [2021-03-26 10:10:43,148 INFO L130 PetriNetUnfolder]: For 176/203 co-relation queries the response was YES. [2021-03-26 10:10:43,148 INFO L84 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 145 events. 48/145 cut-off events. For 176/203 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 682 event pairs, 32 based on Foata normal form. 5/138 useless extension candidates. Maximal degree in co-relation 390. Up to 89 conditions per place. [2021-03-26 10:10:43,149 INFO L132 encePairwiseOnDemand]: 175/180 looper letters, 8 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2021-03-26 10:10:43,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 158 flow [2021-03-26 10:10:43,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:10:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:10:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 558 transitions. [2021-03-26 10:10:43,152 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.775 [2021-03-26 10:10:43,152 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 558 transitions. [2021-03-26 10:10:43,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 558 transitions. [2021-03-26 10:10:43,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:43,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 558 transitions. [2021-03-26 10:10:43,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,156 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,156 INFO L185 Difference]: Start difference. First operand has 38 places, 29 transitions, 125 flow. Second operand 4 states and 558 transitions. [2021-03-26 10:10:43,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 158 flow [2021-03-26 10:10:43,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 153 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:10:43,159 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 144 flow [2021-03-26 10:10:43,160 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2021-03-26 10:10:43,160 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -8 predicate places. [2021-03-26 10:10:43,160 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:43,160 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 144 flow [2021-03-26 10:10:43,161 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 144 flow [2021-03-26 10:10:43,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 144 flow [2021-03-26 10:10:43,174 INFO L129 PetriNetUnfolder]: 20/87 cut-off events. [2021-03-26 10:10:43,174 INFO L130 PetriNetUnfolder]: For 93/105 co-relation queries the response was YES. [2021-03-26 10:10:43,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 87 events. 20/87 cut-off events. For 93/105 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 359 event pairs, 2 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 224. Up to 30 conditions per place. [2021-03-26 10:10:43,175 INFO L142 LiptonReduction]: Number of co-enabled transitions 302 [2021-03-26 10:10:43,228 INFO L154 LiptonReduction]: Checked pairs total: 206 [2021-03-26 10:10:43,228 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:43,229 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 69 [2021-03-26 10:10:43,229 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 144 flow [2021-03-26 10:10:43,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,230 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:43,230 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:43,230 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:10:43,230 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:43,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:43,231 INFO L82 PathProgramCache]: Analyzing trace with hash 191008805, now seen corresponding path program 1 times [2021-03-26 10:10:43,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:43,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295723248] [2021-03-26 10:10:43,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:43,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:43,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:43,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295723248] [2021-03-26 10:10:43,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:43,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:10:43,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30113372] [2021-03-26 10:10:43,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:10:43,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:43,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:10:43,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:10:43,312 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 180 [2021-03-26 10:10:43,312 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,312 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:43,312 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 180 [2021-03-26 10:10:43,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:43,337 INFO L129 PetriNetUnfolder]: 20/79 cut-off events. [2021-03-26 10:10:43,337 INFO L130 PetriNetUnfolder]: For 175/190 co-relation queries the response was YES. [2021-03-26 10:10:43,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 79 events. 20/79 cut-off events. For 175/190 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 297 event pairs, 4 based on Foata normal form. 1/71 useless extension candidates. Maximal degree in co-relation 226. Up to 32 conditions per place. [2021-03-26 10:10:43,338 INFO L132 encePairwiseOnDemand]: 177/180 looper letters, 1 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-03-26 10:10:43,338 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 30 transitions, 152 flow [2021-03-26 10:10:43,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2021-03-26 10:10:43,341 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8851851851851852 [2021-03-26 10:10:43,341 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 478 transitions. [2021-03-26 10:10:43,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions. [2021-03-26 10:10:43,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:43,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions. [2021-03-26 10:10:43,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,345 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,345 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 144 flow. Second operand 3 states and 478 transitions. [2021-03-26 10:10:43,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 30 transitions, 152 flow [2021-03-26 10:10:43,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 143 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:43,349 INFO L241 Difference]: Finished difference. Result has 42 places, 30 transitions, 146 flow [2021-03-26 10:10:43,349 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2021-03-26 10:10:43,350 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2021-03-26 10:10:43,350 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:43,350 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 30 transitions, 146 flow [2021-03-26 10:10:43,350 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 30 transitions, 146 flow [2021-03-26 10:10:43,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 146 flow [2021-03-26 10:10:43,365 INFO L129 PetriNetUnfolder]: 20/81 cut-off events. [2021-03-26 10:10:43,366 INFO L130 PetriNetUnfolder]: For 132/141 co-relation queries the response was YES. [2021-03-26 10:10:43,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 81 events. 20/81 cut-off events. For 132/141 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 315 event pairs, 4 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 221. Up to 32 conditions per place. [2021-03-26 10:10:43,367 INFO L142 LiptonReduction]: Number of co-enabled transitions 302 [2021-03-26 10:10:43,373 INFO L154 LiptonReduction]: Checked pairs total: 217 [2021-03-26 10:10:43,373 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:43,373 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-03-26 10:10:43,378 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 146 flow [2021-03-26 10:10:43,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,379 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:43,379 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:43,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:10:43,379 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:43,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:43,380 INFO L82 PathProgramCache]: Analyzing trace with hash -756296183, now seen corresponding path program 1 times [2021-03-26 10:10:43,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:43,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953679845] [2021-03-26 10:10:43,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:43,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:43,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:43,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:43,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:43,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:43,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:10:43,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:43,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:43,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953679845] [2021-03-26 10:10:43,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:43,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:43,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703590501] [2021-03-26 10:10:43,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:43,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:43,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:43,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:43,489 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 180 [2021-03-26 10:10:43,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:43,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 180 [2021-03-26 10:10:43,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:43,548 INFO L129 PetriNetUnfolder]: 40/131 cut-off events. [2021-03-26 10:10:43,548 INFO L130 PetriNetUnfolder]: For 251/263 co-relation queries the response was YES. [2021-03-26 10:10:43,548 INFO L84 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 131 events. 40/131 cut-off events. For 251/263 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 598 event pairs, 10 based on Foata normal form. 5/128 useless extension candidates. Maximal degree in co-relation 395. Up to 59 conditions per place. [2021-03-26 10:10:43,549 INFO L132 encePairwiseOnDemand]: 175/180 looper letters, 11 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2021-03-26 10:10:43,549 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 201 flow [2021-03-26 10:10:43,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:10:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:10:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 592 transitions. [2021-03-26 10:10:43,552 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2021-03-26 10:10:43,552 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 592 transitions. [2021-03-26 10:10:43,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 592 transitions. [2021-03-26 10:10:43,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:43,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 592 transitions. [2021-03-26 10:10:43,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,555 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,555 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 146 flow. Second operand 4 states and 592 transitions. [2021-03-26 10:10:43,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 201 flow [2021-03-26 10:10:43,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 191 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:43,558 INFO L241 Difference]: Finished difference. Result has 44 places, 32 transitions, 172 flow [2021-03-26 10:10:43,558 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2021-03-26 10:10:43,558 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2021-03-26 10:10:43,559 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:43,559 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 32 transitions, 172 flow [2021-03-26 10:10:43,559 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 32 transitions, 172 flow [2021-03-26 10:10:43,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 32 transitions, 172 flow [2021-03-26 10:10:43,573 INFO L129 PetriNetUnfolder]: 28/105 cut-off events. [2021-03-26 10:10:43,573 INFO L130 PetriNetUnfolder]: For 253/264 co-relation queries the response was YES. [2021-03-26 10:10:43,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 105 events. 28/105 cut-off events. For 253/264 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 436 event pairs, 4 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 335. Up to 42 conditions per place. [2021-03-26 10:10:43,575 INFO L142 LiptonReduction]: Number of co-enabled transitions 322 [2021-03-26 10:10:43,578 INFO L154 LiptonReduction]: Checked pairs total: 192 [2021-03-26 10:10:43,578 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:43,578 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-26 10:10:43,585 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 172 flow [2021-03-26 10:10:43,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,585 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:43,585 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:43,585 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:10:43,585 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:43,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:43,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1743735700, now seen corresponding path program 1 times [2021-03-26 10:10:43,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:43,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117732358] [2021-03-26 10:10:43,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:43,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:43,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:43,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:43,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:43,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:43,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:43,715 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-26 10:10:43,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 10:10:43,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:43,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:43,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117732358] [2021-03-26 10:10:43,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:43,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:10:43,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458262442] [2021-03-26 10:10:43,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:10:43,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:43,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:10:43,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:10:43,752 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 180 [2021-03-26 10:10:43,752 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,753 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:43,753 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 180 [2021-03-26 10:10:43,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:43,841 INFO L129 PetriNetUnfolder]: 50/157 cut-off events. [2021-03-26 10:10:43,841 INFO L130 PetriNetUnfolder]: For 302/313 co-relation queries the response was YES. [2021-03-26 10:10:43,842 INFO L84 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 157 events. 50/157 cut-off events. For 302/313 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 779 event pairs, 4 based on Foata normal form. 5/154 useless extension candidates. Maximal degree in co-relation 543. Up to 78 conditions per place. [2021-03-26 10:10:43,843 INFO L132 encePairwiseOnDemand]: 173/180 looper letters, 16 selfloop transitions, 9 changer transitions 0/41 dead transitions. [2021-03-26 10:10:43,843 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 271 flow [2021-03-26 10:10:43,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:43,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2021-03-26 10:10:43,846 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7577777777777778 [2021-03-26 10:10:43,846 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 682 transitions. [2021-03-26 10:10:43,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 682 transitions. [2021-03-26 10:10:43,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:43,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 682 transitions. [2021-03-26 10:10:43,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,849 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,850 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 172 flow. Second operand 5 states and 682 transitions. [2021-03-26 10:10:43,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 271 flow [2021-03-26 10:10:43,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 255 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:43,852 INFO L241 Difference]: Finished difference. Result has 48 places, 37 transitions, 224 flow [2021-03-26 10:10:43,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2021-03-26 10:10:43,853 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2021-03-26 10:10:43,853 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:43,853 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 37 transitions, 224 flow [2021-03-26 10:10:43,853 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 37 transitions, 224 flow [2021-03-26 10:10:43,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 37 transitions, 224 flow [2021-03-26 10:10:43,870 INFO L129 PetriNetUnfolder]: 42/145 cut-off events. [2021-03-26 10:10:43,870 INFO L130 PetriNetUnfolder]: For 307/315 co-relation queries the response was YES. [2021-03-26 10:10:43,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 145 events. 42/145 cut-off events. For 307/315 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 734 event pairs, 6 based on Foata normal form. 1/137 useless extension candidates. Maximal degree in co-relation 469. Up to 51 conditions per place. [2021-03-26 10:10:43,872 INFO L142 LiptonReduction]: Number of co-enabled transitions 366 [2021-03-26 10:10:44,041 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:10:44,410 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-26 10:10:44,559 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-26 10:10:44,565 INFO L154 LiptonReduction]: Checked pairs total: 608 [2021-03-26 10:10:44,565 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:10:44,566 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 713 [2021-03-26 10:10:44,566 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 228 flow [2021-03-26 10:10:44,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:44,567 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:44,567 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:44,567 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:10:44,567 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:44,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:44,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2026826810, now seen corresponding path program 2 times [2021-03-26 10:10:44,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:44,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657506464] [2021-03-26 10:10:44,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:44,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:44,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:44,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:44,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:44,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:44,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:44,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:44,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:10:44,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:44,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:10:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:44,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657506464] [2021-03-26 10:10:44,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:44,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:10:44,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163147674] [2021-03-26 10:10:44,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:10:44,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:44,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:10:44,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:10:44,656 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 181 [2021-03-26 10:10:44,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:44,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:44,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 181 [2021-03-26 10:10:44,657 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:44,770 INFO L129 PetriNetUnfolder]: 52/167 cut-off events. [2021-03-26 10:10:44,770 INFO L130 PetriNetUnfolder]: For 423/443 co-relation queries the response was YES. [2021-03-26 10:10:44,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 167 events. 52/167 cut-off events. For 423/443 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 865 event pairs, 2 based on Foata normal form. 8/162 useless extension candidates. Maximal degree in co-relation 651. Up to 71 conditions per place. [2021-03-26 10:10:44,772 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 14 selfloop transitions, 13 changer transitions 0/43 dead transitions. [2021-03-26 10:10:44,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 323 flow [2021-03-26 10:10:44,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2021-03-26 10:10:44,774 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7823204419889502 [2021-03-26 10:10:44,775 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2021-03-26 10:10:44,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2021-03-26 10:10:44,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:44,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2021-03-26 10:10:44,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.6) internal successors, (708), 5 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:44,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:44,778 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:44,779 INFO L185 Difference]: Start difference. First operand has 48 places, 37 transitions, 228 flow. Second operand 5 states and 708 transitions. [2021-03-26 10:10:44,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 323 flow [2021-03-26 10:10:44,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 307 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-26 10:10:44,784 INFO L241 Difference]: Finished difference. Result has 52 places, 41 transitions, 283 flow [2021-03-26 10:10:44,784 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2021-03-26 10:10:44,784 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2021-03-26 10:10:44,784 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:44,785 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 41 transitions, 283 flow [2021-03-26 10:10:44,785 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 41 transitions, 283 flow [2021-03-26 10:10:44,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 283 flow [2021-03-26 10:10:44,805 INFO L129 PetriNetUnfolder]: 48/163 cut-off events. [2021-03-26 10:10:44,805 INFO L130 PetriNetUnfolder]: For 426/435 co-relation queries the response was YES. [2021-03-26 10:10:44,806 INFO L84 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 163 events. 48/163 cut-off events. For 426/435 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 848 event pairs, 8 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 579. Up to 55 conditions per place. [2021-03-26 10:10:44,808 INFO L142 LiptonReduction]: Number of co-enabled transitions 398 [2021-03-26 10:10:44,814 INFO L154 LiptonReduction]: Checked pairs total: 334 [2021-03-26 10:10:44,814 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:44,815 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31 [2021-03-26 10:10:44,815 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 283 flow [2021-03-26 10:10:44,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:44,815 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:44,816 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:44,816 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:10:44,816 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:44,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:44,816 INFO L82 PathProgramCache]: Analyzing trace with hash 145310436, now seen corresponding path program 3 times [2021-03-26 10:10:44,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:44,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245430273] [2021-03-26 10:10:44,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:44,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:44,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:44,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:44,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:10:44,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:44,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:10:44,937 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.4 percent of original size [2021-03-26 10:10:44,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-26 10:10:44,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:44,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:10:44,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:44,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245430273] [2021-03-26 10:10:44,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:44,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:10:44,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615491979] [2021-03-26 10:10:44,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:10:44,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:44,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:10:44,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:10:44,983 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 181 [2021-03-26 10:10:44,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 283 flow. Second operand has 7 states, 7 states have (on average 132.85714285714286) internal successors, (930), 7 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:44,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:44,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 181 [2021-03-26 10:10:44,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:45,116 INFO L129 PetriNetUnfolder]: 50/161 cut-off events. [2021-03-26 10:10:45,117 INFO L130 PetriNetUnfolder]: For 507/520 co-relation queries the response was YES. [2021-03-26 10:10:45,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 161 events. 50/161 cut-off events. For 507/520 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 822 event pairs, 0 based on Foata normal form. 3/155 useless extension candidates. Maximal degree in co-relation 663. Up to 55 conditions per place. [2021-03-26 10:10:45,118 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 14 selfloop transitions, 14 changer transitions 0/44 dead transitions. [2021-03-26 10:10:45,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 44 transitions, 357 flow [2021-03-26 10:10:45,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2021-03-26 10:10:45,121 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7480662983425415 [2021-03-26 10:10:45,121 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2021-03-26 10:10:45,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2021-03-26 10:10:45,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:45,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2021-03-26 10:10:45,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,124 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,124 INFO L185 Difference]: Start difference. First operand has 52 places, 41 transitions, 283 flow. Second operand 5 states and 677 transitions. [2021-03-26 10:10:45,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 44 transitions, 357 flow [2021-03-26 10:10:45,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 44 transitions, 355 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-26 10:10:45,128 INFO L241 Difference]: Finished difference. Result has 57 places, 41 transitions, 322 flow [2021-03-26 10:10:45,129 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=322, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2021-03-26 10:10:45,129 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2021-03-26 10:10:45,129 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:45,129 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 41 transitions, 322 flow [2021-03-26 10:10:45,129 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 41 transitions, 322 flow [2021-03-26 10:10:45,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 41 transitions, 322 flow [2021-03-26 10:10:45,149 INFO L129 PetriNetUnfolder]: 46/157 cut-off events. [2021-03-26 10:10:45,150 INFO L130 PetriNetUnfolder]: For 563/573 co-relation queries the response was YES. [2021-03-26 10:10:45,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 157 events. 46/157 cut-off events. For 563/573 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 797 event pairs, 8 based on Foata normal form. 1/148 useless extension candidates. Maximal degree in co-relation 615. Up to 51 conditions per place. [2021-03-26 10:10:45,152 INFO L142 LiptonReduction]: Number of co-enabled transitions 396 [2021-03-26 10:10:45,157 INFO L154 LiptonReduction]: Checked pairs total: 315 [2021-03-26 10:10:45,157 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:45,157 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-26 10:10:45,159 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 322 flow [2021-03-26 10:10:45,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 132.85714285714286) internal successors, (930), 7 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,159 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:45,159 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:45,159 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:10:45,159 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:45,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:45,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1916320506, now seen corresponding path program 1 times [2021-03-26 10:10:45,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:45,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354466782] [2021-03-26 10:10:45,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:45,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:45,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:45,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:45,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:45,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:45,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:45,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354466782] [2021-03-26 10:10:45,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:45,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:45,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34205022] [2021-03-26 10:10:45,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:10:45,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:45,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:10:45,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:10:45,227 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 181 [2021-03-26 10:10:45,227 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 322 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,228 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:45,228 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 181 [2021-03-26 10:10:45,228 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:45,312 INFO L129 PetriNetUnfolder]: 214/470 cut-off events. [2021-03-26 10:10:45,314 INFO L130 PetriNetUnfolder]: For 1278/1468 co-relation queries the response was YES. [2021-03-26 10:10:45,316 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 470 events. 214/470 cut-off events. For 1278/1468 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 2973 event pairs, 58 based on Foata normal form. 85/458 useless extension candidates. Maximal degree in co-relation 1494. Up to 284 conditions per place. [2021-03-26 10:10:45,318 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 12 selfloop transitions, 8 changer transitions 0/52 dead transitions. [2021-03-26 10:10:45,318 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 52 transitions, 384 flow [2021-03-26 10:10:45,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 770 transitions. [2021-03-26 10:10:45,321 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.850828729281768 [2021-03-26 10:10:45,321 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 770 transitions. [2021-03-26 10:10:45,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 770 transitions. [2021-03-26 10:10:45,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:45,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 770 transitions. [2021-03-26 10:10:45,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,325 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,325 INFO L185 Difference]: Start difference. First operand has 57 places, 41 transitions, 322 flow. Second operand 5 states and 770 transitions. [2021-03-26 10:10:45,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 52 transitions, 384 flow [2021-03-26 10:10:45,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 351 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-26 10:10:45,329 INFO L241 Difference]: Finished difference. Result has 60 places, 48 transitions, 357 flow [2021-03-26 10:10:45,329 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=357, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2021-03-26 10:10:45,329 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2021-03-26 10:10:45,330 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:45,330 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 48 transitions, 357 flow [2021-03-26 10:10:45,330 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 48 transitions, 357 flow [2021-03-26 10:10:45,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 357 flow [2021-03-26 10:10:45,368 INFO L129 PetriNetUnfolder]: 168/391 cut-off events. [2021-03-26 10:10:45,368 INFO L130 PetriNetUnfolder]: For 1158/1303 co-relation queries the response was YES. [2021-03-26 10:10:45,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 391 events. 168/391 cut-off events. For 1158/1303 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 2470 event pairs, 47 based on Foata normal form. 12/354 useless extension candidates. Maximal degree in co-relation 1461. Up to 214 conditions per place. [2021-03-26 10:10:45,373 INFO L142 LiptonReduction]: Number of co-enabled transitions 502 [2021-03-26 10:10:45,379 INFO L154 LiptonReduction]: Checked pairs total: 161 [2021-03-26 10:10:45,379 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:45,379 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 49 [2021-03-26 10:10:45,381 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 357 flow [2021-03-26 10:10:45,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,382 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:45,382 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:45,382 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:10:45,382 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:45,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:45,383 INFO L82 PathProgramCache]: Analyzing trace with hash -154570947, now seen corresponding path program 1 times [2021-03-26 10:10:45,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:45,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9254683] [2021-03-26 10:10:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:45,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:45,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:45,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:45,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:45,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:45,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:45,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:45,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:45,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:45,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9254683] [2021-03-26 10:10:45,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:45,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:10:45,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754896823] [2021-03-26 10:10:45,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:45,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:45,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:45,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:45,448 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 181 [2021-03-26 10:10:45,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 357 flow. Second operand has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:45,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 181 [2021-03-26 10:10:45,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:45,538 INFO L129 PetriNetUnfolder]: 133/333 cut-off events. [2021-03-26 10:10:45,539 INFO L130 PetriNetUnfolder]: For 1252/2273 co-relation queries the response was YES. [2021-03-26 10:10:45,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 333 events. 133/333 cut-off events. For 1252/2273 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 2014 event pairs, 6 based on Foata normal form. 174/458 useless extension candidates. Maximal degree in co-relation 1318. Up to 206 conditions per place. [2021-03-26 10:10:45,542 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 8 selfloop transitions, 15 changer transitions 3/54 dead transitions. [2021-03-26 10:10:45,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 54 transitions, 418 flow [2021-03-26 10:10:45,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:10:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:10:45,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1078 transitions. [2021-03-26 10:10:45,545 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.850828729281768 [2021-03-26 10:10:45,545 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1078 transitions. [2021-03-26 10:10:45,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1078 transitions. [2021-03-26 10:10:45,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:45,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1078 transitions. [2021-03-26 10:10:45,548 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:10:45,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,550 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,550 INFO L185 Difference]: Start difference. First operand has 60 places, 48 transitions, 357 flow. Second operand 7 states and 1078 transitions. [2021-03-26 10:10:45,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 54 transitions, 418 flow [2021-03-26 10:10:45,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 54 transitions, 403 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-03-26 10:10:45,554 INFO L241 Difference]: Finished difference. Result has 65 places, 49 transitions, 388 flow [2021-03-26 10:10:45,554 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=388, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2021-03-26 10:10:45,554 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2021-03-26 10:10:45,554 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:45,554 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 49 transitions, 388 flow [2021-03-26 10:10:45,555 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 49 transitions, 388 flow [2021-03-26 10:10:45,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 49 transitions, 388 flow [2021-03-26 10:10:45,582 INFO L129 PetriNetUnfolder]: 78/245 cut-off events. [2021-03-26 10:10:45,582 INFO L130 PetriNetUnfolder]: For 1105/1302 co-relation queries the response was YES. [2021-03-26 10:10:45,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 245 events. 78/245 cut-off events. For 1105/1302 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 1538 event pairs, 6 based on Foata normal form. 17/236 useless extension candidates. Maximal degree in co-relation 1120. Up to 147 conditions per place. [2021-03-26 10:10:45,586 INFO L142 LiptonReduction]: Number of co-enabled transitions 562 [2021-03-26 10:10:45,596 INFO L154 LiptonReduction]: Checked pairs total: 450 [2021-03-26 10:10:45,596 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:10:45,596 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42 [2021-03-26 10:10:45,597 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 372 flow [2021-03-26 10:10:45,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,597 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:45,597 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:45,597 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:10:45,597 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:45,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:45,598 INFO L82 PathProgramCache]: Analyzing trace with hash -390612706, now seen corresponding path program 1 times [2021-03-26 10:10:45,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:45,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864052746] [2021-03-26 10:10:45,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:45,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:45,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:45,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:45,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:45,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:45,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:45,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:45,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:45,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:45,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:45,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864052746] [2021-03-26 10:10:45,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:45,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:10:45,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706679316] [2021-03-26 10:10:45,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:10:45,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:45,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:10:45,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:10:45,675 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 181 [2021-03-26 10:10:45,676 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 372 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:10:45,676 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:45,676 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 181 [2021-03-26 10:10:45,676 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:45,751 INFO L129 PetriNetUnfolder]: 79/197 cut-off events. [2021-03-26 10:10:45,751 INFO L130 PetriNetUnfolder]: For 797/1062 co-relation queries the response was YES. [2021-03-26 10:10:45,753 INFO L84 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 197 events. 79/197 cut-off events. For 797/1062 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 950 event pairs, 0 based on Foata normal form. 52/220 useless extension candidates. Maximal degree in co-relation 863. Up to 117 conditions per place. [2021-03-26 10:10:45,754 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 5 selfloop transitions, 11 changer transitions 4/48 dead transitions. [2021-03-26 10:10:45,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 48 transitions, 391 flow [2021-03-26 10:10:45,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:10:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:10:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1072 transitions. [2021-03-26 10:10:45,756 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.846093133385951 [2021-03-26 10:10:45,756 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1072 transitions. [2021-03-26 10:10:45,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1072 transitions. [2021-03-26 10:10:45,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:45,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1072 transitions. [2021-03-26 10:10:45,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 153.14285714285714) internal successors, (1072), 7 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,796 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,796 INFO L185 Difference]: Start difference. First operand has 65 places, 47 transitions, 372 flow. Second operand 7 states and 1072 transitions. [2021-03-26 10:10:45,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 48 transitions, 391 flow [2021-03-26 10:10:45,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 48 transitions, 336 flow, removed 19 selfloop flow, removed 6 redundant places. [2021-03-26 10:10:45,802 INFO L241 Difference]: Finished difference. Result has 63 places, 42 transitions, 302 flow [2021-03-26 10:10:45,802 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=302, PETRI_PLACES=63, PETRI_TRANSITIONS=42} [2021-03-26 10:10:45,802 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2021-03-26 10:10:45,802 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:45,802 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 42 transitions, 302 flow [2021-03-26 10:10:45,802 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 42 transitions, 302 flow [2021-03-26 10:10:45,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 42 transitions, 302 flow [2021-03-26 10:10:45,815 INFO L129 PetriNetUnfolder]: 28/115 cut-off events. [2021-03-26 10:10:45,815 INFO L130 PetriNetUnfolder]: For 293/311 co-relation queries the response was YES. [2021-03-26 10:10:45,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 115 events. 28/115 cut-off events. For 293/311 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 513 event pairs, 0 based on Foata normal form. 2/111 useless extension candidates. Maximal degree in co-relation 452. Up to 45 conditions per place. [2021-03-26 10:10:45,817 INFO L142 LiptonReduction]: Number of co-enabled transitions 342 [2021-03-26 10:10:46,101 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:10:46,244 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:10:46,873 WARN L205 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 194 [2021-03-26 10:10:47,109 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:10:48,522 WARN L205 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 349 DAG size of output: 270 [2021-03-26 10:10:49,018 WARN L205 SmtUtils]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 10:10:49,038 INFO L154 LiptonReduction]: Checked pairs total: 434 [2021-03-26 10:10:49,039 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:10:49,039 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3237 [2021-03-26 10:10:49,039 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 288 flow [2021-03-26 10:10:49,040 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:10:49,040 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:49,040 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:10:49,040 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:10:49,040 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:49,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:49,040 INFO L82 PathProgramCache]: Analyzing trace with hash 317243514, now seen corresponding path program 1 times [2021-03-26 10:10:49,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:49,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826515805] [2021-03-26 10:10:49,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:49,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:49,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:49,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:49,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:49,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:49,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:49,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826515805] [2021-03-26 10:10:49,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:49,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:49,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788164050] [2021-03-26 10:10:49,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:10:49,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:49,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:10:49,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:10:49,101 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 183 [2021-03-26 10:10:49,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 39 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:49,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:49,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 183 [2021-03-26 10:10:49,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:49,142 INFO L129 PetriNetUnfolder]: 51/164 cut-off events. [2021-03-26 10:10:49,143 INFO L130 PetriNetUnfolder]: For 1185/1239 co-relation queries the response was YES. [2021-03-26 10:10:49,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 164 events. 51/164 cut-off events. For 1185/1239 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 868 event pairs, 0 based on Foata normal form. 26/180 useless extension candidates. Maximal degree in co-relation 647. Up to 65 conditions per place. [2021-03-26 10:10:49,144 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 3 selfloop transitions, 1 changer transitions 10/40 dead transitions. [2021-03-26 10:10:49,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 40 transitions, 300 flow [2021-03-26 10:10:49,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:10:49,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:10:49,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2021-03-26 10:10:49,146 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8825136612021858 [2021-03-26 10:10:49,146 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 646 transitions. [2021-03-26 10:10:49,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 646 transitions. [2021-03-26 10:10:49,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:49,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 646 transitions. [2021-03-26 10:10:49,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.5) internal successors, (646), 4 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:49,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:49,149 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:49,149 INFO L185 Difference]: Start difference. First operand has 59 places, 39 transitions, 288 flow. Second operand 4 states and 646 transitions. [2021-03-26 10:10:49,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 40 transitions, 300 flow [2021-03-26 10:10:49,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 40 transitions, 258 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-26 10:10:49,153 INFO L241 Difference]: Finished difference. Result has 57 places, 30 transitions, 185 flow [2021-03-26 10:10:49,153 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=57, PETRI_TRANSITIONS=30} [2021-03-26 10:10:49,154 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2021-03-26 10:10:49,154 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:49,154 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 30 transitions, 185 flow [2021-03-26 10:10:49,154 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 30 transitions, 185 flow [2021-03-26 10:10:49,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 30 transitions, 185 flow [2021-03-26 10:10:49,161 INFO L129 PetriNetUnfolder]: 10/48 cut-off events. [2021-03-26 10:10:49,161 INFO L130 PetriNetUnfolder]: For 139/144 co-relation queries the response was YES. [2021-03-26 10:10:49,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 48 events. 10/48 cut-off events. For 139/144 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 110 event pairs, 0 based on Foata normal form. 5/53 useless extension candidates. Maximal degree in co-relation 144. Up to 14 conditions per place. [2021-03-26 10:10:49,161 INFO L142 LiptonReduction]: Number of co-enabled transitions 138 [2021-03-26 10:10:49,373 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:10:49,844 WARN L205 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2021-03-26 10:10:49,981 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:10:50,312 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2021-03-26 10:10:50,588 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 90 [2021-03-26 10:10:50,654 INFO L154 LiptonReduction]: Checked pairs total: 41 [2021-03-26 10:10:50,654 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 10:10:50,654 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1500 [2021-03-26 10:10:50,655 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 27 transitions, 186 flow [2021-03-26 10:10:50,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:50,655 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:50,655 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:50,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:10:50,655 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:50,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:50,656 INFO L82 PathProgramCache]: Analyzing trace with hash -392652352, now seen corresponding path program 1 times [2021-03-26 10:10:50,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:50,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799927131] [2021-03-26 10:10:50,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:10:50,677 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:10:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:10:50,698 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:10:50,721 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:10:50,722 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:10:50,722 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 10:10:50,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:10:50 BasicIcfg [2021-03-26 10:10:50,775 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:10:50,776 INFO L168 Benchmark]: Toolchain (without parser) took 24855.81 ms. Allocated memory was 255.9 MB in the beginning and 734.0 MB in the end (delta: 478.2 MB). Free memory was 234.5 MB in the beginning and 607.7 MB in the end (delta: -373.2 MB). Peak memory consumption was 105.4 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:50,776 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.7 MB in the end (delta: 165.6 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:10:50,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.39 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 234.5 MB in the beginning and 310.2 MB in the end (delta: -75.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:50,776 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.33 ms. Allocated memory is still 350.2 MB. Free memory was 310.2 MB in the beginning and 307.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:50,776 INFO L168 Benchmark]: Boogie Preprocessor took 37.76 ms. Allocated memory is still 350.2 MB. Free memory was 307.2 MB in the beginning and 305.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:50,777 INFO L168 Benchmark]: RCFGBuilder took 1594.32 ms. Allocated memory is still 350.2 MB. Free memory was 305.1 MB in the beginning and 261.0 MB in the end (delta: 44.2 MB). Peak memory consumption was 45.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:50,777 INFO L168 Benchmark]: TraceAbstraction took 22650.54 ms. Allocated memory was 350.2 MB in the beginning and 734.0 MB in the end (delta: 383.8 MB). Free memory was 261.0 MB in the beginning and 607.7 MB in the end (delta: -346.7 MB). Peak memory consumption was 38.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:50,778 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 was 237.8 MB in the beginning and 237.7 MB in the end (delta: 165.6 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 523.39 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 234.5 MB in the beginning and 310.2 MB in the end (delta: -75.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 44.33 ms. Allocated memory is still 350.2 MB. Free memory was 310.2 MB in the beginning and 307.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 37.76 ms. Allocated memory is still 350.2 MB. Free memory was 307.2 MB in the beginning and 305.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1594.32 ms. Allocated memory is still 350.2 MB. Free memory was 305.1 MB in the beginning and 261.0 MB in the end (delta: 44.2 MB). Peak memory consumption was 45.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 22650.54 ms. Allocated memory was 350.2 MB in the beginning and 734.0 MB in the end (delta: 383.8 MB). Free memory was 261.0 MB in the beginning and 607.7 MB in the end (delta: -346.7 MB). Peak memory consumption was 38.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: 8905.5ms, 105 PlacesBefore, 49 PlacesAfterwards, 97 TransitionsBefore, 40 TransitionsAfterwards, 1738 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, 2726 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1601, positive: 1527, positive conditional: 1527, positive unconditional: 0, negative: 74, negative conditional: 74, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1601, positive: 1527, positive conditional: 0, positive unconditional: 1527, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1601, positive: 1527, positive conditional: 0, positive unconditional: 1527, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1212, positive: 1177, positive conditional: 0, positive unconditional: 1177, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1212, positive: 1171, positive conditional: 0, positive unconditional: 1171, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 527, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 505, negative conditional: 0, negative unconditional: 505, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1601, positive: 350, positive conditional: 0, positive unconditional: 350, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 1212, unknown conditional: 0, unknown unconditional: 1212] , Statistics on independence cache: Total cache size (in pairs): 1212, Positive cache size: 1177, Positive conditional cache size: 0, Positive unconditional cache size: 1177, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3415.6ms, 46 PlacesBefore, 32 PlacesAfterwards, 34 TransitionsBefore, 23 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1054 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 384, positive: 306, positive conditional: 306, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 384, positive: 306, positive conditional: 9, positive unconditional: 297, negative: 78, negative conditional: 2, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 384, positive: 306, positive conditional: 9, positive unconditional: 297, negative: 78, negative conditional: 2, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 68, positive: 46, positive conditional: 2, positive unconditional: 44, negative: 22, negative conditional: 2, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 68, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 22, negative conditional: 2, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 514, positive: 71, positive conditional: 0, positive unconditional: 71, negative: 443, negative conditional: 84, negative unconditional: 360, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 384, positive: 260, positive conditional: 7, positive unconditional: 253, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 68, unknown conditional: 4, unknown unconditional: 64] , Statistics on independence cache: Total cache size (in pairs): 1280, Positive cache size: 1223, Positive conditional cache size: 2, Positive unconditional cache size: 1221, Negative cache size: 57, Negative conditional cache size: 2, Negative unconditional cache size: 55, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1271.2ms, 33 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 633 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, positive: 148, positive conditional: 148, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 196, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 196, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 95, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 95, negative conditional: 0, negative unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 196, positive: 141, positive conditional: 0, positive unconditional: 141, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 1293, Positive cache size: 1230, Positive conditional cache size: 2, Positive unconditional cache size: 1228, Negative cache size: 63, Negative conditional cache size: 2, Negative unconditional cache size: 61, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.1ms, 35 PlacesBefore, 35 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 120 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, positive: 36, positive conditional: 4, positive unconditional: 32, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, positive: 36, positive conditional: 4, positive unconditional: 32, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 44, positive: 35, positive conditional: 4, positive unconditional: 31, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1294, Positive cache size: 1231, Positive conditional cache size: 2, Positive unconditional cache size: 1229, Negative cache size: 63, Negative conditional cache size: 2, Negative unconditional cache size: 61, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.0ms, 38 PlacesBefore, 38 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 186 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, positive: 65, positive conditional: 12, positive unconditional: 53, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, positive: 65, positive conditional: 12, positive unconditional: 53, negative: 11, negative conditional: 0, negative unconditional: 11, 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: 76, positive: 65, positive conditional: 12, positive unconditional: 53, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1294, Positive cache size: 1231, Positive conditional cache size: 2, Positive unconditional cache size: 1229, Negative cache size: 63, Negative conditional cache size: 2, Negative unconditional cache size: 61, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 67.2ms, 41 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 206 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, positive: 78, positive conditional: 9, positive unconditional: 69, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, positive: 78, positive conditional: 9, positive unconditional: 69, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 1, positive unconditional: 2, 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: 5, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 50, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, positive: 75, positive conditional: 8, positive unconditional: 67, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1299, Positive cache size: 1234, Positive conditional cache size: 3, Positive unconditional cache size: 1231, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.3ms, 42 PlacesBefore, 42 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 217 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, positive: 62, positive conditional: 62, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, positive: 62, positive conditional: 8, positive unconditional: 54, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 75, positive: 62, positive conditional: 8, positive unconditional: 54, negative: 13, negative conditional: 0, negative unconditional: 13, 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: 75, positive: 62, positive conditional: 8, positive unconditional: 54, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1299, Positive cache size: 1234, Positive conditional cache size: 3, Positive unconditional cache size: 1231, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.2ms, 44 PlacesBefore, 44 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 192 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, positive: 65, positive conditional: 12, positive unconditional: 53, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 75, positive: 65, positive conditional: 12, positive unconditional: 53, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 75, positive: 64, positive conditional: 12, positive unconditional: 52, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1300, Positive cache size: 1235, Positive conditional cache size: 3, Positive unconditional cache size: 1232, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 712.2ms, 48 PlacesBefore, 48 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 608 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 181, positive: 151, positive conditional: 151, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 181, positive: 151, positive conditional: 34, positive unconditional: 117, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 181, positive: 151, positive conditional: 34, positive unconditional: 117, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 181, positive: 146, positive conditional: 34, positive unconditional: 112, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1305, Positive cache size: 1240, Positive conditional cache size: 3, Positive unconditional cache size: 1237, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.6ms, 52 PlacesBefore, 52 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 334 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, positive: 87, positive conditional: 87, 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: 103, positive: 87, positive conditional: 29, positive unconditional: 58, 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: 103, positive: 87, positive conditional: 29, positive unconditional: 58, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 103, positive: 87, positive conditional: 29, positive unconditional: 58, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1305, Positive cache size: 1240, Positive conditional cache size: 3, Positive unconditional cache size: 1237, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.7ms, 57 PlacesBefore, 57 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 315 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, positive: 88, positive conditional: 88, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 103, positive: 88, positive conditional: 29, positive unconditional: 59, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 103, positive: 88, positive conditional: 29, positive unconditional: 59, negative: 15, negative conditional: 0, negative unconditional: 15, 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: 103, positive: 88, positive conditional: 29, positive unconditional: 59, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1305, Positive cache size: 1240, Positive conditional cache size: 3, Positive unconditional cache size: 1237, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 49.1ms, 60 PlacesBefore, 60 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 161 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, positive: 31, positive conditional: 31, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, positive: 31, positive conditional: 10, positive unconditional: 21, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 31, positive conditional: 10, positive unconditional: 21, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 38, positive: 30, positive conditional: 9, positive unconditional: 21, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1306, Positive cache size: 1241, Positive conditional cache size: 4, Positive unconditional cache size: 1237, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 41.4ms, 65 PlacesBefore, 65 PlacesAfterwards, 49 TransitionsBefore, 47 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 450 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 145, positive: 127, positive conditional: 127, 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: 145, positive: 127, positive conditional: 78, positive unconditional: 49, 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: 145, positive: 127, positive conditional: 78, positive unconditional: 49, 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: 17, positive: 17, positive conditional: 16, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 145, positive: 110, positive conditional: 62, positive unconditional: 48, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 17, unknown conditional: 16, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1323, Positive cache size: 1258, Positive conditional cache size: 20, Positive unconditional cache size: 1238, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3236.2ms, 63 PlacesBefore, 59 PlacesAfterwards, 42 TransitionsBefore, 39 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 434 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 172, positive: 145, positive conditional: 145, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 172, positive: 145, positive conditional: 75, positive unconditional: 70, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 172, positive: 145, positive conditional: 75, positive unconditional: 70, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 7, 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 172, positive: 138, positive conditional: 68, positive unconditional: 70, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1330, Positive cache size: 1265, Positive conditional cache size: 27, Positive unconditional cache size: 1238, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 42 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1499.9ms, 57 PlacesBefore, 50 PlacesAfterwards, 30 TransitionsBefore, 27 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 41 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, positive: 41, positive conditional: 10, positive unconditional: 31, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 41, positive conditional: 10, positive unconditional: 31, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 2, 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: 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: 41, positive: 33, positive conditional: 8, positive unconditional: 25, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 8, unknown conditional: 2, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1338, Positive cache size: 1273, Positive conditional cache size: 29, Positive unconditional cache size: 1244, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 26 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1202; [L824] FCALL, FORK 0 pthread_create(&t1202, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1203; [L826] FCALL, FORK 0 pthread_create(&t1203, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1204; [L828] FCALL, FORK 0 pthread_create(&t1204, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 22481.0ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1312.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8997.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 46 SDtfs, 27 SDslu, 16 SDs, 0 SdLazy, 270 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 370.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 354.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=388occurred in iteration=12, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 40.2ms SsaConstructionTime, 418.6ms SatisfiabilityAnalysisTime, 962.2ms InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 1018 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...