/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/safe010_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 16:05:05,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 16:05:05,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 16:05:05,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 16:05:05,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 16:05:05,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 16:05:05,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 16:05:05,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 16:05:05,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 16:05:05,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 16:05:05,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 16:05:05,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 16:05:05,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 16:05:05,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 16:05:05,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 16:05:05,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 16:05:05,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 16:05:05,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 16:05:05,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 16:05:05,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 16:05:05,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 16:05:05,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 16:05:05,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 16:05:05,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 16:05:05,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 16:05:05,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 16:05:05,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 16:05:05,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 16:05:05,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 16:05:05,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 16:05:05,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 16:05:05,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 16:05:05,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 16:05:05,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 16:05:05,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 16:05:05,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 16:05:05,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 16:05:05,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 16:05:05,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 16:05:05,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 16:05:05,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 16:05:05,210 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-06-11 16:05:05,225 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 16:05:05,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 16:05:05,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 16:05:05,226 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 16:05:05,226 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 16:05:05,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 16:05:05,227 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 16:05:05,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 16:05:05,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 16:05:05,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 16:05:05,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 16:05:05,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 16:05:05,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 16:05:05,227 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 16:05:05,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 16:05:05,227 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 16:05:05,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 16:05:05,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 16:05:05,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 16:05:05,228 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 16:05:05,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 16:05:05,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 16:05:05,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 16:05:05,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 16:05:05,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 16:05:05,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 16:05:05,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 16:05:05,229 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 16:05:05,229 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 16:05:05,229 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 16:05:05,229 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-06-11 16:05:05,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 16:05:05,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 16:05:05,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 16:05:05,506 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 16:05:05,507 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 16:05:05,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.opt.i [2021-06-11 16:05:05,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72fbb14bc/2f15f32bc9c94fa981f1b247bcb7dc68/FLAGa896d7f8f [2021-06-11 16:05:05,971 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 16:05:05,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_rmo.opt.i [2021-06-11 16:05:05,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72fbb14bc/2f15f32bc9c94fa981f1b247bcb7dc68/FLAGa896d7f8f [2021-06-11 16:05:05,991 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72fbb14bc/2f15f32bc9c94fa981f1b247bcb7dc68 [2021-06-11 16:05:05,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 16:05:05,994 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 16:05:05,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 16:05:05,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 16:05:05,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 16:05:05,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:05:05" (1/1) ... [2021-06-11 16:05:05,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bc31989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:05, skipping insertion in model container [2021-06-11 16:05:05,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:05:05" (1/1) ... [2021-06-11 16:05:06,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 16:05:06,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 16:05:06,175 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/safe010_rmo.opt.i[949,962] [2021-06-11 16:05:06,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:05:06,337 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 16:05:06,346 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/safe010_rmo.opt.i[949,962] [2021-06-11 16:05:06,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:05:06,444 INFO L208 MainTranslator]: Completed translation [2021-06-11 16:05:06,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:06 WrapperNode [2021-06-11 16:05:06,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 16:05:06,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 16:05:06,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 16:05:06,447 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 16:05:06,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:06" (1/1) ... [2021-06-11 16:05:06,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:06" (1/1) ... [2021-06-11 16:05:06,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 16:05:06,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 16:05:06,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 16:05:06,508 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 16:05:06,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:06" (1/1) ... [2021-06-11 16:05:06,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:06" (1/1) ... [2021-06-11 16:05:06,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:06" (1/1) ... [2021-06-11 16:05:06,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:06" (1/1) ... [2021-06-11 16:05:06,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:06" (1/1) ... [2021-06-11 16:05:06,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:06" (1/1) ... [2021-06-11 16:05:06,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:06" (1/1) ... [2021-06-11 16:05:06,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 16:05:06,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 16:05:06,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 16:05:06,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 16:05:06,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:06" (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-06-11 16:05:06,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 16:05:06,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 16:05:06,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 16:05:06,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 16:05:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 16:05:06,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 16:05:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 16:05:06,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 16:05:06,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 16:05:06,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 16:05:06,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 16:05:06,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 16:05:06,625 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 16:05:07,997 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 16:05:07,998 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 16:05:07,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:05:07 BoogieIcfgContainer [2021-06-11 16:05:07,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 16:05:08,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 16:05:08,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 16:05:08,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 16:05:08,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 04:05:05" (1/3) ... [2021-06-11 16:05:08,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55bbcdc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:05:08, skipping insertion in model container [2021-06-11 16:05:08,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:05:06" (2/3) ... [2021-06-11 16:05:08,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55bbcdc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:05:08, skipping insertion in model container [2021-06-11 16:05:08,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:05:07" (3/3) ... [2021-06-11 16:05:08,004 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_rmo.opt.i [2021-06-11 16:05:08,008 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 16:05:08,011 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 16:05:08,012 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 16:05:08,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,039 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,039 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,039 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,039 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,039 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,040 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,040 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,040 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,043 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,043 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,044 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,044 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,046 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,046 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,048 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,049 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,049 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,050 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,050 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:05:08,052 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 16:05:08,064 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-11 16:05:08,089 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 16:05:08,090 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 16:05:08,090 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 16:05:08,090 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 16:05:08,090 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 16:05:08,090 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 16:05:08,090 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 16:05:08,090 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 16:05:08,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2021-06-11 16:05:08,127 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-06-11 16:05:08,128 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:05:08,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-06-11 16:05:08,138 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2021-06-11 16:05:08,145 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2021-06-11 16:05:08,146 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:08,155 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 162 flow [2021-06-11 16:05:08,159 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 162 flow [2021-06-11 16:05:08,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 162 flow [2021-06-11 16:05:08,180 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-06-11 16:05:08,180 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:05:08,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-06-11 16:05:08,187 INFO L151 LiptonReduction]: Number of co-enabled transitions 926 [2021-06-11 16:05:08,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:08,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:08,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:08,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:08,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:08,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:08,976 WARN L205 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-06-11 16:05:09,284 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-06-11 16:05:10,562 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-06-11 16:05:11,116 WARN L205 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-06-11 16:05:11,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:11,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:11,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:11,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:11,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:11,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:11,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:11,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:11,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:11,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:11,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:11,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:11,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:11,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:11,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,535 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 16:05:11,536 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:11,556 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:11,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,738 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:11,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:11,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:05:11,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,803 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:11,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:11,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:05:11,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:11,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:11,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:11,940 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 16:05:11,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:12,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:12,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:12,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:12,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:12,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:12,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:12,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:12,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:12,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:12,203 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:12,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:12,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:12,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:05:12,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:12,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:12,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:12,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:12,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:12,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:12,670 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 16:05:13,039 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-06-11 16:05:13,153 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-11 16:05:13,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:13,179 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:13,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:13,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 16:05:13,186 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:13,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:13,187 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-11 16:05:13,188 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:13,190 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:13,191 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-11 16:05:13,192 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:13,194 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-11 16:05:13,194 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-11 16:05:13,194 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:13,197 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:13,200 INFO L147 QuantifierPusher]: treesize reduction 100, result has 38.7 percent of original size 63 [2021-06-11 16:05:13,200 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-11 16:05:13,201 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:13,203 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:13,206 INFO L147 QuantifierPusher]: treesize reduction 176, result has 33.3 percent of original size 88 [2021-06-11 16:05:13,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:13,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:13,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:13,310 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:13,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:13,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 16:05:13,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 16:05:13,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:13,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:13,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:13,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:13,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:13,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:13,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:13,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:13,828 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-06-11 16:05:14,116 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-06-11 16:05:15,316 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 265 DAG size of output: 264 [2021-06-11 16:05:15,947 WARN L205 SmtUtils]: Spent 629.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-06-11 16:05:16,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:16,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:16,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:16,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:16,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:05:16,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:16,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:16,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:16,353 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 16:05:16,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:16,607 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:16,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:16,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:16,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:05:16,953 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2021-06-11 16:05:17,326 WARN L205 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2021-06-11 16:05:18,029 WARN L205 SmtUtils]: Spent 701.00 ms on a formula simplification that was a NOOP. DAG size: 273 [2021-06-11 16:05:18,722 WARN L205 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 273 [2021-06-11 16:05:18,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:18,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:19,317 WARN L205 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 184 [2021-06-11 16:05:19,611 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-06-11 16:05:20,801 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 264 DAG size of output: 263 [2021-06-11 16:05:21,391 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-06-11 16:05:21,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:21,790 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:21,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:21,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:21,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:05:22,211 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2021-06-11 16:05:22,609 WARN L205 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2021-06-11 16:05:23,213 WARN L205 SmtUtils]: Spent 602.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-06-11 16:05:23,850 WARN L205 SmtUtils]: Spent 635.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-06-11 16:05:23,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:23,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:24,228 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-06-11 16:05:24,340 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-06-11 16:05:24,606 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-06-11 16:05:24,719 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-06-11 16:05:24,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:24,733 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:24,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:24,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:24,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:05:24,762 INFO L163 LiptonReduction]: Checked pairs total: 2779 [2021-06-11 16:05:24,762 INFO L165 LiptonReduction]: Total number of compositions: 78 [2021-06-11 16:05:24,764 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16619 [2021-06-11 16:05:24,776 INFO L129 PetriNetUnfolder]: 0/4 cut-off events. [2021-06-11 16:05:24,778 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:05:24,778 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:24,779 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-06-11 16:05:24,779 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:24,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:24,783 INFO L82 PathProgramCache]: Analyzing trace with hash 919996, now seen corresponding path program 1 times [2021-06-11 16:05:24,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:24,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844578372] [2021-06-11 16:05:24,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:24,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:24,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:05:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:24,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844578372] [2021-06-11 16:05:24,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:24,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:05:24,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991898657] [2021-06-11 16:05:24,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:05:24,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:24,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:05:24,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:05:24,943 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 158 [2021-06-11 16:05:24,948 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:24,948 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:24,948 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 158 [2021-06-11 16:05:24,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:25,000 INFO L129 PetriNetUnfolder]: 23/61 cut-off events. [2021-06-11 16:05:25,000 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:05:25,001 INFO L84 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 61 events. 23/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 210 event pairs, 16 based on Foata normal form. 6/56 useless extension candidates. Maximal degree in co-relation 107. Up to 37 conditions per place. [2021-06-11 16:05:25,002 INFO L132 encePairwiseOnDemand]: 152/158 looper letters, 7 selfloop transitions, 2 changer transitions 3/22 dead transitions. [2021-06-11 16:05:25,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 72 flow [2021-06-11 16:05:25,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:05:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:05:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2021-06-11 16:05:25,015 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7911392405063291 [2021-06-11 16:05:25,016 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2021-06-11 16:05:25,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2021-06-11 16:05:25,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:25,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2021-06-11 16:05:25,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,025 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,026 INFO L185 Difference]: Start difference. First operand has 27 places, 22 transitions, 50 flow. Second operand 3 states and 375 transitions. [2021-06-11 16:05:25,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 72 flow [2021-06-11 16:05:25,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:05:25,029 INFO L241 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2021-06-11 16:05:25,030 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2021-06-11 16:05:25,030 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2021-06-11 16:05:25,030 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:25,030 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 16 transitions, 40 flow [2021-06-11 16:05:25,031 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 16 transitions, 40 flow [2021-06-11 16:05:25,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 40 flow [2021-06-11 16:05:25,033 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-06-11 16:05:25,033 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:05:25,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 16:05:25,034 INFO L151 LiptonReduction]: Number of co-enabled transitions 112 [2021-06-11 16:05:25,154 INFO L163 LiptonReduction]: Checked pairs total: 120 [2021-06-11 16:05:25,154 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:05:25,154 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 124 [2021-06-11 16:05:25,155 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 40 flow [2021-06-11 16:05:25,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,155 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:25,155 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:25,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 16:05:25,156 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:25,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:25,156 INFO L82 PathProgramCache]: Analyzing trace with hash -724066434, now seen corresponding path program 1 times [2021-06-11 16:05:25,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:25,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254986581] [2021-06-11 16:05:25,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:25,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:25,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:05:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:25,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254986581] [2021-06-11 16:05:25,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:25,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:05:25,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787520552] [2021-06-11 16:05:25,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:05:25,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:25,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:05:25,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:05:25,269 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 158 [2021-06-11 16:05:25,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:25,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 158 [2021-06-11 16:05:25,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:25,291 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-06-11 16:05:25,291 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:05:25,291 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 1/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 16:05:25,291 INFO L132 encePairwiseOnDemand]: 155/158 looper letters, 1 selfloop transitions, 2 changer transitions 1/16 dead transitions. [2021-06-11 16:05:25,292 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 16 transitions, 46 flow [2021-06-11 16:05:25,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:05:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:05:25,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2021-06-11 16:05:25,294 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8059071729957806 [2021-06-11 16:05:25,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2021-06-11 16:05:25,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2021-06-11 16:05:25,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:25,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2021-06-11 16:05:25,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,297 INFO L185 Difference]: Start difference. First operand has 23 places, 16 transitions, 40 flow. Second operand 3 states and 382 transitions. [2021-06-11 16:05:25,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 16 transitions, 46 flow [2021-06-11 16:05:25,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 16 transitions, 42 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:05:25,297 INFO L241 Difference]: Finished difference. Result has 24 places, 15 transitions, 42 flow [2021-06-11 16:05:25,297 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2021-06-11 16:05:25,298 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2021-06-11 16:05:25,298 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:25,298 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 15 transitions, 42 flow [2021-06-11 16:05:25,298 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 15 transitions, 42 flow [2021-06-11 16:05:25,298 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 23 places, 15 transitions, 42 flow [2021-06-11 16:05:25,301 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-06-11 16:05:25,301 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:05:25,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 16:05:25,301 INFO L151 LiptonReduction]: Number of co-enabled transitions 94 [2021-06-11 16:05:25,342 INFO L163 LiptonReduction]: Checked pairs total: 106 [2021-06-11 16:05:25,342 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:05:25,343 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 45 [2021-06-11 16:05:25,343 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2021-06-11 16:05:25,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,344 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:25,344 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:25,344 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 16:05:25,344 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:25,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:25,344 INFO L82 PathProgramCache]: Analyzing trace with hash -972884270, now seen corresponding path program 1 times [2021-06-11 16:05:25,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:25,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366874368] [2021-06-11 16:05:25,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:25,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:25,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:25,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:25,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:05:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:25,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366874368] [2021-06-11 16:05:25,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:25,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:05:25,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782115197] [2021-06-11 16:05:25,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:05:25,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:25,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:05:25,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:05:25,461 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 158 [2021-06-11 16:05:25,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,461 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:25,461 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 158 [2021-06-11 16:05:25,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:25,500 INFO L129 PetriNetUnfolder]: 26/67 cut-off events. [2021-06-11 16:05:25,500 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-06-11 16:05:25,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 67 events. 26/67 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 204 event pairs, 18 based on Foata normal form. 1/66 useless extension candidates. Maximal degree in co-relation 128. Up to 51 conditions per place. [2021-06-11 16:05:25,501 INFO L132 encePairwiseOnDemand]: 154/158 looper letters, 7 selfloop transitions, 3 changer transitions 0/18 dead transitions. [2021-06-11 16:05:25,501 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 18 transitions, 68 flow [2021-06-11 16:05:25,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:05:25,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:05:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2021-06-11 16:05:25,503 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7130801687763713 [2021-06-11 16:05:25,503 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 338 transitions. [2021-06-11 16:05:25,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions. [2021-06-11 16:05:25,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:25,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions. [2021-06-11 16:05:25,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,507 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,507 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 3 states and 338 transitions. [2021-06-11 16:05:25,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 18 transitions, 68 flow [2021-06-11 16:05:25,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 18 transitions, 64 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:05:25,508 INFO L241 Difference]: Finished difference. Result has 24 places, 17 transitions, 57 flow [2021-06-11 16:05:25,508 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=24, PETRI_TRANSITIONS=17} [2021-06-11 16:05:25,509 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2021-06-11 16:05:25,509 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:25,509 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 17 transitions, 57 flow [2021-06-11 16:05:25,509 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 17 transitions, 57 flow [2021-06-11 16:05:25,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 17 transitions, 57 flow [2021-06-11 16:05:25,515 INFO L129 PetriNetUnfolder]: 3/27 cut-off events. [2021-06-11 16:05:25,515 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-06-11 16:05:25,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 27 events. 3/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 42. Up to 10 conditions per place. [2021-06-11 16:05:25,515 INFO L151 LiptonReduction]: Number of co-enabled transitions 96 [2021-06-11 16:05:25,516 INFO L163 LiptonReduction]: Checked pairs total: 80 [2021-06-11 16:05:25,516 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:05:25,516 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-06-11 16:05:25,517 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 57 flow [2021-06-11 16:05:25,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,517 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:25,518 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:25,518 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 16:05:25,518 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:25,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:25,518 INFO L82 PathProgramCache]: Analyzing trace with hash -94666011, now seen corresponding path program 1 times [2021-06-11 16:05:25,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:25,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530223590] [2021-06-11 16:05:25,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:25,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:25,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:05:25,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:25,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:05:25,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:25,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 16:05:25,606 INFO L142 QuantifierPusher]: treesize reduction 14, result has 39.1 percent of original size [2021-06-11 16:05:25,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 16:05:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:25,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530223590] [2021-06-11 16:05:25,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:25,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:05:25,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435793558] [2021-06-11 16:05:25,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 16:05:25,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:25,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 16:05:25,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 16:05:25,615 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 158 [2021-06-11 16:05:25,616 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 57 flow. Second operand has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:25,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 158 [2021-06-11 16:05:25,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:25,701 INFO L129 PetriNetUnfolder]: 38/108 cut-off events. [2021-06-11 16:05:25,701 INFO L130 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2021-06-11 16:05:25,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 108 events. 38/108 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 482 event pairs, 7 based on Foata normal form. 12/120 useless extension candidates. Maximal degree in co-relation 229. Up to 28 conditions per place. [2021-06-11 16:05:25,702 INFO L132 encePairwiseOnDemand]: 151/158 looper letters, 8 selfloop transitions, 6 changer transitions 10/31 dead transitions. [2021-06-11 16:05:25,702 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 31 transitions, 134 flow [2021-06-11 16:05:25,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 16:05:25,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 16:05:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 650 transitions. [2021-06-11 16:05:25,705 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6856540084388185 [2021-06-11 16:05:25,705 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 650 transitions. [2021-06-11 16:05:25,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 650 transitions. [2021-06-11 16:05:25,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:25,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 650 transitions. [2021-06-11 16:05:25,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 158.0) internal successors, (1106), 7 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,709 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 158.0) internal successors, (1106), 7 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,709 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 57 flow. Second operand 6 states and 650 transitions. [2021-06-11 16:05:25,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 31 transitions, 134 flow [2021-06-11 16:05:25,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 16:05:25,710 INFO L241 Difference]: Finished difference. Result has 32 places, 17 transitions, 86 flow [2021-06-11 16:05:25,711 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=86, PETRI_PLACES=32, PETRI_TRANSITIONS=17} [2021-06-11 16:05:25,711 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2021-06-11 16:05:25,711 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:25,711 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 17 transitions, 86 flow [2021-06-11 16:05:25,711 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 17 transitions, 86 flow [2021-06-11 16:05:25,712 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 17 transitions, 86 flow [2021-06-11 16:05:25,720 INFO L129 PetriNetUnfolder]: 8/33 cut-off events. [2021-06-11 16:05:25,720 INFO L130 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2021-06-11 16:05:25,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 33 events. 8/33 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 73 event pairs, 4 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 98. Up to 17 conditions per place. [2021-06-11 16:05:25,722 INFO L151 LiptonReduction]: Number of co-enabled transitions 72 [2021-06-11 16:05:25,817 INFO L163 LiptonReduction]: Checked pairs total: 30 [2021-06-11 16:05:25,817 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:05:25,817 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 106 [2021-06-11 16:05:25,818 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 17 transitions, 86 flow [2021-06-11 16:05:25,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,819 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:25,819 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:25,819 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 16:05:25,819 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:25,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:25,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1337943204, now seen corresponding path program 1 times [2021-06-11 16:05:25,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:25,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496133948] [2021-06-11 16:05:25,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:25,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:25,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:05:25,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:25,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 16:05:25,912 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-06-11 16:05:25,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-11 16:05:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:25,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496133948] [2021-06-11 16:05:25,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:25,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:05:25,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100979600] [2021-06-11 16:05:25,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:05:25,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:25,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:05:25,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:05:25,926 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 158 [2021-06-11 16:05:25,926 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 17 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,926 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:25,926 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 158 [2021-06-11 16:05:25,926 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:25,970 INFO L129 PetriNetUnfolder]: 18/53 cut-off events. [2021-06-11 16:05:25,970 INFO L130 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2021-06-11 16:05:25,971 INFO L84 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 53 events. 18/53 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 6 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 175. Up to 34 conditions per place. [2021-06-11 16:05:25,971 INFO L132 encePairwiseOnDemand]: 153/158 looper letters, 7 selfloop transitions, 5 changer transitions 0/21 dead transitions. [2021-06-11 16:05:25,971 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 21 transitions, 122 flow [2021-06-11 16:05:25,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 16:05:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 16:05:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2021-06-11 16:05:25,973 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6962025316455697 [2021-06-11 16:05:25,973 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2021-06-11 16:05:25,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2021-06-11 16:05:25,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:25,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2021-06-11 16:05:25,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,976 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:25,976 INFO L185 Difference]: Start difference. First operand has 32 places, 17 transitions, 86 flow. Second operand 4 states and 440 transitions. [2021-06-11 16:05:25,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 21 transitions, 122 flow [2021-06-11 16:05:25,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 105 flow, removed 2 selfloop flow, removed 6 redundant places. [2021-06-11 16:05:25,979 INFO L241 Difference]: Finished difference. Result has 30 places, 19 transitions, 97 flow [2021-06-11 16:05:25,979 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2021-06-11 16:05:25,979 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2021-06-11 16:05:25,979 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:25,979 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 19 transitions, 97 flow [2021-06-11 16:05:25,979 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 19 transitions, 97 flow [2021-06-11 16:05:25,979 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 19 transitions, 97 flow [2021-06-11 16:05:25,985 INFO L129 PetriNetUnfolder]: 8/31 cut-off events. [2021-06-11 16:05:25,985 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2021-06-11 16:05:25,985 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 31 events. 8/31 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 58 event pairs, 3 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 93. Up to 17 conditions per place. [2021-06-11 16:05:25,986 INFO L151 LiptonReduction]: Number of co-enabled transitions 78 [2021-06-11 16:05:26,075 INFO L163 LiptonReduction]: Checked pairs total: 36 [2021-06-11 16:05:26,076 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:05:26,076 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 97 [2021-06-11 16:05:26,076 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 97 flow [2021-06-11 16:05:26,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:26,077 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:26,077 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:26,077 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 16:05:26,077 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:26,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:26,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1473431894, now seen corresponding path program 1 times [2021-06-11 16:05:26,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:26,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337838736] [2021-06-11 16:05:26,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:26,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:26,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:05:26,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:26,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:05:26,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:26,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:26,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337838736] [2021-06-11 16:05:26,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:26,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:05:26,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438217709] [2021-06-11 16:05:26,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:05:26,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:26,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:05:26,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:05:26,166 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 158 [2021-06-11 16:05:26,166 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:26,167 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:26,167 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 158 [2021-06-11 16:05:26,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:26,191 INFO L129 PetriNetUnfolder]: 13/49 cut-off events. [2021-06-11 16:05:26,191 INFO L130 PetriNetUnfolder]: For 73/80 co-relation queries the response was YES. [2021-06-11 16:05:26,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 49 events. 13/49 cut-off events. For 73/80 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 136 event pairs, 5 based on Foata normal form. 5/51 useless extension candidates. Maximal degree in co-relation 136. Up to 19 conditions per place. [2021-06-11 16:05:26,192 INFO L132 encePairwiseOnDemand]: 153/158 looper letters, 4 selfloop transitions, 5 changer transitions 3/26 dead transitions. [2021-06-11 16:05:26,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 135 flow [2021-06-11 16:05:26,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:05:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:05:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2021-06-11 16:05:26,194 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7645569620253164 [2021-06-11 16:05:26,194 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2021-06-11 16:05:26,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2021-06-11 16:05:26,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:26,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2021-06-11 16:05:26,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:26,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 158.0) internal successors, (948), 6 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:26,196 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 158.0) internal successors, (948), 6 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:26,196 INFO L185 Difference]: Start difference. First operand has 30 places, 19 transitions, 97 flow. Second operand 5 states and 604 transitions. [2021-06-11 16:05:26,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 135 flow [2021-06-11 16:05:26,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 127 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 16:05:26,198 INFO L241 Difference]: Finished difference. Result has 35 places, 23 transitions, 126 flow [2021-06-11 16:05:26,198 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2021-06-11 16:05:26,198 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2021-06-11 16:05:26,198 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:26,198 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 23 transitions, 126 flow [2021-06-11 16:05:26,199 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 126 flow [2021-06-11 16:05:26,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 23 transitions, 126 flow [2021-06-11 16:05:26,205 INFO L129 PetriNetUnfolder]: 9/49 cut-off events. [2021-06-11 16:05:26,205 INFO L130 PetriNetUnfolder]: For 82/87 co-relation queries the response was YES. [2021-06-11 16:05:26,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 49 events. 9/49 cut-off events. For 82/87 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 133 event pairs, 5 based on Foata normal form. 2/50 useless extension candidates. Maximal degree in co-relation 150. Up to 17 conditions per place. [2021-06-11 16:05:26,205 INFO L151 LiptonReduction]: Number of co-enabled transitions 70 [2021-06-11 16:05:26,207 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:05:26,207 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:05:26,207 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-06-11 16:05:26,208 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 126 flow [2021-06-11 16:05:26,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:26,208 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:26,208 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:26,208 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 16:05:26,208 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:26,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:26,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1503362191, now seen corresponding path program 1 times [2021-06-11 16:05:26,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:26,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154574665] [2021-06-11 16:05:26,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:26,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:26,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:05:26,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:26,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:05:26,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:26,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:05:26,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:26,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:26,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154574665] [2021-06-11 16:05:26,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:26,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:05:26,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636726932] [2021-06-11 16:05:26,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:05:26,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:26,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:05:26,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:05:26,256 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 158 [2021-06-11 16:05:26,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:26,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:26,257 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 158 [2021-06-11 16:05:26,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:26,292 INFO L129 PetriNetUnfolder]: 5/33 cut-off events. [2021-06-11 16:05:26,292 INFO L130 PetriNetUnfolder]: For 46/56 co-relation queries the response was YES. [2021-06-11 16:05:26,292 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 33 events. 5/33 cut-off events. For 46/56 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 61 event pairs, 0 based on Foata normal form. 14/47 useless extension candidates. Maximal degree in co-relation 103. Up to 12 conditions per place. [2021-06-11 16:05:26,293 INFO L132 encePairwiseOnDemand]: 153/158 looper letters, 2 selfloop transitions, 8 changer transitions 2/26 dead transitions. [2021-06-11 16:05:26,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 26 transitions, 164 flow [2021-06-11 16:05:26,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 16:05:26,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 16:05:26,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2021-06-11 16:05:26,295 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.759493670886076 [2021-06-11 16:05:26,295 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2021-06-11 16:05:26,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2021-06-11 16:05:26,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:26,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2021-06-11 16:05:26,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:26,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 158.0) internal successors, (1264), 8 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:26,298 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 158.0) internal successors, (1264), 8 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:26,298 INFO L185 Difference]: Start difference. First operand has 35 places, 23 transitions, 126 flow. Second operand 7 states and 840 transitions. [2021-06-11 16:05:26,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 26 transitions, 164 flow [2021-06-11 16:05:26,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 26 transitions, 143 flow, removed 7 selfloop flow, removed 3 redundant places. [2021-06-11 16:05:26,300 INFO L241 Difference]: Finished difference. Result has 41 places, 24 transitions, 138 flow [2021-06-11 16:05:26,300 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2021-06-11 16:05:26,300 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 14 predicate places. [2021-06-11 16:05:26,300 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:26,300 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 24 transitions, 138 flow [2021-06-11 16:05:26,301 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 24 transitions, 138 flow [2021-06-11 16:05:26,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 24 transitions, 138 flow [2021-06-11 16:05:26,305 INFO L129 PetriNetUnfolder]: 4/31 cut-off events. [2021-06-11 16:05:26,305 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-11 16:05:26,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 31 events. 4/31 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 90. Up to 12 conditions per place. [2021-06-11 16:05:26,306 INFO L151 LiptonReduction]: Number of co-enabled transitions 54 [2021-06-11 16:05:26,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:26,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:05:26,551 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 63 [2021-06-11 16:05:26,787 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 82 [2021-06-11 16:05:26,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:26,854 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:26,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:26,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 16:05:26,857 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:26,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:26,858 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 16:05:26,858 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:26,859 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:26,860 INFO L147 QuantifierPusher]: treesize reduction 50, result has 50.0 percent of original size 50 [2021-06-11 16:05:26,860 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:05:26,861 INFO L142 QuantifierPusher]: treesize reduction 50, result has 68.8 percent of original size [2021-06-11 16:05:26,861 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 1] term [2021-06-11 16:05:26,861 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:26,862 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:26,863 INFO L147 QuantifierPusher]: treesize reduction 76, result has 39.7 percent of original size 50 [2021-06-11 16:05:26,864 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 3, 2, 1] term [2021-06-11 16:05:26,864 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:05:26,864 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:26,867 INFO L147 QuantifierPusher]: treesize reduction 141, result has 44.3 percent of original size 112 [2021-06-11 16:05:26,870 INFO L163 LiptonReduction]: Checked pairs total: 6 [2021-06-11 16:05:26,871 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 16:05:26,871 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 571 [2021-06-11 16:05:26,871 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 136 flow [2021-06-11 16:05:26,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:26,871 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:26,871 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:26,872 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 16:05:26,872 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:26,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:26,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1723031713, now seen corresponding path program 1 times [2021-06-11 16:05:26,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:26,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439914787] [2021-06-11 16:05:26,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:05:26,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:26,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:05:26,937 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.9 percent of original size [2021-06-11 16:05:26,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-06-11 16:05:26,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:26,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:05:26,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:05:26,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 16:05:26,985 INFO L142 QuantifierPusher]: treesize reduction 37, result has 43.9 percent of original size [2021-06-11 16:05:26,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-06-11 16:05:27,007 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-06-11 16:05:27,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 16:05:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:05:27,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439914787] [2021-06-11 16:05:27,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:05:27,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 16:05:27,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513096822] [2021-06-11 16:05:27,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 16:05:27,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:05:27,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 16:05:27,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-11 16:05:27,033 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 160 [2021-06-11 16:05:27,034 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 23 transitions, 136 flow. Second operand has 8 states, 8 states have (on average 104.875) internal successors, (839), 8 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:27,034 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:05:27,034 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 160 [2021-06-11 16:05:27,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:05:27,131 INFO L129 PetriNetUnfolder]: 4/38 cut-off events. [2021-06-11 16:05:27,132 INFO L130 PetriNetUnfolder]: For 84/94 co-relation queries the response was YES. [2021-06-11 16:05:27,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 38 events. 4/38 cut-off events. For 84/94 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 92 event pairs, 0 based on Foata normal form. 8/45 useless extension candidates. Maximal degree in co-relation 133. Up to 16 conditions per place. [2021-06-11 16:05:27,132 INFO L132 encePairwiseOnDemand]: 155/160 looper letters, 5 selfloop transitions, 3 changer transitions 7/26 dead transitions. [2021-06-11 16:05:27,132 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 26 transitions, 180 flow [2021-06-11 16:05:27,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:05:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:05:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2021-06-11 16:05:27,134 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.66625 [2021-06-11 16:05:27,134 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 533 transitions. [2021-06-11 16:05:27,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 533 transitions. [2021-06-11 16:05:27,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:05:27,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 533 transitions. [2021-06-11 16:05:27,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:27,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 160.0) internal successors, (960), 6 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:27,136 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 160.0) internal successors, (960), 6 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:27,136 INFO L185 Difference]: Start difference. First operand has 39 places, 23 transitions, 136 flow. Second operand 5 states and 533 transitions. [2021-06-11 16:05:27,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 26 transitions, 180 flow [2021-06-11 16:05:27,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 26 transitions, 147 flow, removed 10 selfloop flow, removed 6 redundant places. [2021-06-11 16:05:27,137 INFO L241 Difference]: Finished difference. Result has 38 places, 18 transitions, 92 flow [2021-06-11 16:05:27,137 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=18} [2021-06-11 16:05:27,138 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2021-06-11 16:05:27,138 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:05:27,138 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 18 transitions, 92 flow [2021-06-11 16:05:27,138 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 18 transitions, 92 flow [2021-06-11 16:05:27,138 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 18 transitions, 92 flow [2021-06-11 16:05:27,140 INFO L129 PetriNetUnfolder]: 2/23 cut-off events. [2021-06-11 16:05:27,141 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-11 16:05:27,141 INFO L84 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 23 events. 2/23 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 1 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 61. Up to 7 conditions per place. [2021-06-11 16:05:27,141 INFO L151 LiptonReduction]: Number of co-enabled transitions 22 [2021-06-11 16:05:27,142 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:05:27,142 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:05:27,142 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4 [2021-06-11 16:05:27,142 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 18 transitions, 92 flow [2021-06-11 16:05:27,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 104.875) internal successors, (839), 8 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:05:27,142 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:05:27,143 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:05:27,143 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 16:05:27,143 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:05:27,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:05:27,143 INFO L82 PathProgramCache]: Analyzing trace with hash 812369778, now seen corresponding path program 1 times [2021-06-11 16:05:27,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:05:27,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316439698] [2021-06-11 16:05:27,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:05:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:05:27,176 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:05:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:05:27,208 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:05:27,226 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 16:05:27,226 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 16:05:27,226 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 16:05:27,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 04:05:27 BasicIcfg [2021-06-11 16:05:27,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 16:05:27,265 INFO L168 Benchmark]: Toolchain (without parser) took 21271.34 ms. Allocated memory was 352.3 MB in the beginning and 625.0 MB in the end (delta: 272.6 MB). Free memory was 314.1 MB in the beginning and 306.7 MB in the end (delta: 7.4 MB). Peak memory consumption was 281.9 MB. Max. memory is 16.0 GB. [2021-06-11 16:05:27,265 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 352.3 MB. Free memory was 332.3 MB in the beginning and 332.3 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 16:05:27,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 451.03 ms. Allocated memory is still 352.3 MB. Free memory was 314.0 MB in the beginning and 311.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-06-11 16:05:27,265 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.52 ms. Allocated memory is still 352.3 MB. Free memory was 311.9 MB in the beginning and 308.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-11 16:05:27,265 INFO L168 Benchmark]: Boogie Preprocessor took 47.68 ms. Allocated memory is still 352.3 MB. Free memory was 308.7 MB in the beginning and 306.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 16:05:27,265 INFO L168 Benchmark]: RCFGBuilder took 1443.37 ms. Allocated memory is still 352.3 MB. Free memory was 306.6 MB in the beginning and 290.1 MB in the end (delta: 16.5 MB). Peak memory consumption was 161.2 MB. Max. memory is 16.0 GB. [2021-06-11 16:05:27,266 INFO L168 Benchmark]: TraceAbstraction took 19264.27 ms. Allocated memory was 352.3 MB in the beginning and 625.0 MB in the end (delta: 272.6 MB). Free memory was 289.1 MB in the beginning and 306.7 MB in the end (delta: -17.6 MB). Peak memory consumption was 256.0 MB. Max. memory is 16.0 GB. [2021-06-11 16:05:27,266 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.39 ms. Allocated memory is still 352.3 MB. Free memory was 332.3 MB in the beginning and 332.3 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 451.03 ms. Allocated memory is still 352.3 MB. Free memory was 314.0 MB in the beginning and 311.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 60.52 ms. Allocated memory is still 352.3 MB. Free memory was 311.9 MB in the beginning and 308.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 47.68 ms. Allocated memory is still 352.3 MB. Free memory was 308.7 MB in the beginning and 306.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1443.37 ms. Allocated memory is still 352.3 MB. Free memory was 306.6 MB in the beginning and 290.1 MB in the end (delta: 16.5 MB). Peak memory consumption was 161.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 19264.27 ms. Allocated memory was 352.3 MB in the beginning and 625.0 MB in the end (delta: 272.6 MB). Free memory was 289.1 MB in the beginning and 306.7 MB in the end (delta: -17.6 MB). Peak memory consumption was 256.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16602.8ms, 83 PlacesBefore, 27 PlacesAfterwards, 78 TransitionsBefore, 22 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 78 TotalNumberOfCompositions, 2779 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1375, positive: 1258, positive conditional: 1258, positive unconditional: 0, negative: 117, negative conditional: 117, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1375, positive: 1258, positive conditional: 0, positive unconditional: 1258, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1375, positive: 1258, positive conditional: 0, positive unconditional: 1258, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 848, positive: 797, positive conditional: 0, positive unconditional: 797, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 848, positive: 767, positive conditional: 0, positive unconditional: 767, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 81, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 949, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 887, negative conditional: 0, negative unconditional: 887, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1375, positive: 461, positive conditional: 0, positive unconditional: 461, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 848, unknown conditional: 0, unknown unconditional: 848] , Statistics on independence cache: Total cache size (in pairs): 848, Positive cache size: 797, Positive conditional cache size: 0, Positive unconditional cache size: 797, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 123.5ms, 25 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 120 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, positive: 21, positive conditional: 4, positive unconditional: 17, negative: 14, negative conditional: 5, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, positive: 21, positive conditional: 4, positive unconditional: 17, negative: 14, negative conditional: 5, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 8, negative conditional: 5, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 5, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 118, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 118, negative conditional: 76, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, positive: 11, positive conditional: 2, positive unconditional: 9, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 18, unknown conditional: 7, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 866, Positive cache size: 807, Positive conditional cache size: 2, Positive unconditional cache size: 805, Negative cache size: 59, Negative conditional cache size: 5, Negative unconditional cache size: 54, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44.3ms, 24 PlacesBefore, 23 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, positive: 26, positive conditional: 26, 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: 39, positive: 26, positive conditional: 0, positive unconditional: 26, 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: 39, positive: 26, positive conditional: 0, positive unconditional: 26, 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: 13, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 879, Positive cache size: 817, Positive conditional cache size: 2, Positive unconditional cache size: 815, Negative cache size: 62, Negative conditional cache size: 5, Negative unconditional cache size: 57, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9ms, 24 PlacesBefore, 24 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 80 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 879, Positive cache size: 817, Positive conditional cache size: 2, Positive unconditional cache size: 815, Negative cache size: 62, Negative conditional cache size: 5, Negative unconditional cache size: 57, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 105.7ms, 32 PlacesBefore, 32 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 30 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, positive: 6, positive conditional: 2, positive unconditional: 4, negative: 5, negative conditional: 4, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 6, positive conditional: 2, positive unconditional: 4, negative: 5, negative conditional: 4, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 6, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, positive: 31, positive conditional: 31, positive unconditional: 0, negative: 61, negative conditional: 61, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 885, Positive cache size: 819, Positive conditional cache size: 4, Positive unconditional cache size: 815, Negative cache size: 66, Negative conditional cache size: 9, Negative unconditional cache size: 57, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 96.4ms, 30 PlacesBefore, 30 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 36 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, positive: 18, positive conditional: 12, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 18, positive conditional: 12, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, positive: 88, positive conditional: 88, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, positive: 10, positive conditional: 4, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 893, Positive cache size: 827, Positive conditional cache size: 12, Positive unconditional cache size: 815, Negative cache size: 66, Negative conditional cache size: 9, Negative unconditional cache size: 57, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3ms, 35 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 893, Positive cache size: 827, Positive conditional cache size: 12, Positive unconditional cache size: 815, Negative cache size: 66, Negative conditional cache size: 9, Negative unconditional cache size: 57, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 569.9ms, 41 PlacesBefore, 39 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 6 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, 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: 6, positive: 6, positive conditional: 2, positive unconditional: 4, 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: 6, positive: 6, positive conditional: 2, positive unconditional: 4, 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: 4, positive: 4, positive conditional: 1, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 6, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 897, Positive cache size: 831, Positive conditional cache size: 13, Positive unconditional cache size: 818, Negative cache size: 66, Negative conditional cache size: 9, Negative unconditional cache size: 57, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7ms, 38 PlacesBefore, 35 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 897, Positive cache size: 831, Positive conditional cache size: 13, Positive unconditional cache size: 818, Negative cache size: 66, Negative conditional cache size: 9, Negative unconditional cache size: 57, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2019; [L793] FCALL, FORK 0 pthread_create(&t2019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L794] 0 pthread_t t2020; [L795] FCALL, FORK 0 pthread_create(&t2020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L770] 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) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] 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) [L770] 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) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 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 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 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 [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L801] 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) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] 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) [L801] 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) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 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 [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 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 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] 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) [L812] 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) [L813] 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)) [L813] EXPR 0 !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) [L813] 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)) [L813] 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)) [L814] 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)) [L814] EXPR 0 !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) [L814] 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)) [L814] 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)) [L815] 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)) [L815] EXPR 0 !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) [L815] 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)) [L815] 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)) [L816] 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)) [L816] EXPR 0 !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) [L816] 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)) [L816] 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)) [L817] 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)) [L817] EXPR 0 !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) [L817] 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)) [L817] 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)) [L818] 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)) [L818] EXPR 0 !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) [L818] 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)) [L818] 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)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 19142.2ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 505.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16683.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 30 SDtfs, 19 SDslu, 10 SDs, 0 SdLazy, 147 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 173.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 220.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=7, InterpolantAutomatonStates: 36, 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: 22.0ms SsaConstructionTime, 295.7ms SatisfiabilityAnalysisTime, 447.0ms InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 549 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...