/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/mix053_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 15:51:39,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 15:51:39,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 15:51:39,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 15:51:39,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 15:51:39,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 15:51:39,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 15:51:39,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 15:51:39,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 15:51:39,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 15:51:39,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 15:51:39,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 15:51:39,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 15:51:39,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 15:51:39,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 15:51:39,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 15:51:39,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 15:51:39,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 15:51:39,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 15:51:39,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 15:51:39,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 15:51:39,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 15:51:39,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 15:51:39,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 15:51:39,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 15:51:39,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 15:51:39,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 15:51:39,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 15:51:39,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 15:51:39,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 15:51:39,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 15:51:39,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 15:51:39,439 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 15:51:39,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 15:51:39,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 15:51:39,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 15:51:39,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 15:51:39,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 15:51:39,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 15:51:39,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 15:51:39,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 15:51:39,445 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 15:51:39,483 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 15:51:39,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 15:51:39,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 15:51:39,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 15:51:39,486 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 15:51:39,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 15:51:39,486 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 15:51:39,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 15:51:39,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 15:51:39,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 15:51:39,487 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 15:51:39,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 15:51:39,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 15:51:39,487 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 15:51:39,487 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 15:51:39,487 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 15:51:39,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 15:51:39,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 15:51:39,488 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 15:51:39,488 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 15:51:39,488 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 15:51:39,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:51:39,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 15:51:39,488 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 15:51:39,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 15:51:39,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 15:51:39,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 15:51:39,489 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 15:51:39,489 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 15:51:39,489 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 15:51:39,489 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 15:51:39,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 15:51:39,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 15:51:39,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 15:51:39,846 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 15:51:39,846 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 15:51:39,847 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_rmo.oepc.i [2021-06-11 15:51:39,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a914010a/7c27d095c18d405ca676b98acb3fa691/FLAG645d2a8d9 [2021-06-11 15:51:40,455 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 15:51:40,456 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_rmo.oepc.i [2021-06-11 15:51:40,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a914010a/7c27d095c18d405ca676b98acb3fa691/FLAG645d2a8d9 [2021-06-11 15:51:40,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a914010a/7c27d095c18d405ca676b98acb3fa691 [2021-06-11 15:51:40,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 15:51:40,918 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 15:51:40,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 15:51:40,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 15:51:40,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 15:51:40,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:51:40" (1/1) ... [2021-06-11 15:51:40,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41385188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:40, skipping insertion in model container [2021-06-11 15:51:40,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:51:40" (1/1) ... [2021-06-11 15:51:40,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 15:51:40,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 15:51:41,147 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/mix053_rmo.oepc.i[949,962] [2021-06-11 15:51:41,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:51:41,378 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 15:51:41,387 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/mix053_rmo.oepc.i[949,962] [2021-06-11 15:51:41,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:51:41,503 INFO L208 MainTranslator]: Completed translation [2021-06-11 15:51:41,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:41 WrapperNode [2021-06-11 15:51:41,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 15:51:41,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 15:51:41,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 15:51:41,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 15:51:41,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:41" (1/1) ... [2021-06-11 15:51:41,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:41" (1/1) ... [2021-06-11 15:51:41,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 15:51:41,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 15:51:41,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 15:51:41,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 15:51:41,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:41" (1/1) ... [2021-06-11 15:51:41,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:41" (1/1) ... [2021-06-11 15:51:41,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:41" (1/1) ... [2021-06-11 15:51:41,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:41" (1/1) ... [2021-06-11 15:51:41,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:41" (1/1) ... [2021-06-11 15:51:41,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:41" (1/1) ... [2021-06-11 15:51:41,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:41" (1/1) ... [2021-06-11 15:51:41,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 15:51:41,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 15:51:41,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 15:51:41,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 15:51:41,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:41" (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 15:51:41,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 15:51:41,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 15:51:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 15:51:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 15:51:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 15:51:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 15:51:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 15:51:41,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 15:51:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 15:51:41,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 15:51:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-11 15:51:41,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-11 15:51:41,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 15:51:41,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 15:51:41,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 15:51:41,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 15:51:41,735 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 15:51:43,822 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 15:51:43,822 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 15:51:43,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:51:43 BoogieIcfgContainer [2021-06-11 15:51:43,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 15:51:43,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 15:51:43,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 15:51:43,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 15:51:43,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 03:51:40" (1/3) ... [2021-06-11 15:51:43,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d08e880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:51:43, skipping insertion in model container [2021-06-11 15:51:43,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:51:41" (2/3) ... [2021-06-11 15:51:43,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d08e880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:51:43, skipping insertion in model container [2021-06-11 15:51:43,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:51:43" (3/3) ... [2021-06-11 15:51:43,830 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_rmo.oepc.i [2021-06-11 15:51:43,835 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 15:51:43,838 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 15:51:43,838 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 15:51:43,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,871 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,871 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,872 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,872 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,872 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,872 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,872 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,873 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,876 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,876 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,877 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,877 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,880 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,880 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,880 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,880 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,883 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,883 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,883 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,883 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,884 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,884 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,884 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,884 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,884 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,884 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,884 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,885 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,885 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,885 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,885 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,885 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,885 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,885 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,885 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,885 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,887 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,887 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,887 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,887 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,887 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,887 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,887 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,887 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,887 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,887 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,887 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,888 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,888 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,888 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,888 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,888 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,890 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,890 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,890 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,890 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,890 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,890 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,890 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,890 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,891 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,891 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,891 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,891 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,891 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,891 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,891 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,891 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,891 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,891 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,891 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,892 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,892 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,892 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,892 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,892 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,892 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,892 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,892 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,892 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,892 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,892 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,893 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,893 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,893 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,893 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,893 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,893 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,893 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,893 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,895 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,895 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,895 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,895 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,895 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,896 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,896 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,896 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,896 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,896 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,896 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,896 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,896 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,897 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,897 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,897 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,897 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,897 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,900 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,900 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,900 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,902 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,902 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,904 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,904 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,912 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,912 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,912 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,913 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,913 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,913 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,913 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,913 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,913 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,913 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,913 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,913 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,916 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,916 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,916 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,916 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:51:43,917 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 15:51:43,934 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-11 15:51:43,952 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 15:51:43,952 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 15:51:43,953 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 15:51:43,953 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 15:51:43,953 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 15:51:43,953 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 15:51:43,953 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 15:51:43,953 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 15:51:43,963 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2021-06-11 15:51:43,998 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-06-11 15:51:43,998 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:51:44,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-06-11 15:51:44,002 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 115 transitions, 250 flow [2021-06-11 15:51:44,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 111 transitions, 234 flow [2021-06-11 15:51:44,008 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:51:44,019 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 234 flow [2021-06-11 15:51:44,022 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 234 flow [2021-06-11 15:51:44,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 234 flow [2021-06-11 15:51:44,041 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-06-11 15:51:44,042 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:51:44,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-06-11 15:51:44,046 INFO L151 LiptonReduction]: Number of co-enabled transitions 2672 [2021-06-11 15:51:44,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:44,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:44,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:44,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:44,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:44,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:44,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:44,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:44,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:44,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:44,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,529 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 15:51:44,529 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:44,555 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:44,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:44,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:44,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:44,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:44,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:44,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:44,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:44,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:45,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,054 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:45,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:51:45,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:51:45,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,112 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:45,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:51:45,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:51:45,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:45,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:45,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:45,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:45,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,393 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:45,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:51:45,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:51:45,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:45,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:45,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:45,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,562 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:45,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:51:45,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:51:45,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:45,759 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 15:51:45,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:45,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:45,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,908 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:45,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:51:45,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:51:45,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:45,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:46,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:46,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:46,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:46,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:46,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:46,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:46,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:46,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:46,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:46,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:46,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:46,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:46,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:46,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:46,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:46,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:46,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:46,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:46,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:46,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:46,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:46,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:46,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:46,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:46,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:46,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:46,803 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 15:51:47,194 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 15:51:47,318 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 15:51:47,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:47,341 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:47,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:47,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:51:47,354 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:47,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:47,360 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-11 15:51:47,360 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:47,364 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:47,367 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-11 15:51:47,368 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:47,370 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-11 15:51:47,371 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-11 15:51:47,371 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:47,373 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:47,378 INFO L147 QuantifierPusher]: treesize reduction 113, result has 30.7 percent of original size 50 [2021-06-11 15:51:47,379 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-11 15:51:47,380 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:47,384 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:47,399 INFO L147 QuantifierPusher]: treesize reduction 176, result has 33.3 percent of original size 88 [2021-06-11 15:51:47,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:47,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:47,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:47,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:47,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:47,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:47,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:47,733 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:47,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:47,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:51:47,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:51:47,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:47,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:47,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:47,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:47,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:47,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:47,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:47,931 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:47,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:47,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:51:47,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:51:47,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:47,996 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 15:51:48,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:48,067 INFO L147 QuantifierPusher]: treesize reduction 29, result has 3.3 percent of original size 1 [2021-06-11 15:51:48,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:48,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:48,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:48,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:48,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:48,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:48,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:48,460 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:48,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:48,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:51:48,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:51:48,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:48,574 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:48,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:48,578 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:48,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:48,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 15:51:48,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:51:48,581 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:48,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:48,583 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:48,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:48,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 15:51:48,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 15:51:48,584 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:48,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:48,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 15:51:48,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:51:48,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:48,872 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:48,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:48,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:51:48,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:51:48,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:48,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:49,353 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-11 15:51:49,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:49,360 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:49,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:49,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:51:49,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:51:49,711 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-06-11 15:51:49,851 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-06-11 15:51:50,163 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-06-11 15:51:50,306 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-06-11 15:51:50,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:50,318 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:50,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:50,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:51:50,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:51:50,334 INFO L163 LiptonReduction]: Checked pairs total: 8383 [2021-06-11 15:51:50,334 INFO L165 LiptonReduction]: Total number of compositions: 97 [2021-06-11 15:51:50,337 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6331 [2021-06-11 15:51:50,343 INFO L129 PetriNetUnfolder]: 0/3 cut-off events. [2021-06-11 15:51:50,343 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:51:50,344 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:51:50,344 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-06-11 15:51:50,344 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:51:50,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:51:50,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1209179, now seen corresponding path program 1 times [2021-06-11 15:51:50,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:51:50,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448185257] [2021-06-11 15:51:50,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:51:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:51:50,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:50,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:51:50,489 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 15:51:50,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448185257] [2021-06-11 15:51:50,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:51:50,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:51:50,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632481892] [2021-06-11 15:51:50,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:51:50,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:51:50,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:51:50,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:51:50,510 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 212 [2021-06-11 15:51:50,515 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 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 15:51:50,515 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:51:50,515 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 212 [2021-06-11 15:51:50,516 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:51:50,688 INFO L129 PetriNetUnfolder]: 133/319 cut-off events. [2021-06-11 15:51:50,688 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:51:50,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 319 events. 133/319 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1712 event pairs, 110 based on Foata normal form. 65/354 useless extension candidates. Maximal degree in co-relation 527. Up to 153 conditions per place. [2021-06-11 15:51:50,693 INFO L132 encePairwiseOnDemand]: 207/212 looper letters, 11 selfloop transitions, 2 changer transitions 1/38 dead transitions. [2021-06-11 15:51:50,693 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 38 transitions, 114 flow [2021-06-11 15:51:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:51:50,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:51:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 549 transitions. [2021-06-11 15:51:50,705 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8632075471698113 [2021-06-11 15:51:50,706 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 549 transitions. [2021-06-11 15:51:50,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 549 transitions. [2021-06-11 15:51:50,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:51:50,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 549 transitions. [2021-06-11 15:51:50,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 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 15:51:50,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 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 15:51:50,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 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 15:51:50,722 INFO L185 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 549 transitions. [2021-06-11 15:51:50,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 38 transitions, 114 flow [2021-06-11 15:51:50,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-06-11 15:51:50,726 INFO L241 Difference]: Finished difference. Result has 44 places, 32 transitions, 76 flow [2021-06-11 15:51:50,727 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2021-06-11 15:51:50,728 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2021-06-11 15:51:50,728 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:51:50,728 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 32 transitions, 76 flow [2021-06-11 15:51:50,729 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 32 transitions, 76 flow [2021-06-11 15:51:50,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 76 flow [2021-06-11 15:51:50,734 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-06-11 15:51:50,734 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:51:50,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 15:51:50,735 INFO L151 LiptonReduction]: Number of co-enabled transitions 520 [2021-06-11 15:51:50,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:50,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:51,140 INFO L163 LiptonReduction]: Checked pairs total: 1166 [2021-06-11 15:51:51,141 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 15:51:51,141 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 413 [2021-06-11 15:51:51,142 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2021-06-11 15:51:51,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 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 15:51:51,142 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:51:51,143 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:51:51,143 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 15:51:51,143 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:51:51,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:51:51,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1124436900, now seen corresponding path program 1 times [2021-06-11 15:51:51,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:51:51,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713313661] [2021-06-11 15:51:51,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:51:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:51:51,226 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-06-11 15:51:51,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 15:51:51,236 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-11 15:51:51,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 15:51:51,251 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 15:51:51,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713313661] [2021-06-11 15:51:51,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:51:51,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:51:51,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208693647] [2021-06-11 15:51:51,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:51:51,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:51:51,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:51:51,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:51:51,255 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 214 [2021-06-11 15:51:51,255 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 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 15:51:51,255 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:51:51,255 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 214 [2021-06-11 15:51:51,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:51:51,383 INFO L129 PetriNetUnfolder]: 303/711 cut-off events. [2021-06-11 15:51:51,383 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:51:51,386 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 711 events. 303/711 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4616 event pairs, 54 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 1198. Up to 189 conditions per place. [2021-06-11 15:51:51,388 INFO L132 encePairwiseOnDemand]: 205/214 looper letters, 7 selfloop transitions, 7 changer transitions 14/50 dead transitions. [2021-06-11 15:51:51,388 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 168 flow [2021-06-11 15:51:51,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:51:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:51:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2021-06-11 15:51:51,391 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7794392523364486 [2021-06-11 15:51:51,391 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 834 transitions. [2021-06-11 15:51:51,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 834 transitions. [2021-06-11 15:51:51,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:51:51,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 834 transitions. [2021-06-11 15:51:51,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:51:51,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 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 15:51:51,397 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 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 15:51:51,398 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 5 states and 834 transitions. [2021-06-11 15:51:51,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 168 flow [2021-06-11 15:51:51,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:51:51,399 INFO L241 Difference]: Finished difference. Result has 48 places, 36 transitions, 134 flow [2021-06-11 15:51:51,399 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2021-06-11 15:51:51,400 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2021-06-11 15:51:51,400 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:51:51,400 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 36 transitions, 134 flow [2021-06-11 15:51:51,401 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 134 flow [2021-06-11 15:51:51,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 134 flow [2021-06-11 15:51:51,445 INFO L129 PetriNetUnfolder]: 158/438 cut-off events. [2021-06-11 15:51:51,445 INFO L130 PetriNetUnfolder]: For 138/193 co-relation queries the response was YES. [2021-06-11 15:51:51,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 438 events. 158/438 cut-off events. For 138/193 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2789 event pairs, 48 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 948. Up to 189 conditions per place. [2021-06-11 15:51:51,450 INFO L151 LiptonReduction]: Number of co-enabled transitions 586 [2021-06-11 15:51:51,580 INFO L163 LiptonReduction]: Checked pairs total: 362 [2021-06-11 15:51:51,581 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:51:51,581 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 181 [2021-06-11 15:51:51,581 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 134 flow [2021-06-11 15:51:51,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 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 15:51:51,582 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:51:51,582 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:51:51,582 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 15:51:51,582 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:51:51,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:51:51,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1684726933, now seen corresponding path program 1 times [2021-06-11 15:51:51,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:51:51,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554603940] [2021-06-11 15:51:51,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:51:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:51:51,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:51,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:51:51,642 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-06-11 15:51:51,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 15:51:51,651 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 15:51:51,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554603940] [2021-06-11 15:51:51,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:51:51,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:51:51,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191806227] [2021-06-11 15:51:51,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:51:51,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:51:51,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:51:51,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:51:51,653 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 214 [2021-06-11 15:51:51,654 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 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 15:51:51,654 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:51:51,654 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 214 [2021-06-11 15:51:51,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:51:51,722 INFO L129 PetriNetUnfolder]: 133/413 cut-off events. [2021-06-11 15:51:51,722 INFO L130 PetriNetUnfolder]: For 164/691 co-relation queries the response was YES. [2021-06-11 15:51:51,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 413 events. 133/413 cut-off events. For 164/691 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2629 event pairs, 30 based on Foata normal form. 8/398 useless extension candidates. Maximal degree in co-relation 1087. Up to 163 conditions per place. [2021-06-11 15:51:51,725 INFO L132 encePairwiseOnDemand]: 206/214 looper letters, 13 selfloop transitions, 11 changer transitions 0/46 dead transitions. [2021-06-11 15:51:51,725 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 242 flow [2021-06-11 15:51:51,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:51:51,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:51:51,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 700 transitions. [2021-06-11 15:51:51,727 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8177570093457944 [2021-06-11 15:51:51,728 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 700 transitions. [2021-06-11 15:51:51,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 700 transitions. [2021-06-11 15:51:51,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:51:51,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 700 transitions. [2021-06-11 15:51:51,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 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 15:51:51,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:51:51,732 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:51:51,732 INFO L185 Difference]: Start difference. First operand has 45 places, 36 transitions, 134 flow. Second operand 4 states and 700 transitions. [2021-06-11 15:51:51,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 242 flow [2021-06-11 15:51:51,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 196 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-06-11 15:51:51,736 INFO L241 Difference]: Finished difference. Result has 47 places, 43 transitions, 192 flow [2021-06-11 15:51:51,736 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2021-06-11 15:51:51,737 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2021-06-11 15:51:51,737 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:51:51,737 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 43 transitions, 192 flow [2021-06-11 15:51:51,737 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 43 transitions, 192 flow [2021-06-11 15:51:51,737 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 192 flow [2021-06-11 15:51:51,776 INFO L129 PetriNetUnfolder]: 133/375 cut-off events. [2021-06-11 15:51:51,776 INFO L130 PetriNetUnfolder]: For 212/340 co-relation queries the response was YES. [2021-06-11 15:51:51,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 375 events. 133/375 cut-off events. For 212/340 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2243 event pairs, 30 based on Foata normal form. 1/351 useless extension candidates. Maximal degree in co-relation 870. Up to 163 conditions per place. [2021-06-11 15:51:51,781 INFO L151 LiptonReduction]: Number of co-enabled transitions 724 [2021-06-11 15:51:51,819 INFO L163 LiptonReduction]: Checked pairs total: 483 [2021-06-11 15:51:51,819 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:51:51,819 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 82 [2021-06-11 15:51:51,820 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 192 flow [2021-06-11 15:51:51,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 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 15:51:51,820 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:51:51,821 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:51:51,821 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 15:51:51,821 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:51:51,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:51:51,821 INFO L82 PathProgramCache]: Analyzing trace with hash 825938546, now seen corresponding path program 1 times [2021-06-11 15:51:51,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:51:51,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992676225] [2021-06-11 15:51:51,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:51:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:51:51,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:51,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:51:51,866 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-06-11 15:51:51,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 15:51:51,875 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 15:51:51,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992676225] [2021-06-11 15:51:51,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:51:51,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:51:51,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49574511] [2021-06-11 15:51:51,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:51:51,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:51:51,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:51:51,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:51:51,878 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 214 [2021-06-11 15:51:51,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 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 15:51:51,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:51:51,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 214 [2021-06-11 15:51:51,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:51:51,965 INFO L129 PetriNetUnfolder]: 117/351 cut-off events. [2021-06-11 15:51:51,965 INFO L130 PetriNetUnfolder]: For 285/946 co-relation queries the response was YES. [2021-06-11 15:51:51,967 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 351 events. 117/351 cut-off events. For 285/946 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2114 event pairs, 30 based on Foata normal form. 16/348 useless extension candidates. Maximal degree in co-relation 1002. Up to 143 conditions per place. [2021-06-11 15:51:51,968 INFO L132 encePairwiseOnDemand]: 206/214 looper letters, 14 selfloop transitions, 17 changer transitions 0/53 dead transitions. [2021-06-11 15:51:51,968 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 312 flow [2021-06-11 15:51:51,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:51:51,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:51:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 700 transitions. [2021-06-11 15:51:51,971 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8177570093457944 [2021-06-11 15:51:51,971 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 700 transitions. [2021-06-11 15:51:51,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 700 transitions. [2021-06-11 15:51:51,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:51:51,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 700 transitions. [2021-06-11 15:51:51,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 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 15:51:51,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:51:51,975 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:51:51,975 INFO L185 Difference]: Start difference. First operand has 47 places, 43 transitions, 192 flow. Second operand 4 states and 700 transitions. [2021-06-11 15:51:51,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 312 flow [2021-06-11 15:51:51,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 312 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 15:51:51,979 INFO L241 Difference]: Finished difference. Result has 52 places, 50 transitions, 298 flow [2021-06-11 15:51:51,979 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2021-06-11 15:51:51,979 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2021-06-11 15:51:51,979 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:51:51,979 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 50 transitions, 298 flow [2021-06-11 15:51:51,979 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 50 transitions, 298 flow [2021-06-11 15:51:51,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 50 transitions, 298 flow [2021-06-11 15:51:52,018 INFO L129 PetriNetUnfolder]: 117/343 cut-off events. [2021-06-11 15:51:52,019 INFO L130 PetriNetUnfolder]: For 497/684 co-relation queries the response was YES. [2021-06-11 15:51:52,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 343 events. 117/343 cut-off events. For 497/684 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2055 event pairs, 18 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 987. Up to 143 conditions per place. [2021-06-11 15:51:52,023 INFO L151 LiptonReduction]: Number of co-enabled transitions 838 [2021-06-11 15:51:52,032 INFO L163 LiptonReduction]: Checked pairs total: 656 [2021-06-11 15:51:52,032 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:51:52,032 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 53 [2021-06-11 15:51:52,034 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 298 flow [2021-06-11 15:51:52,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 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 15:51:52,035 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:51:52,035 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:51:52,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 15:51:52,035 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:51:52,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:51:52,035 INFO L82 PathProgramCache]: Analyzing trace with hash 388422774, now seen corresponding path program 1 times [2021-06-11 15:51:52,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:51:52,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615508271] [2021-06-11 15:51:52,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:51:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:51:52,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:52,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:51:52,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:52,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:51:52,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:52,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:52,133 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 15:51:52,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615508271] [2021-06-11 15:51:52,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:51:52,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:51:52,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645030209] [2021-06-11 15:51:52,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:51:52,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:51:52,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:51:52,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:51:52,136 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 214 [2021-06-11 15:51:52,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 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 15:51:52,137 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:51:52,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 214 [2021-06-11 15:51:52,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:51:52,348 INFO L129 PetriNetUnfolder]: 896/1749 cut-off events. [2021-06-11 15:51:52,349 INFO L130 PetriNetUnfolder]: For 882/1094 co-relation queries the response was YES. [2021-06-11 15:51:52,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4029 conditions, 1749 events. 896/1749 cut-off events. For 882/1094 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 13571 event pairs, 291 based on Foata normal form. 115/1542 useless extension candidates. Maximal degree in co-relation 4011. Up to 826 conditions per place. [2021-06-11 15:51:52,378 INFO L132 encePairwiseOnDemand]: 206/214 looper letters, 10 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2021-06-11 15:51:52,378 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 370 flow [2021-06-11 15:51:52,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:51:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:51:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 889 transitions. [2021-06-11 15:51:52,381 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8308411214953271 [2021-06-11 15:51:52,381 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 889 transitions. [2021-06-11 15:51:52,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 889 transitions. [2021-06-11 15:51:52,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:51:52,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 889 transitions. [2021-06-11 15:51:52,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 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 15:51:52,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 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 15:51:52,386 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 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 15:51:52,386 INFO L185 Difference]: Start difference. First operand has 52 places, 50 transitions, 298 flow. Second operand 5 states and 889 transitions. [2021-06-11 15:51:52,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 370 flow [2021-06-11 15:51:52,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 370 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 15:51:52,391 INFO L241 Difference]: Finished difference. Result has 59 places, 60 transitions, 382 flow [2021-06-11 15:51:52,391 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=382, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2021-06-11 15:51:52,391 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2021-06-11 15:51:52,391 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:51:52,392 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 60 transitions, 382 flow [2021-06-11 15:51:52,392 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 60 transitions, 382 flow [2021-06-11 15:51:52,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 60 transitions, 382 flow [2021-06-11 15:51:52,529 INFO L129 PetriNetUnfolder]: 768/1596 cut-off events. [2021-06-11 15:51:52,529 INFO L130 PetriNetUnfolder]: For 1639/2151 co-relation queries the response was YES. [2021-06-11 15:51:52,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4771 conditions, 1596 events. 768/1596 cut-off events. For 1639/2151 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 12862 event pairs, 286 based on Foata normal form. 14/1414 useless extension candidates. Maximal degree in co-relation 4750. Up to 975 conditions per place. [2021-06-11 15:51:52,556 INFO L151 LiptonReduction]: Number of co-enabled transitions 1222 [2021-06-11 15:51:52,591 INFO L163 LiptonReduction]: Checked pairs total: 840 [2021-06-11 15:51:52,592 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:51:52,592 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 201 [2021-06-11 15:51:52,592 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 382 flow [2021-06-11 15:51:52,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 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 15:51:52,593 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:51:52,593 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:51:52,593 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 15:51:52,593 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:51:52,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:51:52,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1055567994, now seen corresponding path program 1 times [2021-06-11 15:51:52,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:51:52,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875616242] [2021-06-11 15:51:52,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:51:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:51:52,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:52,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:52,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:52,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:51:52,629 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 15:51:52,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875616242] [2021-06-11 15:51:52,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:51:52,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:51:52,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744650838] [2021-06-11 15:51:52,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:51:52,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:51:52,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:51:52,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:51:52,631 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 214 [2021-06-11 15:51:52,632 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:51:52,632 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:51:52,632 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 214 [2021-06-11 15:51:52,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:51:52,857 INFO L129 PetriNetUnfolder]: 1091/2234 cut-off events. [2021-06-11 15:51:52,857 INFO L130 PetriNetUnfolder]: For 2666/3560 co-relation queries the response was YES. [2021-06-11 15:51:52,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6718 conditions, 2234 events. 1091/2234 cut-off events. For 2666/3560 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 18949 event pairs, 471 based on Foata normal form. 59/1999 useless extension candidates. Maximal degree in co-relation 6695. Up to 1528 conditions per place. [2021-06-11 15:51:52,882 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 4 selfloop transitions, 9 changer transitions 0/60 dead transitions. [2021-06-11 15:51:52,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 408 flow [2021-06-11 15:51:52,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:51:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:51:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 561 transitions. [2021-06-11 15:51:52,884 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8738317757009346 [2021-06-11 15:51:52,884 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 561 transitions. [2021-06-11 15:51:52,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 561 transitions. [2021-06-11 15:51:52,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:51:52,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 561 transitions. [2021-06-11 15:51:52,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 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 15:51:52,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:51:52,888 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:51:52,888 INFO L185 Difference]: Start difference. First operand has 59 places, 60 transitions, 382 flow. Second operand 3 states and 561 transitions. [2021-06-11 15:51:52,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 408 flow [2021-06-11 15:51:52,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 408 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 15:51:52,902 INFO L241 Difference]: Finished difference. Result has 62 places, 60 transitions, 411 flow [2021-06-11 15:51:52,902 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2021-06-11 15:51:52,902 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 14 predicate places. [2021-06-11 15:51:52,902 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:51:52,902 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 60 transitions, 411 flow [2021-06-11 15:51:52,903 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 60 transitions, 411 flow [2021-06-11 15:51:52,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 60 transitions, 411 flow [2021-06-11 15:51:53,089 INFO L129 PetriNetUnfolder]: 1109/2269 cut-off events. [2021-06-11 15:51:53,090 INFO L130 PetriNetUnfolder]: For 2575/3267 co-relation queries the response was YES. [2021-06-11 15:51:53,103 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6836 conditions, 2269 events. 1109/2269 cut-off events. For 2575/3267 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 19295 event pairs, 452 based on Foata normal form. 17/2055 useless extension candidates. Maximal degree in co-relation 6813. Up to 1546 conditions per place. [2021-06-11 15:51:53,128 INFO L151 LiptonReduction]: Number of co-enabled transitions 1222 [2021-06-11 15:51:53,151 INFO L163 LiptonReduction]: Checked pairs total: 840 [2021-06-11 15:51:53,151 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:51:53,151 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 249 [2021-06-11 15:51:53,152 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 411 flow [2021-06-11 15:51:53,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:51:53,152 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:51:53,153 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:51:53,153 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 15:51:53,153 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:51:53,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:51:53,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1823930135, now seen corresponding path program 1 times [2021-06-11 15:51:53,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:51:53,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925213522] [2021-06-11 15:51:53,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:51:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:51:53,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:53,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:51:53,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:53,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:51:53,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:53,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:51:53,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:53,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:53,253 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 15:51:53,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925213522] [2021-06-11 15:51:53,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:51:53,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:51:53,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875684805] [2021-06-11 15:51:53,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:51:53,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:51:53,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:51:53,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:51:53,255 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 214 [2021-06-11 15:51:53,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 411 flow. Second operand has 5 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 0 states have call successors, (0), 0 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 15:51:53,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:51:53,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 214 [2021-06-11 15:51:53,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:51:53,534 INFO L129 PetriNetUnfolder]: 1036/2112 cut-off events. [2021-06-11 15:51:53,534 INFO L130 PetriNetUnfolder]: For 3484/6227 co-relation queries the response was YES. [2021-06-11 15:51:53,549 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7999 conditions, 2112 events. 1036/2112 cut-off events. For 3484/6227 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 17391 event pairs, 121 based on Foata normal form. 517/2399 useless extension candidates. Maximal degree in co-relation 7974. Up to 1428 conditions per place. [2021-06-11 15:51:53,560 INFO L132 encePairwiseOnDemand]: 206/214 looper letters, 10 selfloop transitions, 22 changer transitions 0/74 dead transitions. [2021-06-11 15:51:53,560 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 74 transitions, 556 flow [2021-06-11 15:51:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:51:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:51:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1245 transitions. [2021-06-11 15:51:53,563 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8311081441922563 [2021-06-11 15:51:53,563 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1245 transitions. [2021-06-11 15:51:53,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1245 transitions. [2021-06-11 15:51:53,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:51:53,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1245 transitions. [2021-06-11 15:51:53,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 177.85714285714286) internal successors, (1245), 7 states have internal predecessors, (1245), 0 states have call successors, (0), 0 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 15:51:53,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 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 15:51:53,569 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 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 15:51:53,569 INFO L185 Difference]: Start difference. First operand has 62 places, 60 transitions, 411 flow. Second operand 7 states and 1245 transitions. [2021-06-11 15:51:53,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 74 transitions, 556 flow [2021-06-11 15:51:53,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 74 transitions, 545 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-11 15:51:53,583 INFO L241 Difference]: Finished difference. Result has 70 places, 70 transitions, 548 flow [2021-06-11 15:51:53,584 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=548, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2021-06-11 15:51:53,584 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2021-06-11 15:51:53,584 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:51:53,584 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 70 transitions, 548 flow [2021-06-11 15:51:53,584 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 70 transitions, 548 flow [2021-06-11 15:51:53,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 70 transitions, 548 flow [2021-06-11 15:51:53,764 INFO L129 PetriNetUnfolder]: 949/2027 cut-off events. [2021-06-11 15:51:53,764 INFO L130 PetriNetUnfolder]: For 8011/10965 co-relation queries the response was YES. [2021-06-11 15:51:53,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9050 conditions, 2027 events. 949/2027 cut-off events. For 8011/10965 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 17166 event pairs, 110 based on Foata normal form. 47/1885 useless extension candidates. Maximal degree in co-relation 9023. Up to 1371 conditions per place. [2021-06-11 15:51:53,805 INFO L151 LiptonReduction]: Number of co-enabled transitions 1578 [2021-06-11 15:51:53,825 INFO L163 LiptonReduction]: Checked pairs total: 1376 [2021-06-11 15:51:53,826 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:51:53,826 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 242 [2021-06-11 15:51:53,826 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 548 flow [2021-06-11 15:51:53,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 0 states have call successors, (0), 0 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 15:51:53,827 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:51:53,827 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:51:53,827 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 15:51:53,827 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:51:53,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:51:53,827 INFO L82 PathProgramCache]: Analyzing trace with hash 828263353, now seen corresponding path program 1 times [2021-06-11 15:51:53,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:51:53,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314867612] [2021-06-11 15:51:53,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:51:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:51:53,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:53,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:51:53,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:53,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:51:53,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:53,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:51:53,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:53,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:51:53,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:53,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:53,913 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 15:51:53,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314867612] [2021-06-11 15:51:53,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:51:53,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:51:53,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503821691] [2021-06-11 15:51:53,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:51:53,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:51:53,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:51:53,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:51:53,916 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 214 [2021-06-11 15:51:53,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 548 flow. Second operand has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 0 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 15:51:53,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:51:53,917 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 214 [2021-06-11 15:51:53,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:51:54,258 INFO L129 PetriNetUnfolder]: 895/1854 cut-off events. [2021-06-11 15:51:54,258 INFO L130 PetriNetUnfolder]: For 9292/17638 co-relation queries the response was YES. [2021-06-11 15:51:54,272 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9867 conditions, 1854 events. 895/1854 cut-off events. For 9292/17638 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 15120 event pairs, 21 based on Foata normal form. 735/2373 useless extension candidates. Maximal degree in co-relation 9838. Up to 1326 conditions per place. [2021-06-11 15:51:54,286 INFO L132 encePairwiseOnDemand]: 206/214 looper letters, 6 selfloop transitions, 32 changer transitions 4/84 dead transitions. [2021-06-11 15:51:54,286 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 84 transitions, 766 flow [2021-06-11 15:51:54,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 15:51:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 15:51:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1601 transitions. [2021-06-11 15:51:54,290 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8312564901349948 [2021-06-11 15:51:54,290 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1601 transitions. [2021-06-11 15:51:54,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1601 transitions. [2021-06-11 15:51:54,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:51:54,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1601 transitions. [2021-06-11 15:51:54,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 177.88888888888889) internal successors, (1601), 9 states have internal predecessors, (1601), 0 states have call successors, (0), 0 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 15:51:54,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 214.0) internal successors, (2140), 10 states have internal predecessors, (2140), 0 states have call successors, (0), 0 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 15:51:54,301 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 214.0) internal successors, (2140), 10 states have internal predecessors, (2140), 0 states have call successors, (0), 0 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 15:51:54,301 INFO L185 Difference]: Start difference. First operand has 70 places, 70 transitions, 548 flow. Second operand 9 states and 1601 transitions. [2021-06-11 15:51:54,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 84 transitions, 766 flow [2021-06-11 15:51:54,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 84 transitions, 711 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-06-11 15:51:54,371 INFO L241 Difference]: Finished difference. Result has 78 places, 80 transitions, 690 flow [2021-06-11 15:51:54,371 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=690, PETRI_PLACES=78, PETRI_TRANSITIONS=80} [2021-06-11 15:51:54,372 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 30 predicate places. [2021-06-11 15:51:54,372 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:51:54,372 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 80 transitions, 690 flow [2021-06-11 15:51:54,372 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 80 transitions, 690 flow [2021-06-11 15:51:54,373 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 80 transitions, 690 flow [2021-06-11 15:51:54,542 INFO L129 PetriNetUnfolder]: 850/1811 cut-off events. [2021-06-11 15:51:54,542 INFO L130 PetriNetUnfolder]: For 10052/11359 co-relation queries the response was YES. [2021-06-11 15:51:54,556 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8948 conditions, 1811 events. 850/1811 cut-off events. For 10052/11359 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 14877 event pairs, 19 based on Foata normal form. 1/1619 useless extension candidates. Maximal degree in co-relation 8918. Up to 945 conditions per place. [2021-06-11 15:51:54,578 INFO L151 LiptonReduction]: Number of co-enabled transitions 1736 [2021-06-11 15:51:54,622 INFO L163 LiptonReduction]: Checked pairs total: 1926 [2021-06-11 15:51:54,623 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:51:54,623 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 251 [2021-06-11 15:51:54,623 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 690 flow [2021-06-11 15:51:54,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 0 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 15:51:54,624 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:51:54,624 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:51:54,624 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 15:51:54,624 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:51:54,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:51:54,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1635133783, now seen corresponding path program 1 times [2021-06-11 15:51:54,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:51:54,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894912077] [2021-06-11 15:51:54,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:51:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:51:54,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:54,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:51:54,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:54,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:51:54,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:54,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:51:54,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:54,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:51:54,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:54,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:51:54,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:54,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:54,731 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 15:51:54,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894912077] [2021-06-11 15:51:54,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:51:54,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 15:51:54,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27224857] [2021-06-11 15:51:54,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:51:54,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:51:54,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:51:54,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:51:54,733 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 214 [2021-06-11 15:51:54,734 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 690 flow. Second operand has 7 states, 7 states have (on average 173.85714285714286) internal successors, (1217), 7 states have internal predecessors, (1217), 0 states have call successors, (0), 0 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 15:51:54,734 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:51:54,734 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 214 [2021-06-11 15:51:54,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:51:55,041 INFO L129 PetriNetUnfolder]: 820/1726 cut-off events. [2021-06-11 15:51:55,041 INFO L130 PetriNetUnfolder]: For 10882/15767 co-relation queries the response was YES. [2021-06-11 15:51:55,056 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9998 conditions, 1726 events. 820/1726 cut-off events. For 10882/15767 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 14277 event pairs, 11 based on Foata normal form. 525/2036 useless extension candidates. Maximal degree in co-relation 9966. Up to 892 conditions per place. [2021-06-11 15:51:55,066 INFO L132 encePairwiseOnDemand]: 206/214 looper letters, 2 selfloop transitions, 37 changer transitions 11/86 dead transitions. [2021-06-11 15:51:55,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 86 transitions, 844 flow [2021-06-11 15:51:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 15:51:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 15:51:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1949 transitions. [2021-06-11 15:51:55,072 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8279524214103653 [2021-06-11 15:51:55,072 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1949 transitions. [2021-06-11 15:51:55,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1949 transitions. [2021-06-11 15:51:55,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:51:55,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1949 transitions. [2021-06-11 15:51:55,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 177.1818181818182) internal successors, (1949), 11 states have internal predecessors, (1949), 0 states have call successors, (0), 0 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 15:51:55,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 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 15:51:55,083 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 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 15:51:55,083 INFO L185 Difference]: Start difference. First operand has 78 places, 80 transitions, 690 flow. Second operand 11 states and 1949 transitions. [2021-06-11 15:51:55,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 86 transitions, 844 flow [2021-06-11 15:51:55,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 86 transitions, 731 flow, removed 36 selfloop flow, removed 5 redundant places. [2021-06-11 15:51:55,285 INFO L241 Difference]: Finished difference. Result has 86 places, 75 transitions, 627 flow [2021-06-11 15:51:55,285 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=627, PETRI_PLACES=86, PETRI_TRANSITIONS=75} [2021-06-11 15:51:55,285 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 38 predicate places. [2021-06-11 15:51:55,285 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:51:55,285 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 75 transitions, 627 flow [2021-06-11 15:51:55,286 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 75 transitions, 627 flow [2021-06-11 15:51:55,286 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 75 transitions, 627 flow [2021-06-11 15:51:55,356 INFO L129 PetriNetUnfolder]: 457/990 cut-off events. [2021-06-11 15:51:55,357 INFO L130 PetriNetUnfolder]: For 3514/3899 co-relation queries the response was YES. [2021-06-11 15:51:55,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4424 conditions, 990 events. 457/990 cut-off events. For 3514/3899 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 7436 event pairs, 9 based on Foata normal form. 1/897 useless extension candidates. Maximal degree in co-relation 4391. Up to 328 conditions per place. [2021-06-11 15:51:55,376 INFO L151 LiptonReduction]: Number of co-enabled transitions 1380 [2021-06-11 15:51:55,403 INFO L163 LiptonReduction]: Checked pairs total: 1583 [2021-06-11 15:51:55,403 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:51:55,403 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 118 [2021-06-11 15:51:55,404 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 75 transitions, 627 flow [2021-06-11 15:51:55,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 173.85714285714286) internal successors, (1217), 7 states have internal predecessors, (1217), 0 states have call successors, (0), 0 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 15:51:55,404 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:51:55,404 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:51:55,404 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 15:51:55,405 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:51:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:51:55,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1742836067, now seen corresponding path program 1 times [2021-06-11 15:51:55,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:51:55,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021365642] [2021-06-11 15:51:55,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:51:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:51:55,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:55,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:55,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:55,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:51:55,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:55,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:51:55,476 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 15:51:55,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021365642] [2021-06-11 15:51:55,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:51:55,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:51:55,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465214671] [2021-06-11 15:51:55,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:51:55,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:51:55,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:51:55,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:51:55,478 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 214 [2021-06-11 15:51:55,479 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 75 transitions, 627 flow. Second operand has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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 15:51:55,479 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:51:55,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 214 [2021-06-11 15:51:55,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:51:55,634 INFO L129 PetriNetUnfolder]: 775/1645 cut-off events. [2021-06-11 15:51:55,634 INFO L130 PetriNetUnfolder]: For 6040/6725 co-relation queries the response was YES. [2021-06-11 15:51:55,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7387 conditions, 1645 events. 775/1645 cut-off events. For 6040/6725 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 13400 event pairs, 13 based on Foata normal form. 6/1454 useless extension candidates. Maximal degree in co-relation 7352. Up to 552 conditions per place. [2021-06-11 15:51:55,652 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 4 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2021-06-11 15:51:55,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 77 transitions, 656 flow [2021-06-11 15:51:55,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:51:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:51:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 726 transitions. [2021-06-11 15:51:55,655 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8481308411214953 [2021-06-11 15:51:55,655 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 726 transitions. [2021-06-11 15:51:55,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 726 transitions. [2021-06-11 15:51:55,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:51:55,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 726 transitions. [2021-06-11 15:51:55,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 181.5) internal successors, (726), 4 states have internal predecessors, (726), 0 states have call successors, (0), 0 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 15:51:55,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:51:55,659 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:51:55,659 INFO L185 Difference]: Start difference. First operand has 85 places, 75 transitions, 627 flow. Second operand 4 states and 726 transitions. [2021-06-11 15:51:55,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 77 transitions, 656 flow [2021-06-11 15:51:55,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 77 transitions, 510 flow, removed 27 selfloop flow, removed 13 redundant places. [2021-06-11 15:51:55,767 INFO L241 Difference]: Finished difference. Result has 77 places, 77 transitions, 513 flow [2021-06-11 15:51:55,767 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=513, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2021-06-11 15:51:55,767 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 29 predicate places. [2021-06-11 15:51:55,767 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:51:55,767 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 77 transitions, 513 flow [2021-06-11 15:51:55,767 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 77 transitions, 513 flow [2021-06-11 15:51:55,768 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 77 transitions, 513 flow [2021-06-11 15:51:55,857 INFO L129 PetriNetUnfolder]: 741/1569 cut-off events. [2021-06-11 15:51:55,857 INFO L130 PetriNetUnfolder]: For 3280/3394 co-relation queries the response was YES. [2021-06-11 15:51:55,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5823 conditions, 1569 events. 741/1569 cut-off events. For 3280/3394 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 12778 event pairs, 14 based on Foata normal form. 5/1400 useless extension candidates. Maximal degree in co-relation 5795. Up to 520 conditions per place. [2021-06-11 15:51:55,883 INFO L151 LiptonReduction]: Number of co-enabled transitions 1444 [2021-06-11 15:51:56,657 WARN L205 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-06-11 15:51:56,936 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-06-11 15:51:58,232 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 302 DAG size of output: 257 [2021-06-11 15:51:58,811 WARN L205 SmtUtils]: Spent 577.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-06-11 15:51:58,865 INFO L142 QuantifierPusher]: treesize reduction 336, result has 90.8 percent of original size [2021-06-11 15:51:58,871 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:51:58,877 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:51:58,882 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,894 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 15:51:58,895 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:51:58,898 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,899 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 15:51:58,900 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 15:51:58,900 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:58,905 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,905 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 15:51:58,905 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:58,906 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,907 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 15:51:58,907 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:58,908 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,911 INFO L147 QuantifierPusher]: treesize reduction 148, result has 52.1 percent of original size 161 [2021-06-11 15:51:58,911 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,916 INFO L142 QuantifierPusher]: treesize reduction 148, result has 64.3 percent of original size [2021-06-11 15:51:58,917 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 4, 3, 2, 1] term [2021-06-11 15:51:58,917 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:58,918 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,918 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 3, 2, 1] term [2021-06-11 15:51:58,918 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:58,919 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,920 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 3, 2, 1] term [2021-06-11 15:51:58,920 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:58,922 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,925 INFO L147 QuantifierPusher]: treesize reduction 478, result has 21.5 percent of original size 131 [2021-06-11 15:51:58,925 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:51:58,925 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:58,928 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,929 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:51:58,929 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:58,929 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,930 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:51:58,930 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:58,931 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,937 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 15:51:58,939 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:58,941 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,945 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 15:51:58,947 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 15:51:58,949 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:58,951 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,953 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 15:51:58,956 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:51:58,960 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:51:58,965 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,968 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 15:51:58,969 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:51:58,972 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,973 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 15:51:58,974 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 15:51:58,974 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:58,975 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,975 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 15:51:58,975 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:58,976 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,976 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 15:51:58,976 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:58,977 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,979 INFO L147 QuantifierPusher]: treesize reduction 148, result has 52.1 percent of original size 161 [2021-06-11 15:51:58,979 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:58,984 INFO L142 QuantifierPusher]: treesize reduction 148, result has 64.3 percent of original size [2021-06-11 15:51:58,984 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 4, 3, 2, 1] term [2021-06-11 15:51:58,985 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:58,986 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,986 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 3, 2, 1] term [2021-06-11 15:51:58,987 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:58,987 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,994 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 3, 2, 1] term [2021-06-11 15:51:58,995 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:58,995 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:58,998 INFO L147 QuantifierPusher]: treesize reduction 478, result has 21.5 percent of original size 131 [2021-06-11 15:51:58,998 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:51:58,999 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:58,999 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,005 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,011 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 15:51:59,012 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:51:59,016 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:51:59,019 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:51:59,024 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,025 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 15:51:59,026 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 15:51:59,026 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:59,026 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,027 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 15:51:59,027 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:59,028 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,028 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 15:51:59,028 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:59,029 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,034 INFO L147 QuantifierPusher]: treesize reduction 148, result has 52.1 percent of original size 161 [2021-06-11 15:51:59,034 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,036 INFO L142 QuantifierPusher]: treesize reduction 148, result has 64.3 percent of original size [2021-06-11 15:51:59,037 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 4, 3, 2, 1] term [2021-06-11 15:51:59,037 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:59,038 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,038 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 3, 2, 1] term [2021-06-11 15:51:59,038 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:59,039 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,039 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 3, 2, 1] term [2021-06-11 15:51:59,039 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:59,041 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,043 INFO L147 QuantifierPusher]: treesize reduction 478, result has 21.5 percent of original size 131 [2021-06-11 15:51:59,044 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:51:59,044 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:59,046 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,046 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:51:59,046 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:59,047 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,048 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 15:51:59,051 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:59,055 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,058 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 15:51:59,065 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,069 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 15:51:59,070 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:51:59,073 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:51:59,077 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:51:59,085 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,086 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 15:51:59,086 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 15:51:59,087 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:59,087 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,088 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 15:51:59,088 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:59,090 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,091 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 15:51:59,091 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:59,092 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,094 INFO L147 QuantifierPusher]: treesize reduction 148, result has 52.1 percent of original size 161 [2021-06-11 15:51:59,094 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,097 INFO L142 QuantifierPusher]: treesize reduction 148, result has 64.3 percent of original size [2021-06-11 15:51:59,098 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 4, 3, 2, 1] term [2021-06-11 15:51:59,098 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:59,099 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,100 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 3, 2, 1] term [2021-06-11 15:51:59,100 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:59,103 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,104 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 3, 2, 1] term [2021-06-11 15:51:59,104 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:59,104 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,107 INFO L147 QuantifierPusher]: treesize reduction 478, result has 21.5 percent of original size 131 [2021-06-11 15:51:59,107 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:51:59,107 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:51:59,108 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,109 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 15:51:59,111 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:51:59,112 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:51:59,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:51:59,115 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 15:51:59,119 INFO L147 QuantifierPusher]: treesize reduction 1900, result has 7.5 percent of original size 153 [2021-06-11 15:51:59,762 WARN L205 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-06-11 15:52:00,032 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-06-11 15:52:01,414 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-06-11 15:52:01,975 WARN L205 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-06-11 15:52:02,057 INFO L163 LiptonReduction]: Checked pairs total: 3004 [2021-06-11 15:52:02,057 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 15:52:02,057 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6290 [2021-06-11 15:52:02,058 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 519 flow [2021-06-11 15:52:02,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 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 15:52:02,058 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:52:02,058 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:52:02,058 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 15:52:02,058 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:52:02,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:52:02,059 INFO L82 PathProgramCache]: Analyzing trace with hash -603920387, now seen corresponding path program 2 times [2021-06-11 15:52:02,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:52:02,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436325670] [2021-06-11 15:52:02,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:52:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:52:02,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:02,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:52:02,157 INFO L142 QuantifierPusher]: treesize reduction 7, result has 69.6 percent of original size [2021-06-11 15:52:02,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 15:52:02,175 INFO L142 QuantifierPusher]: treesize reduction 29, result has 67.4 percent of original size [2021-06-11 15:52:02,176 INFO L147 QuantifierPusher]: treesize reduction 9, result has 85.0 percent of original size 51 [2021-06-11 15:52:02,226 INFO L142 QuantifierPusher]: treesize reduction 21, result has 75.9 percent of original size [2021-06-11 15:52:02,228 INFO L147 QuantifierPusher]: treesize reduction 9, result has 86.4 percent of original size 57 [2021-06-11 15:52:02,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:02,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:52:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:52:02,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436325670] [2021-06-11 15:52:02,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:52:02,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:52:02,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807777172] [2021-06-11 15:52:02,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:52:02,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:52:02,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:52:02,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:52:02,278 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 216 [2021-06-11 15:52:02,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 519 flow. Second operand has 7 states, 7 states have (on average 161.28571428571428) internal successors, (1129), 7 states have internal predecessors, (1129), 0 states have call successors, (0), 0 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 15:52:02,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:52:02,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 216 [2021-06-11 15:52:02,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:52:03,488 INFO L129 PetriNetUnfolder]: 4879/10250 cut-off events. [2021-06-11 15:52:03,489 INFO L130 PetriNetUnfolder]: For 30713/33698 co-relation queries the response was YES. [2021-06-11 15:52:03,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37421 conditions, 10250 events. 4879/10250 cut-off events. For 30713/33698 co-relation queries the response was YES. Maximal size of possible extension queue 1776. Compared 110671 event pairs, 89 based on Foata normal form. 528/9318 useless extension candidates. Maximal degree in co-relation 37391. Up to 3472 conditions per place. [2021-06-11 15:52:03,681 INFO L132 encePairwiseOnDemand]: 205/216 looper letters, 22 selfloop transitions, 25 changer transitions 8/119 dead transitions. [2021-06-11 15:52:03,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 119 transitions, 825 flow [2021-06-11 15:52:03,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-11 15:52:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-11 15:52:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1650 transitions. [2021-06-11 15:52:03,685 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7638888888888888 [2021-06-11 15:52:03,685 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1650 transitions. [2021-06-11 15:52:03,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1650 transitions. [2021-06-11 15:52:03,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:52:03,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1650 transitions. [2021-06-11 15:52:03,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 165.0) internal successors, (1650), 10 states have internal predecessors, (1650), 0 states have call successors, (0), 0 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 15:52:03,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 216.0) internal successors, (2376), 11 states have internal predecessors, (2376), 0 states have call successors, (0), 0 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 15:52:03,693 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 216.0) internal successors, (2376), 11 states have internal predecessors, (2376), 0 states have call successors, (0), 0 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 15:52:03,693 INFO L185 Difference]: Start difference. First operand has 77 places, 77 transitions, 519 flow. Second operand 10 states and 1650 transitions. [2021-06-11 15:52:03,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 119 transitions, 825 flow [2021-06-11 15:52:06,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 119 transitions, 820 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:52:06,433 INFO L241 Difference]: Finished difference. Result has 91 places, 99 transitions, 721 flow [2021-06-11 15:52:06,433 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=721, PETRI_PLACES=91, PETRI_TRANSITIONS=99} [2021-06-11 15:52:06,433 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 43 predicate places. [2021-06-11 15:52:06,433 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:52:06,434 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 99 transitions, 721 flow [2021-06-11 15:52:06,434 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 99 transitions, 721 flow [2021-06-11 15:52:06,434 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 99 transitions, 721 flow [2021-06-11 15:52:07,083 INFO L129 PetriNetUnfolder]: 4466/9322 cut-off events. [2021-06-11 15:52:07,084 INFO L130 PetriNetUnfolder]: For 23630/25206 co-relation queries the response was YES. [2021-06-11 15:52:07,129 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35421 conditions, 9322 events. 4466/9322 cut-off events. For 23630/25206 co-relation queries the response was YES. Maximal size of possible extension queue 1488. Compared 99648 event pairs, 109 based on Foata normal form. 157/8333 useless extension candidates. Maximal degree in co-relation 35386. Up to 3116 conditions per place. [2021-06-11 15:52:07,227 INFO L151 LiptonReduction]: Number of co-enabled transitions 2468 [2021-06-11 15:52:07,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:07,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:52:07,497 INFO L163 LiptonReduction]: Checked pairs total: 42 [2021-06-11 15:52:07,497 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 15:52:07,497 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1064 [2021-06-11 15:52:07,500 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 99 transitions, 724 flow [2021-06-11 15:52:07,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 161.28571428571428) internal successors, (1129), 7 states have internal predecessors, (1129), 0 states have call successors, (0), 0 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 15:52:07,501 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:52:07,501 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:52:07,501 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-11 15:52:07,501 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:52:07,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:52:07,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2143033001, now seen corresponding path program 3 times [2021-06-11 15:52:07,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:52:07,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546051839] [2021-06-11 15:52:07,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:52:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:52:07,592 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-06-11 15:52:07,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 15:52:07,613 INFO L142 QuantifierPusher]: treesize reduction 8, result has 86.4 percent of original size [2021-06-11 15:52:07,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-06-11 15:52:07,649 INFO L142 QuantifierPusher]: treesize reduction 13, result has 67.5 percent of original size [2021-06-11 15:52:07,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-06-11 15:52:07,671 INFO L142 QuantifierPusher]: treesize reduction 8, result has 84.9 percent of original size [2021-06-11 15:52:07,672 INFO L147 QuantifierPusher]: treesize reduction 9, result has 80.0 percent of original size 36 [2021-06-11 15:52:07,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:07,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 15:52:07,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:52:07,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:52:07,714 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 15:52:07,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546051839] [2021-06-11 15:52:07,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:52:07,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 15:52:07,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117468729] [2021-06-11 15:52:07,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 15:52:07,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:52:07,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 15:52:07,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-11 15:52:07,717 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 217 [2021-06-11 15:52:07,718 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 99 transitions, 724 flow. Second operand has 8 states, 8 states have (on average 153.125) internal successors, (1225), 8 states have internal predecessors, (1225), 0 states have call successors, (0), 0 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 15:52:07,718 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:52:07,718 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 217 [2021-06-11 15:52:07,718 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:52:08,791 INFO L129 PetriNetUnfolder]: 5743/11825 cut-off events. [2021-06-11 15:52:08,791 INFO L130 PetriNetUnfolder]: For 40485/45591 co-relation queries the response was YES. [2021-06-11 15:52:08,865 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46133 conditions, 11825 events. 5743/11825 cut-off events. For 40485/45591 co-relation queries the response was YES. Maximal size of possible extension queue 2183. Compared 128811 event pairs, 89 based on Foata normal form. 746/10965 useless extension candidates. Maximal degree in co-relation 46096. Up to 3976 conditions per place. [2021-06-11 15:52:08,911 INFO L132 encePairwiseOnDemand]: 208/217 looper letters, 36 selfloop transitions, 18 changer transitions 2/119 dead transitions. [2021-06-11 15:52:08,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 119 transitions, 1050 flow [2021-06-11 15:52:08,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:52:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:52:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1092 transitions. [2021-06-11 15:52:08,914 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7188940092165899 [2021-06-11 15:52:08,914 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1092 transitions. [2021-06-11 15:52:08,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1092 transitions. [2021-06-11 15:52:08,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:52:08,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1092 transitions. [2021-06-11 15:52:08,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 156.0) internal successors, (1092), 7 states have internal predecessors, (1092), 0 states have call successors, (0), 0 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 15:52:08,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 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 15:52:08,919 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 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 15:52:08,919 INFO L185 Difference]: Start difference. First operand has 91 places, 99 transitions, 724 flow. Second operand 7 states and 1092 transitions. [2021-06-11 15:52:08,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 119 transitions, 1050 flow [2021-06-11 15:52:12,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 119 transitions, 1031 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:52:12,360 INFO L241 Difference]: Finished difference. Result has 99 places, 106 transitions, 858 flow [2021-06-11 15:52:12,360 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=858, PETRI_PLACES=99, PETRI_TRANSITIONS=106} [2021-06-11 15:52:12,360 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 51 predicate places. [2021-06-11 15:52:12,360 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:52:12,360 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 106 transitions, 858 flow [2021-06-11 15:52:12,360 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 106 transitions, 858 flow [2021-06-11 15:52:12,361 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 106 transitions, 858 flow [2021-06-11 15:52:13,194 INFO L129 PetriNetUnfolder]: 5684/11497 cut-off events. [2021-06-11 15:52:13,194 INFO L130 PetriNetUnfolder]: For 33871/36025 co-relation queries the response was YES. [2021-06-11 15:52:13,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44299 conditions, 11497 events. 5684/11497 cut-off events. For 33871/36025 co-relation queries the response was YES. Maximal size of possible extension queue 1977. Compared 123635 event pairs, 113 based on Foata normal form. 272/10339 useless extension candidates. Maximal degree in co-relation 44260. Up to 3842 conditions per place. [2021-06-11 15:52:13,322 INFO L151 LiptonReduction]: Number of co-enabled transitions 2732 [2021-06-11 15:52:13,331 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 15:52:13,331 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:52:13,331 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 971 [2021-06-11 15:52:13,331 INFO L480 AbstractCegarLoop]: Abstraction has has 99 places, 106 transitions, 858 flow [2021-06-11 15:52:13,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 153.125) internal successors, (1225), 8 states have internal predecessors, (1225), 0 states have call successors, (0), 0 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 15:52:13,332 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:52:13,332 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:52:13,333 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-11 15:52:13,333 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:52:13,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:52:13,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1798658338, now seen corresponding path program 1 times [2021-06-11 15:52:13,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:52:13,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122336596] [2021-06-11 15:52:13,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:52:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:52:13,376 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:52:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:52:13,450 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:52:13,564 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 15:52:13,565 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 15:52:13,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-11 15:52:13,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 03:52:13 BasicIcfg [2021-06-11 15:52:13,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 15:52:13,659 INFO L168 Benchmark]: Toolchain (without parser) took 32740.34 ms. Allocated memory was 335.5 MB in the beginning and 2.1 GB in the end (delta: 1.7 GB). Free memory was 297.3 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 470.7 MB. Max. memory is 16.0 GB. [2021-06-11 15:52:13,659 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 335.5 MB. Free memory is still 315.9 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:52:13,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 585.10 ms. Allocated memory is still 335.5 MB. Free memory was 297.2 MB in the beginning and 292.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.0 GB. [2021-06-11 15:52:13,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.02 ms. Allocated memory is still 335.5 MB. Free memory was 292.5 MB in the beginning and 290.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:52:13,659 INFO L168 Benchmark]: Boogie Preprocessor took 56.36 ms. Allocated memory is still 335.5 MB. Free memory was 290.4 MB in the beginning and 288.3 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:52:13,659 INFO L168 Benchmark]: RCFGBuilder took 2179.78 ms. Allocated memory is still 335.5 MB. Free memory was 287.2 MB in the beginning and 190.8 MB in the end (delta: 96.4 MB). Peak memory consumption was 131.0 MB. Max. memory is 16.0 GB. [2021-06-11 15:52:13,659 INFO L168 Benchmark]: TraceAbstraction took 29833.02 ms. Allocated memory was 335.5 MB in the beginning and 2.1 GB in the end (delta: 1.7 GB). Free memory was 189.8 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 361.4 MB. Max. memory is 16.0 GB. [2021-06-11 15:52:13,660 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.54 ms. Allocated memory is still 335.5 MB. Free memory is still 315.9 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 585.10 ms. Allocated memory is still 335.5 MB. Free memory was 297.2 MB in the beginning and 292.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 81.02 ms. Allocated memory is still 335.5 MB. Free memory was 292.5 MB in the beginning and 290.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 56.36 ms. Allocated memory is still 335.5 MB. Free memory was 290.4 MB in the beginning and 288.3 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 2179.78 ms. Allocated memory is still 335.5 MB. Free memory was 287.2 MB in the beginning and 190.8 MB in the end (delta: 96.4 MB). Peak memory consumption was 131.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 29833.02 ms. Allocated memory was 335.5 MB in the beginning and 2.1 GB in the end (delta: 1.7 GB). Free memory was 189.8 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 361.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6312.2ms, 122 PlacesBefore, 48 PlacesAfterwards, 111 TransitionsBefore, 36 TransitionsAfterwards, 2672 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 8383 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3595, positive: 3372, positive conditional: 3372, positive unconditional: 0, negative: 223, negative conditional: 223, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3595, positive: 3372, positive conditional: 0, positive unconditional: 3372, negative: 223, negative conditional: 0, negative unconditional: 223, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3595, positive: 3372, positive conditional: 0, positive unconditional: 3372, negative: 223, negative conditional: 0, negative unconditional: 223, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2048, positive: 1998, positive conditional: 0, positive unconditional: 1998, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2048, positive: 1952, positive conditional: 0, positive unconditional: 1952, negative: 96, negative conditional: 0, negative unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 96, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 797, positive: 98, positive conditional: 0, positive unconditional: 98, negative: 698, negative conditional: 0, negative unconditional: 698, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3595, positive: 1374, positive conditional: 0, positive unconditional: 1374, negative: 173, negative conditional: 0, negative unconditional: 173, unknown: 2048, unknown conditional: 0, unknown unconditional: 2048] , Statistics on independence cache: Total cache size (in pairs): 2048, Positive cache size: 1998, Positive conditional cache size: 0, Positive unconditional cache size: 1998, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 412.2ms, 44 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1166 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 339, positive: 283, positive conditional: 283, positive unconditional: 0, negative: 56, negative conditional: 56, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 339, positive: 283, positive conditional: 2, positive unconditional: 281, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 339, positive: 283, positive conditional: 2, positive unconditional: 281, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 63, positive: 54, positive conditional: 1, positive unconditional: 53, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 63, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 234, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 220, negative conditional: 0, negative unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 339, positive: 229, positive conditional: 1, positive unconditional: 228, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 63, unknown conditional: 1, unknown unconditional: 62] , Statistics on independence cache: Total cache size (in pairs): 2111, Positive cache size: 2052, Positive conditional cache size: 1, Positive unconditional cache size: 2051, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 180.1ms, 48 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 586 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 362 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 178, positive: 163, positive conditional: 163, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 178, positive: 163, positive conditional: 0, positive unconditional: 163, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 178, positive: 163, positive conditional: 0, positive unconditional: 163, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 49, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 49, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 125, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 125, negative conditional: 0, negative unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 178, positive: 120, positive conditional: 0, positive unconditional: 120, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 49, unknown conditional: 0, unknown unconditional: 49] , Statistics on independence cache: Total cache size (in pairs): 2160, Positive cache size: 2095, Positive conditional cache size: 1, Positive unconditional cache size: 2094, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 82.1ms, 47 PlacesBefore, 47 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 724 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 483 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 145, positive: 128, positive conditional: 128, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 145, positive: 128, positive conditional: 0, positive unconditional: 128, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 145, positive: 128, positive conditional: 0, positive unconditional: 128, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 145, positive: 128, positive conditional: 0, positive unconditional: 128, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2161, Positive cache size: 2095, Positive conditional cache size: 1, Positive unconditional cache size: 2094, Negative cache size: 66, Negative conditional cache size: 0, Negative unconditional cache size: 66, Eliminated conditions: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52.7ms, 52 PlacesBefore, 52 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 838 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 656 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 172, positive: 151, positive conditional: 151, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 184, positive: 151, positive conditional: 0, positive unconditional: 151, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 184, positive: 151, positive conditional: 0, positive unconditional: 151, negative: 33, negative conditional: 0, negative unconditional: 33, 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: 184, positive: 151, positive conditional: 0, positive unconditional: 151, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2161, Positive cache size: 2095, Positive conditional cache size: 1, Positive unconditional cache size: 2094, Negative cache size: 66, Negative conditional cache size: 0, Negative unconditional cache size: 66, Eliminated conditions: 93 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 199.8ms, 59 PlacesBefore, 59 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 1222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 840 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 135, positive: 113, positive conditional: 113, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 151, positive: 113, positive conditional: 32, positive unconditional: 81, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 151, positive: 113, positive conditional: 32, positive unconditional: 81, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 151, positive: 113, positive conditional: 32, positive unconditional: 81, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2161, Positive cache size: 2095, Positive conditional cache size: 1, Positive unconditional cache size: 2094, Negative cache size: 66, Negative conditional cache size: 0, Negative unconditional cache size: 66, Eliminated conditions: 85 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 248.7ms, 62 PlacesBefore, 62 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 1222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 840 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 136, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, positive: 114, positive conditional: 35, positive unconditional: 79, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, positive: 114, positive conditional: 35, positive unconditional: 79, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 152, positive: 113, positive conditional: 35, positive unconditional: 78, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2162, Positive cache size: 2096, Positive conditional cache size: 1, Positive unconditional cache size: 2095, Negative cache size: 66, Negative conditional cache size: 0, Negative unconditional cache size: 66, Eliminated conditions: 89 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 241.5ms, 70 PlacesBefore, 70 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1376 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 267, positive: 237, positive conditional: 237, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 292, positive: 237, positive conditional: 135, positive unconditional: 102, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 292, positive: 237, positive conditional: 135, positive unconditional: 102, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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: 292, positive: 235, positive conditional: 133, positive unconditional: 102, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2164, Positive cache size: 2098, Positive conditional cache size: 3, Positive unconditional cache size: 2095, Negative cache size: 66, Negative conditional cache size: 0, Negative unconditional cache size: 66, Eliminated conditions: 110 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 250.6ms, 78 PlacesBefore, 78 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1736 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1926 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 305, positive: 267, positive conditional: 267, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 336, positive: 267, positive conditional: 194, positive unconditional: 73, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 336, positive: 267, positive conditional: 194, positive unconditional: 73, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 336, positive: 260, positive conditional: 187, positive unconditional: 73, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2171, Positive cache size: 2105, Positive conditional cache size: 10, Positive unconditional cache size: 2095, Negative cache size: 66, Negative conditional cache size: 0, Negative unconditional cache size: 66, Eliminated conditions: 114 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 117.3ms, 86 PlacesBefore, 85 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1583 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 278, positive: 243, positive conditional: 243, positive unconditional: 0, negative: 35, negative conditional: 35, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 306, positive: 243, positive conditional: 180, positive unconditional: 63, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 306, positive: 243, positive conditional: 180, positive unconditional: 63, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 306, positive: 240, positive conditional: 177, positive unconditional: 63, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2174, Positive cache size: 2108, Positive conditional cache size: 13, Positive unconditional cache size: 2095, Negative cache size: 66, Negative conditional cache size: 0, Negative unconditional cache size: 66, Eliminated conditions: 105 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6289.6ms, 77 PlacesBefore, 77 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1444 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 3004 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 688, positive: 626, positive conditional: 626, positive unconditional: 0, negative: 62, negative conditional: 62, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 688, positive: 626, positive conditional: 462, positive unconditional: 164, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 688, positive: 626, positive conditional: 462, positive unconditional: 164, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 688, positive: 623, positive conditional: 459, positive unconditional: 164, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2178, Positive cache size: 2111, Positive conditional cache size: 16, Positive unconditional cache size: 2095, Negative cache size: 67, Negative conditional cache size: 0, Negative unconditional cache size: 67, Eliminated conditions: 92 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1063.3ms, 91 PlacesBefore, 91 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 2468 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 42 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, positive: 42, positive conditional: 42, 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: 42, positive: 42, positive conditional: 38, 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: 42, positive: 42, positive conditional: 38, 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: 13, positive: 13, positive conditional: 12, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 42, positive: 29, positive conditional: 26, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 13, unknown conditional: 12, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2191, Positive cache size: 2124, Positive conditional cache size: 28, Positive unconditional cache size: 2096, Negative cache size: 67, Negative conditional cache size: 0, Negative unconditional cache size: 67, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 970.3ms, 99 PlacesBefore, 99 PlacesAfterwards, 106 TransitionsBefore, 106 TransitionsAfterwards, 2732 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): 2191, Positive cache size: 2124, Positive conditional cache size: 28, Positive unconditional cache size: 2096, Negative cache size: 67, Negative conditional cache size: 0, Negative unconditional cache size: 67, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1425; [L860] FCALL, FORK 0 pthread_create(&t1425, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L861] 0 pthread_t t1426; [L862] FCALL, FORK 0 pthread_create(&t1426, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L863] 0 pthread_t t1427; [L864] FCALL, FORK 0 pthread_create(&t1427, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L798] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L865] 0 pthread_t t1428; [L866] FCALL, FORK 0 pthread_create(&t1428, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L818] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L826] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L826] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L827] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L827] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L828] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L828] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L829] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L830] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L830] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L831] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L837] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L872] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L879] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 29617.1ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 11516.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6388.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 67 SDtfs, 58 SDslu, 47 SDs, 0 SdLazy, 421 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 582.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 546.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=858occurred in iteration=12, InterpolantAutomatonStates: 72, 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: 37.7ms SsaConstructionTime, 401.0ms SatisfiabilityAnalysisTime, 801.1ms InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 1620 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...