/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:41:20,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:41:20,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:41:20,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:41:20,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:41:20,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:41:20,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:41:20,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:41:20,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:41:20,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:41:20,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:41:20,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:41:20,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:41:20,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:41:20,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:41:20,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:41:20,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:41:20,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:41:20,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:41:20,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:41:20,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:41:20,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:41:20,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:41:20,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:41:20,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:41:20,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:41:20,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:41:20,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:41:20,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:41:20,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:41:20,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:41:20,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:41:20,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:41:20,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:41:20,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:41:20,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:41:20,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:41:20,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:41:20,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:41:20,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:41:20,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:41:20,141 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-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:41:20,170 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:41:20,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:41:20,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:41:20,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:41:20,173 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:41:20,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:41:20,174 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:41:20,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:41:20,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:41:20,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:41:20,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:41:20,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:41:20,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:41:20,175 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:41:20,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:41:20,176 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:41:20,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:41:20,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:41:20,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:41:20,176 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:41:20,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:41:20,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:41:20,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:41:20,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:41:20,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:41:20,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:41:20,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:41:20,177 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:41:20,177 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:41:20,178 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:41:20,178 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:41:20,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:41:20,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:41:20,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:41:20,526 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:41:20,527 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:41:20,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2021-03-26 00:41:20,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e78cf294/cef62aba3dff4437bea4eff37ef189ba/FLAG1c3a8d134 [2021-03-26 00:41:21,161 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:41:21,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2021-03-26 00:41:21,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e78cf294/cef62aba3dff4437bea4eff37ef189ba/FLAG1c3a8d134 [2021-03-26 00:41:21,571 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e78cf294/cef62aba3dff4437bea4eff37ef189ba [2021-03-26 00:41:21,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:41:21,574 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:41:21,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:41:21,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:41:21,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:41:21,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:41:21" (1/1) ... [2021-03-26 00:41:21,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7ea82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:41:21, skipping insertion in model container [2021-03-26 00:41:21,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:41:21" (1/1) ... [2021-03-26 00:41:21,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:41:21,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:41:21,758 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/safe016_rmo.oepc.i[993,1006] [2021-03-26 00:41:21,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:41:21,998 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:41:22,008 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/safe016_rmo.oepc.i[993,1006] [2021-03-26 00:41:22,043 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:41:22,119 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:41:22,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:41:22 WrapperNode [2021-03-26 00:41:22,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:41:22,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:41:22,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:41:22,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:41:22,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:41:22" (1/1) ... [2021-03-26 00:41:22,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:41:22" (1/1) ... [2021-03-26 00:41:22,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:41:22,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:41:22,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:41:22,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:41:22,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:41:22" (1/1) ... [2021-03-26 00:41:22,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:41:22" (1/1) ... [2021-03-26 00:41:22,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:41:22" (1/1) ... [2021-03-26 00:41:22,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:41:22" (1/1) ... [2021-03-26 00:41:22,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:41:22" (1/1) ... [2021-03-26 00:41:22,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:41:22" (1/1) ... [2021-03-26 00:41:22,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:41:22" (1/1) ... [2021-03-26 00:41:22,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:41:22,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:41:22,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:41:22,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:41:22,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:41:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:41:22,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-26 00:41:22,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:41:22,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:41:22,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:41:22,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:41:22,308 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:41:22,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:41:22,308 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:41:22,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:41:22,308 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:41:22,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:41:22,309 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:41:22,309 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:41:22,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:41:22,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:41:22,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:41:22,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:41:22,311 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:41:24,437 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:41:24,438 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-26 00:41:24,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:41:24 BoogieIcfgContainer [2021-03-26 00:41:24,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:41:24,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:41:24,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:41:24,444 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:41:24,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:41:21" (1/3) ... [2021-03-26 00:41:24,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a30e23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:41:24, skipping insertion in model container [2021-03-26 00:41:24,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:41:22" (2/3) ... [2021-03-26 00:41:24,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a30e23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:41:24, skipping insertion in model container [2021-03-26 00:41:24,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:41:24" (3/3) ... [2021-03-26 00:41:24,446 INFO L111 eAbstractionObserver]: Analyzing ICFG safe016_rmo.oepc.i [2021-03-26 00:41:24,452 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:41:24,456 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-26 00:41:24,457 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:41:24,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,498 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,498 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,499 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,499 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,523 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,523 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,523 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,524 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,524 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,524 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,525 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,525 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,528 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,528 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,528 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,528 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,528 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,528 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,528 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,529 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,536 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,537 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,540 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,542 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,542 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,544 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,550 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,554 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:41:24,556 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:41:24,572 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 00:41:24,598 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:41:24,598 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:41:24,598 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:41:24,598 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:41:24,598 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:41:24,598 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:41:24,598 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:41:24,598 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:41:24,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2021-03-26 00:41:24,666 INFO L129 PetriNetUnfolder]: 2/124 cut-off events. [2021-03-26 00:41:24,667 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:41:24,680 INFO L84 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2021-03-26 00:41:24,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2021-03-26 00:41:24,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 110 transitions, 232 flow [2021-03-26 00:41:24,688 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:41:24,698 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 110 transitions, 232 flow [2021-03-26 00:41:24,700 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 110 transitions, 232 flow [2021-03-26 00:41:24,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 110 transitions, 232 flow [2021-03-26 00:41:24,743 INFO L129 PetriNetUnfolder]: 1/110 cut-off events. [2021-03-26 00:41:24,743 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:41:24,744 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2021-03-26 00:41:24,747 INFO L142 LiptonReduction]: Number of co-enabled transitions 1430 [2021-03-26 00:41:25,642 WARN L205 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2021-03-26 00:41:25,965 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2021-03-26 00:41:27,240 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 322 DAG size of output: 278 [2021-03-26 00:41:27,799 WARN L205 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-03-26 00:41:32,876 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-26 00:41:33,297 WARN L205 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 98 [2021-03-26 00:41:33,466 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-03-26 00:41:35,381 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 298 DAG size of output: 258 [2021-03-26 00:41:35,905 WARN L205 SmtUtils]: Spent 522.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-26 00:41:37,841 WARN L205 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 394 DAG size of output: 350 [2021-03-26 00:41:38,690 WARN L205 SmtUtils]: Spent 846.00 ms on a formula simplification that was a NOOP. DAG size: 347 [2021-03-26 00:41:39,643 INFO L154 LiptonReduction]: Checked pairs total: 1880 [2021-03-26 00:41:39,643 INFO L156 LiptonReduction]: Total number of compositions: 68 [2021-03-26 00:41:39,645 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14958 [2021-03-26 00:41:39,658 INFO L129 PetriNetUnfolder]: 1/44 cut-off events. [2021-03-26 00:41:39,658 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:41:39,658 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:41:39,659 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, 1, 1, 1] [2021-03-26 00:41:39,659 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:41:39,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:41:39,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1139838379, now seen corresponding path program 1 times [2021-03-26 00:41:39,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:41:39,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714961681] [2021-03-26 00:41:39,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:41:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:41:40,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:41:40,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:41:40,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:41:40,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:41:40,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:41:40,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:41:40,084 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:41:40,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:41:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:41:40,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714961681] [2021-03-26 00:41:40,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:41:40,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:41:40,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134860112] [2021-03-26 00:41:40,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:41:40,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:41:40,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:41:40,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:41:40,113 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 196 [2021-03-26 00:41:40,119 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:40,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:41:40,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 196 [2021-03-26 00:41:40,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:41:40,182 INFO L129 PetriNetUnfolder]: 0/47 cut-off events. [2021-03-26 00:41:40,182 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:41:40,183 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 4/50 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 00:41:40,184 INFO L132 encePairwiseOnDemand]: 190/196 looper letters, 2 selfloop transitions, 3 changer transitions 3/45 dead transitions. [2021-03-26 00:41:40,184 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 45 transitions, 116 flow [2021-03-26 00:41:40,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:41:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:41:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1079 transitions. [2021-03-26 00:41:40,209 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9175170068027211 [2021-03-26 00:41:40,209 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1079 transitions. [2021-03-26 00:41:40,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1079 transitions. [2021-03-26 00:41:40,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:41:40,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1079 transitions. [2021-03-26 00:41:40,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 179.83333333333334) internal successors, (1079), 6 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:40,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:40,236 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:40,237 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 6 states and 1079 transitions. [2021-03-26 00:41:40,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 45 transitions, 116 flow [2021-03-26 00:41:40,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 45 transitions, 112 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:41:40,241 INFO L241 Difference]: Finished difference. Result has 60 places, 42 transitions, 106 flow [2021-03-26 00:41:40,243 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=106, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2021-03-26 00:41:40,244 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2021-03-26 00:41:40,244 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:41:40,244 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 42 transitions, 106 flow [2021-03-26 00:41:40,244 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 42 transitions, 106 flow [2021-03-26 00:41:40,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 42 transitions, 106 flow [2021-03-26 00:41:40,252 INFO L129 PetriNetUnfolder]: 0/42 cut-off events. [2021-03-26 00:41:40,252 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 00:41:40,253 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 42 events. 0/42 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:41:40,253 INFO L142 LiptonReduction]: Number of co-enabled transitions 266 [2021-03-26 00:41:46,230 WARN L205 SmtUtils]: Spent 992.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 243 [2021-03-26 00:41:46,735 WARN L205 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2021-03-26 00:41:48,748 WARN L205 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 350 DAG size of output: 334 [2021-03-26 00:41:49,749 WARN L205 SmtUtils]: Spent 997.00 ms on a formula simplification that was a NOOP. DAG size: 328 [2021-03-26 00:41:50,555 INFO L154 LiptonReduction]: Checked pairs total: 787 [2021-03-26 00:41:50,555 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-26 00:41:50,555 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10311 [2021-03-26 00:41:50,557 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 78 flow [2021-03-26 00:41:50,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:50,558 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:41:50,558 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, 1, 1, 1, 1] [2021-03-26 00:41:50,558 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:41:50,558 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:41:50,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:41:50,558 INFO L82 PathProgramCache]: Analyzing trace with hash 975209201, now seen corresponding path program 1 times [2021-03-26 00:41:50,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:41:50,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363690296] [2021-03-26 00:41:50,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:41:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:41:50,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:41:50,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:41:50,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:41:50,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:41:50,732 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:41:50,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:41:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:41:50,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363690296] [2021-03-26 00:41:50,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:41:50,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:41:50,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22038171] [2021-03-26 00:41:50,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:41:50,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:41:50,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:41:50,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:41:50,741 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 210 [2021-03-26 00:41:50,742 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:50,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:41:50,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 210 [2021-03-26 00:41:50,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:41:50,760 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 00:41:50,760 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-03-26 00:41:50,761 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 28 events. 0/28 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 1/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:41:50,761 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 1 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2021-03-26 00:41:50,761 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 28 transitions, 84 flow [2021-03-26 00:41:50,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:41:50,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:41:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2021-03-26 00:41:50,764 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-03-26 00:41:50,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 580 transitions. [2021-03-26 00:41:50,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions. [2021-03-26 00:41:50,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:41:50,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions. [2021-03-26 00:41:50,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:50,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:50,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:50,768 INFO L185 Difference]: Start difference. First operand has 43 places, 28 transitions, 78 flow. Second operand 3 states and 580 transitions. [2021-03-26 00:41:50,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 28 transitions, 84 flow [2021-03-26 00:41:50,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 28 transitions, 74 flow, removed 2 selfloop flow, removed 5 redundant places. [2021-03-26 00:41:50,769 INFO L241 Difference]: Finished difference. Result has 41 places, 28 transitions, 76 flow [2021-03-26 00:41:50,770 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2021-03-26 00:41:50,770 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -16 predicate places. [2021-03-26 00:41:50,770 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:41:50,770 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 76 flow [2021-03-26 00:41:50,771 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 76 flow [2021-03-26 00:41:50,771 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 28 transitions, 76 flow [2021-03-26 00:41:50,776 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 00:41:50,776 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 00:41:50,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 28 events. 0/28 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:41:50,777 INFO L142 LiptonReduction]: Number of co-enabled transitions 242 [2021-03-26 00:41:52,183 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-03-26 00:41:52,309 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-03-26 00:41:52,475 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-03-26 00:41:52,603 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-03-26 00:41:53,077 WARN L205 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 142 [2021-03-26 00:41:53,306 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2021-03-26 00:41:53,769 WARN L205 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 142 [2021-03-26 00:41:54,021 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2021-03-26 00:41:54,025 INFO L154 LiptonReduction]: Checked pairs total: 948 [2021-03-26 00:41:54,025 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:41:54,026 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3255 [2021-03-26 00:41:54,026 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 68 flow [2021-03-26 00:41:54,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:54,027 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:41:54,027 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:41:54,027 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:41:54,028 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:41:54,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:41:54,028 INFO L82 PathProgramCache]: Analyzing trace with hash -629162665, now seen corresponding path program 1 times [2021-03-26 00:41:54,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:41:54,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660118624] [2021-03-26 00:41:54,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:41:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:41:54,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:41:54,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:41:54,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:41:54,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:41:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:41:54,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660118624] [2021-03-26 00:41:54,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:41:54,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:41:54,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516559233] [2021-03-26 00:41:54,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:41:54,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:41:54,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:41:54,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:41:54,085 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 214 [2021-03-26 00:41:54,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:54,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:41:54,086 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 214 [2021-03-26 00:41:54,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:41:54,112 INFO L129 PetriNetUnfolder]: 7/46 cut-off events. [2021-03-26 00:41:54,112 INFO L130 PetriNetUnfolder]: For 16/36 co-relation queries the response was YES. [2021-03-26 00:41:54,112 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 46 events. 7/46 cut-off events. For 16/36 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 132 event pairs, 2 based on Foata normal form. 1/44 useless extension candidates. Maximal degree in co-relation 81. Up to 17 conditions per place. [2021-03-26 00:41:54,113 INFO L132 encePairwiseOnDemand]: 210/214 looper letters, 5 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2021-03-26 00:41:54,113 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 93 flow [2021-03-26 00:41:54,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:41:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:41:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions. [2021-03-26 00:41:54,116 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9158878504672897 [2021-03-26 00:41:54,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 588 transitions. [2021-03-26 00:41:54,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 588 transitions. [2021-03-26 00:41:54,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:41:54,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 588 transitions. [2021-03-26 00:41:54,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:54,119 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-03-26 00:41:54,120 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-03-26 00:41:54,120 INFO L185 Difference]: Start difference. First operand has 37 places, 24 transitions, 68 flow. Second operand 3 states and 588 transitions. [2021-03-26 00:41:54,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 93 flow [2021-03-26 00:41:54,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 87 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:41:54,121 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 83 flow [2021-03-26 00:41:54,121 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2021-03-26 00:41:54,121 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -19 predicate places. [2021-03-26 00:41:54,122 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:41:54,122 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 26 transitions, 83 flow [2021-03-26 00:41:54,122 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 26 transitions, 83 flow [2021-03-26 00:41:54,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 26 transitions, 83 flow [2021-03-26 00:41:54,128 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-03-26 00:41:54,128 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-26 00:41:54,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 32 events. 3/32 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 54. Up to 10 conditions per place. [2021-03-26 00:41:54,128 INFO L142 LiptonReduction]: Number of co-enabled transitions 288 [2021-03-26 00:41:57,102 WARN L205 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 165 [2021-03-26 00:41:57,401 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2021-03-26 00:41:58,054 WARN L205 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 165 [2021-03-26 00:41:58,363 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2021-03-26 00:41:58,366 INFO L154 LiptonReduction]: Checked pairs total: 420 [2021-03-26 00:41:58,367 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:41:58,367 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4245 [2021-03-26 00:41:58,368 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 81 flow [2021-03-26 00:41:58,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:58,368 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:41:58,368 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:41:58,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:41:58,369 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:41:58,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:41:58,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1099781886, now seen corresponding path program 1 times [2021-03-26 00:41:58,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:41:58,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144464751] [2021-03-26 00:41:58,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:41:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:41:58,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:41:58,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:41:58,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:41:58,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:41:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:41:58,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144464751] [2021-03-26 00:41:58,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:41:58,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:41:58,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168434297] [2021-03-26 00:41:58,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:41:58,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:41:58,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:41:58,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:41:58,416 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 215 [2021-03-26 00:41:58,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:58,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:41:58,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 215 [2021-03-26 00:41:58,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:41:58,440 INFO L129 PetriNetUnfolder]: 4/46 cut-off events. [2021-03-26 00:41:58,440 INFO L130 PetriNetUnfolder]: For 30/81 co-relation queries the response was YES. [2021-03-26 00:41:58,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 46 events. 4/46 cut-off events. For 30/81 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 148 event pairs, 1 based on Foata normal form. 1/45 useless extension candidates. Maximal degree in co-relation 91. Up to 12 conditions per place. [2021-03-26 00:41:58,441 INFO L132 encePairwiseOnDemand]: 212/215 looper letters, 5 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-03-26 00:41:58,441 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 26 transitions, 100 flow [2021-03-26 00:41:58,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:41:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:41:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 587 transitions. [2021-03-26 00:41:58,444 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9100775193798449 [2021-03-26 00:41:58,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 587 transitions. [2021-03-26 00:41:58,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 587 transitions. [2021-03-26 00:41:58,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:41:58,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 587 transitions. [2021-03-26 00:41:58,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:58,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:58,448 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:58,448 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 81 flow. Second operand 3 states and 587 transitions. [2021-03-26 00:41:58,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 26 transitions, 100 flow [2021-03-26 00:41:58,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 26 transitions, 97 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:41:58,449 INFO L241 Difference]: Finished difference. Result has 39 places, 25 transitions, 89 flow [2021-03-26 00:41:58,449 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2021-03-26 00:41:58,449 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -18 predicate places. [2021-03-26 00:41:58,449 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:41:58,450 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 25 transitions, 89 flow [2021-03-26 00:41:58,450 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 25 transitions, 89 flow [2021-03-26 00:41:58,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 25 transitions, 89 flow [2021-03-26 00:41:58,455 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-26 00:41:58,455 INFO L130 PetriNetUnfolder]: For 32/38 co-relation queries the response was YES. [2021-03-26 00:41:58,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 30 events. 0/30 cut-off events. For 32/38 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2021-03-26 00:41:58,455 INFO L142 LiptonReduction]: Number of co-enabled transitions 288 [2021-03-26 00:41:58,492 INFO L154 LiptonReduction]: Checked pairs total: 260 [2021-03-26 00:41:58,492 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:41:58,492 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 43 [2021-03-26 00:41:58,493 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 89 flow [2021-03-26 00:41:58,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:58,494 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:41:58,494 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:41:58,494 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:41:58,494 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:41:58,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:41:58,495 INFO L82 PathProgramCache]: Analyzing trace with hash -808347048, now seen corresponding path program 1 times [2021-03-26 00:41:58,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:41:58,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943202613] [2021-03-26 00:41:58,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:41:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:41:58,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:41:58,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:41:58,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:41:58,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:41:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:41:58,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943202613] [2021-03-26 00:41:58,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:41:58,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:41:58,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888701769] [2021-03-26 00:41:58,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:41:58,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:41:58,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:41:58,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:41:58,606 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 215 [2021-03-26 00:41:58,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:58,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:41:58,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 215 [2021-03-26 00:41:58,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:41:58,643 INFO L129 PetriNetUnfolder]: 2/56 cut-off events. [2021-03-26 00:41:58,643 INFO L130 PetriNetUnfolder]: For 95/240 co-relation queries the response was YES. [2021-03-26 00:41:58,644 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 56 events. 2/56 cut-off events. For 95/240 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 230 event pairs, 0 based on Foata normal form. 2/56 useless extension candidates. Maximal degree in co-relation 115. Up to 14 conditions per place. [2021-03-26 00:41:58,644 INFO L132 encePairwiseOnDemand]: 210/215 looper letters, 4 selfloop transitions, 4 changer transitions 2/28 dead transitions. [2021-03-26 00:41:58,644 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 126 flow [2021-03-26 00:41:58,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:41:58,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:41:58,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 763 transitions. [2021-03-26 00:41:58,647 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8872093023255814 [2021-03-26 00:41:58,647 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 763 transitions. [2021-03-26 00:41:58,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 763 transitions. [2021-03-26 00:41:58,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:41:58,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 763 transitions. [2021-03-26 00:41:58,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:58,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:58,652 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:58,652 INFO L185 Difference]: Start difference. First operand has 39 places, 25 transitions, 89 flow. Second operand 4 states and 763 transitions. [2021-03-26 00:41:58,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 126 flow [2021-03-26 00:41:58,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 28 transitions, 117 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 00:41:58,654 INFO L241 Difference]: Finished difference. Result has 42 places, 25 transitions, 97 flow [2021-03-26 00:41:58,654 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2021-03-26 00:41:58,654 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -15 predicate places. [2021-03-26 00:41:58,655 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:41:58,655 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 25 transitions, 97 flow [2021-03-26 00:41:58,655 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 25 transitions, 97 flow [2021-03-26 00:41:58,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 25 transitions, 97 flow [2021-03-26 00:41:58,661 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2021-03-26 00:41:58,661 INFO L130 PetriNetUnfolder]: For 37/50 co-relation queries the response was YES. [2021-03-26 00:41:58,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 34 events. 0/34 cut-off events. For 37/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 87 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2021-03-26 00:41:58,663 INFO L142 LiptonReduction]: Number of co-enabled transitions 272 [2021-03-26 00:41:58,665 INFO L154 LiptonReduction]: Checked pairs total: 250 [2021-03-26 00:41:58,665 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:41:58,665 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-26 00:41:58,667 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 97 flow [2021-03-26 00:41:58,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:58,668 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:41:58,668 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:41:58,668 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:41:58,669 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:41:58,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:41:58,669 INFO L82 PathProgramCache]: Analyzing trace with hash -808635348, now seen corresponding path program 2 times [2021-03-26 00:41:58,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:41:58,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730931017] [2021-03-26 00:41:58,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:41:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:41:58,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:41:58,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:41:58,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:41:58,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 00:41:58,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:41:58,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 00:41:58,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:41:58,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:41:58,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:41:58,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:41:58,886 INFO L142 QuantifierPusher]: treesize reduction 25, result has 73.4 percent of original size [2021-03-26 00:41:58,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 69 [2021-03-26 00:41:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:41:58,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730931017] [2021-03-26 00:41:58,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:41:58,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:41:58,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349966383] [2021-03-26 00:41:58,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:41:58,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:41:58,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:41:58,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:41:58,902 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 215 [2021-03-26 00:41:58,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 97 flow. Second operand has 7 states, 7 states have (on average 145.0) internal successors, (1015), 7 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:58,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:41:58,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 215 [2021-03-26 00:41:58,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:41:59,042 INFO L129 PetriNetUnfolder]: 94/244 cut-off events. [2021-03-26 00:41:59,042 INFO L130 PetriNetUnfolder]: For 329/363 co-relation queries the response was YES. [2021-03-26 00:41:59,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 244 events. 94/244 cut-off events. For 329/363 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1165 event pairs, 49 based on Foata normal form. 2/233 useless extension candidates. Maximal degree in co-relation 577. Up to 157 conditions per place. [2021-03-26 00:41:59,049 INFO L132 encePairwiseOnDemand]: 211/215 looper letters, 13 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-03-26 00:41:59,049 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 140 flow [2021-03-26 00:41:59,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:41:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:41:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2021-03-26 00:41:59,053 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6961240310077519 [2021-03-26 00:41:59,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2021-03-26 00:41:59,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2021-03-26 00:41:59,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:41:59,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2021-03-26 00:41:59,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:59,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:59,056 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:41:59,056 INFO L185 Difference]: Start difference. First operand has 42 places, 25 transitions, 97 flow. Second operand 3 states and 449 transitions. [2021-03-26 00:41:59,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 140 flow [2021-03-26 00:41:59,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 130 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 00:41:59,060 INFO L241 Difference]: Finished difference. Result has 42 places, 27 transitions, 106 flow [2021-03-26 00:41:59,060 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2021-03-26 00:41:59,060 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -15 predicate places. [2021-03-26 00:41:59,060 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:41:59,060 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 106 flow [2021-03-26 00:41:59,061 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 27 transitions, 106 flow [2021-03-26 00:41:59,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 27 transitions, 106 flow [2021-03-26 00:41:59,070 INFO L129 PetriNetUnfolder]: 6/56 cut-off events. [2021-03-26 00:41:59,071 INFO L130 PetriNetUnfolder]: For 81/93 co-relation queries the response was YES. [2021-03-26 00:41:59,071 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 56 events. 6/56 cut-off events. For 81/93 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 204 event pairs, 2 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 119. Up to 18 conditions per place. [2021-03-26 00:41:59,071 INFO L142 LiptonReduction]: Number of co-enabled transitions 294 [2021-03-26 00:42:02,706 INFO L154 LiptonReduction]: Checked pairs total: 223 [2021-03-26 00:42:02,706 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:42:02,707 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3647 [2021-03-26 00:42:02,707 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 106 flow [2021-03-26 00:42:02,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 145.0) internal successors, (1015), 7 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:02,708 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:02,708 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:42:02,708 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:42:02,708 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:02,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:02,709 INFO L82 PathProgramCache]: Analyzing trace with hash 700588171, now seen corresponding path program 1 times [2021-03-26 00:42:02,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:02,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499754701] [2021-03-26 00:42:02,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:42:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:42:02,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:02,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:42:02,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:02,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:42:02,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:02,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:42:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:42:02,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499754701] [2021-03-26 00:42:02,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:42:02,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:42:02,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546359495] [2021-03-26 00:42:02,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:42:02,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:42:02,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:42:02,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:42:02,775 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 215 [2021-03-26 00:42:02,776 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:02,776 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:42:02,776 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 215 [2021-03-26 00:42:02,776 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:42:02,903 INFO L129 PetriNetUnfolder]: 124/320 cut-off events. [2021-03-26 00:42:02,904 INFO L130 PetriNetUnfolder]: For 386/405 co-relation queries the response was YES. [2021-03-26 00:42:02,904 INFO L84 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 320 events. 124/320 cut-off events. For 386/405 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1664 event pairs, 51 based on Foata normal form. 6/314 useless extension candidates. Maximal degree in co-relation 791. Up to 189 conditions per place. [2021-03-26 00:42:02,906 INFO L132 encePairwiseOnDemand]: 207/215 looper letters, 11 selfloop transitions, 8 changer transitions 0/33 dead transitions. [2021-03-26 00:42:02,906 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 159 flow [2021-03-26 00:42:02,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:42:02,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:42:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 678 transitions. [2021-03-26 00:42:02,908 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7883720930232558 [2021-03-26 00:42:02,909 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 678 transitions. [2021-03-26 00:42:02,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 678 transitions. [2021-03-26 00:42:02,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:42:02,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 678 transitions. [2021-03-26 00:42:02,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.5) internal successors, (678), 4 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:02,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:02,912 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:02,912 INFO L185 Difference]: Start difference. First operand has 42 places, 27 transitions, 106 flow. Second operand 4 states and 678 transitions. [2021-03-26 00:42:02,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 159 flow [2021-03-26 00:42:02,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:42:02,914 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 151 flow [2021-03-26 00:42:02,914 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-03-26 00:42:02,915 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -12 predicate places. [2021-03-26 00:42:02,915 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:42:02,915 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 151 flow [2021-03-26 00:42:02,915 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 151 flow [2021-03-26 00:42:02,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 32 transitions, 151 flow [2021-03-26 00:42:02,942 INFO L129 PetriNetUnfolder]: 60/199 cut-off events. [2021-03-26 00:42:02,942 INFO L130 PetriNetUnfolder]: For 319/325 co-relation queries the response was YES. [2021-03-26 00:42:02,943 INFO L84 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 199 events. 60/199 cut-off events. For 319/325 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1035 event pairs, 18 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 521. Up to 104 conditions per place. [2021-03-26 00:42:02,944 INFO L142 LiptonReduction]: Number of co-enabled transitions 326 [2021-03-26 00:42:04,471 INFO L154 LiptonReduction]: Checked pairs total: 148 [2021-03-26 00:42:04,471 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:42:04,471 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1556 [2021-03-26 00:42:04,472 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 151 flow [2021-03-26 00:42:04,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:04,472 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:04,473 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:42:04,473 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:42:04,473 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:04,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:04,473 INFO L82 PathProgramCache]: Analyzing trace with hash 679013600, now seen corresponding path program 1 times [2021-03-26 00:42:04,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:04,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555294545] [2021-03-26 00:42:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:42:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:42:04,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:04,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:04,539 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:42:04,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:42:04,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:04,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:42:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:42:04,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555294545] [2021-03-26 00:42:04,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:42:04,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:42:04,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822734921] [2021-03-26 00:42:04,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:42:04,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:42:04,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:42:04,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:42:04,549 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 215 [2021-03-26 00:42:04,550 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 184.75) internal successors, (739), 4 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:04,550 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:42:04,550 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 215 [2021-03-26 00:42:04,550 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:42:04,702 INFO L129 PetriNetUnfolder]: 470/936 cut-off events. [2021-03-26 00:42:04,702 INFO L130 PetriNetUnfolder]: For 1567/1704 co-relation queries the response was YES. [2021-03-26 00:42:04,707 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2393 conditions, 936 events. 470/936 cut-off events. For 1567/1704 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 6337 event pairs, 215 based on Foata normal form. 73/900 useless extension candidates. Maximal degree in co-relation 2376. Up to 527 conditions per place. [2021-03-26 00:42:04,711 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 10 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2021-03-26 00:42:04,711 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 217 flow [2021-03-26 00:42:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:42:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:42:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 942 transitions. [2021-03-26 00:42:04,714 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8762790697674419 [2021-03-26 00:42:04,714 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 942 transitions. [2021-03-26 00:42:04,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 942 transitions. [2021-03-26 00:42:04,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:42:04,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 942 transitions. [2021-03-26 00:42:04,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 188.4) internal successors, (942), 5 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:04,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:04,720 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:04,720 INFO L185 Difference]: Start difference. First operand has 45 places, 32 transitions, 151 flow. Second operand 5 states and 942 transitions. [2021-03-26 00:42:04,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 217 flow [2021-03-26 00:42:04,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 206 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:42:04,723 INFO L241 Difference]: Finished difference. Result has 50 places, 41 transitions, 215 flow [2021-03-26 00:42:04,723 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2021-03-26 00:42:04,724 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -7 predicate places. [2021-03-26 00:42:04,724 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:42:04,724 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 41 transitions, 215 flow [2021-03-26 00:42:04,724 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 41 transitions, 215 flow [2021-03-26 00:42:04,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 215 flow [2021-03-26 00:42:04,831 INFO L129 PetriNetUnfolder]: 535/1054 cut-off events. [2021-03-26 00:42:04,831 INFO L130 PetriNetUnfolder]: For 2058/2444 co-relation queries the response was YES. [2021-03-26 00:42:04,836 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3286 conditions, 1054 events. 535/1054 cut-off events. For 2058/2444 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 7215 event pairs, 239 based on Foata normal form. 1/938 useless extension candidates. Maximal degree in co-relation 3268. Up to 670 conditions per place. [2021-03-26 00:42:04,846 INFO L142 LiptonReduction]: Number of co-enabled transitions 506 [2021-03-26 00:42:04,942 INFO L154 LiptonReduction]: Checked pairs total: 53 [2021-03-26 00:42:04,943 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:42:04,943 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 219 [2021-03-26 00:42:04,943 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 209 flow [2021-03-26 00:42:04,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 184.75) internal successors, (739), 4 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:04,944 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:04,944 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:42:04,944 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:42:04,944 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:04,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:04,944 INFO L82 PathProgramCache]: Analyzing trace with hash 2075661857, now seen corresponding path program 1 times [2021-03-26 00:42:04,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:04,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249730821] [2021-03-26 00:42:04,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:42:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:42:05,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:05,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:05,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:05,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:05,042 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:42:05,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:42:05,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:05,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:42:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:42:05,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249730821] [2021-03-26 00:42:05,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:42:05,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:42:05,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496455232] [2021-03-26 00:42:05,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:42:05,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:42:05,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:42:05,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:42:05,052 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 215 [2021-03-26 00:42:05,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 184.8) internal successors, (924), 5 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:05,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:42:05,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 215 [2021-03-26 00:42:05,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:42:05,184 INFO L129 PetriNetUnfolder]: 296/645 cut-off events. [2021-03-26 00:42:05,184 INFO L130 PetriNetUnfolder]: For 1307/2010 co-relation queries the response was YES. [2021-03-26 00:42:05,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2420 conditions, 645 events. 296/645 cut-off events. For 1307/2010 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4007 event pairs, 69 based on Foata normal form. 130/723 useless extension candidates. Maximal degree in co-relation 2400. Up to 422 conditions per place. [2021-03-26 00:42:05,191 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 10 selfloop transitions, 14 changer transitions 0/49 dead transitions. [2021-03-26 00:42:05,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 49 transitions, 309 flow [2021-03-26 00:42:05,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:42:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:42:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1130 transitions. [2021-03-26 00:42:05,194 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.875968992248062 [2021-03-26 00:42:05,195 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1130 transitions. [2021-03-26 00:42:05,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1130 transitions. [2021-03-26 00:42:05,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:42:05,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1130 transitions. [2021-03-26 00:42:05,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:05,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:05,200 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:05,200 INFO L185 Difference]: Start difference. First operand has 50 places, 40 transitions, 209 flow. Second operand 6 states and 1130 transitions. [2021-03-26 00:42:05,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 49 transitions, 309 flow [2021-03-26 00:42:05,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 302 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:42:05,208 INFO L241 Difference]: Finished difference. Result has 54 places, 45 transitions, 298 flow [2021-03-26 00:42:05,208 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2021-03-26 00:42:05,208 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2021-03-26 00:42:05,209 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:42:05,209 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 298 flow [2021-03-26 00:42:05,209 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 45 transitions, 298 flow [2021-03-26 00:42:05,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 298 flow [2021-03-26 00:42:05,337 INFO L129 PetriNetUnfolder]: 329/723 cut-off events. [2021-03-26 00:42:05,337 INFO L130 PetriNetUnfolder]: For 2219/2584 co-relation queries the response was YES. [2021-03-26 00:42:05,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3102 conditions, 723 events. 329/723 cut-off events. For 2219/2584 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 4768 event pairs, 62 based on Foata normal form. 22/698 useless extension candidates. Maximal degree in co-relation 3081. Up to 487 conditions per place. [2021-03-26 00:42:05,348 INFO L142 LiptonReduction]: Number of co-enabled transitions 560 [2021-03-26 00:42:05,431 INFO L154 LiptonReduction]: Checked pairs total: 59 [2021-03-26 00:42:05,431 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:42:05,432 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 223 [2021-03-26 00:42:05,433 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 290 flow [2021-03-26 00:42:05,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 184.8) internal successors, (924), 5 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:05,433 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:05,433 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:42:05,434 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:42:05,434 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:05,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:05,434 INFO L82 PathProgramCache]: Analyzing trace with hash 931013978, now seen corresponding path program 1 times [2021-03-26 00:42:05,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:05,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564560187] [2021-03-26 00:42:05,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:42:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:42:05,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:05,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:05,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:05,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:05,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:05,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:05,545 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:42:05,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:42:05,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:05,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:42:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:42:05,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564560187] [2021-03-26 00:42:05,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:42:05,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:42:05,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794129005] [2021-03-26 00:42:05,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:42:05,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:42:05,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:42:05,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:42:05,557 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 215 [2021-03-26 00:42:05,558 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 184.83333333333334) internal successors, (1109), 6 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:05,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:42:05,558 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 215 [2021-03-26 00:42:05,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:42:05,675 INFO L129 PetriNetUnfolder]: 157/383 cut-off events. [2021-03-26 00:42:05,675 INFO L130 PetriNetUnfolder]: For 1259/1905 co-relation queries the response was YES. [2021-03-26 00:42:05,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1783 conditions, 383 events. 157/383 cut-off events. For 1259/1905 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2066 event pairs, 19 based on Foata normal form. 156/513 useless extension candidates. Maximal degree in co-relation 1760. Up to 247 conditions per place. [2021-03-26 00:42:05,680 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 6 selfloop transitions, 18 changer transitions 4/53 dead transitions. [2021-03-26 00:42:05,680 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 432 flow [2021-03-26 00:42:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:42:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:42:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1318 transitions. [2021-03-26 00:42:05,683 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8757475083056478 [2021-03-26 00:42:05,683 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1318 transitions. [2021-03-26 00:42:05,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1318 transitions. [2021-03-26 00:42:05,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:42:05,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1318 transitions. [2021-03-26 00:42:05,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 188.28571428571428) internal successors, (1318), 7 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:05,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:05,690 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:05,691 INFO L185 Difference]: Start difference. First operand has 54 places, 44 transitions, 290 flow. Second operand 7 states and 1318 transitions. [2021-03-26 00:42:05,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 432 flow [2021-03-26 00:42:05,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 370 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 00:42:05,696 INFO L241 Difference]: Finished difference. Result has 57 places, 49 transitions, 350 flow [2021-03-26 00:42:05,697 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=350, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2021-03-26 00:42:05,697 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 0 predicate places. [2021-03-26 00:42:05,697 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:42:05,697 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 49 transitions, 350 flow [2021-03-26 00:42:05,697 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 49 transitions, 350 flow [2021-03-26 00:42:05,698 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 49 transitions, 350 flow [2021-03-26 00:42:05,741 INFO L129 PetriNetUnfolder]: 168/420 cut-off events. [2021-03-26 00:42:05,741 INFO L130 PetriNetUnfolder]: For 1068/1173 co-relation queries the response was YES. [2021-03-26 00:42:05,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1728 conditions, 420 events. 168/420 cut-off events. For 1068/1173 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2486 event pairs, 16 based on Foata normal form. 5/401 useless extension candidates. Maximal degree in co-relation 1706. Up to 252 conditions per place. [2021-03-26 00:42:05,747 INFO L142 LiptonReduction]: Number of co-enabled transitions 516 [2021-03-26 00:42:05,761 INFO L154 LiptonReduction]: Checked pairs total: 57 [2021-03-26 00:42:05,761 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:42:05,761 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 64 [2021-03-26 00:42:05,764 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 340 flow [2021-03-26 00:42:05,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 184.83333333333334) internal successors, (1109), 6 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:05,765 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:05,765 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] [2021-03-26 00:42:05,765 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:42:05,765 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:05,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:05,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1055625398, now seen corresponding path program 1 times [2021-03-26 00:42:05,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:05,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427821744] [2021-03-26 00:42:05,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:42:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:42:05,834 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-26 00:42:05,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 00:42:05,866 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.9 percent of original size [2021-03-26 00:42:05,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 00:42:05,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:05,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:42:05,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:05,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:42:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:42:05,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427821744] [2021-03-26 00:42:05,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:42:05,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:42:05,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547329180] [2021-03-26 00:42:05,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:42:05,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:42:05,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:42:05,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:42:05,929 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 215 [2021-03-26 00:42:05,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 340 flow. Second operand has 5 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:05,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:42:05,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 215 [2021-03-26 00:42:05,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:42:06,081 INFO L129 PetriNetUnfolder]: 211/498 cut-off events. [2021-03-26 00:42:06,081 INFO L130 PetriNetUnfolder]: For 1452/1638 co-relation queries the response was YES. [2021-03-26 00:42:06,084 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 498 events. 211/498 cut-off events. For 1452/1638 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2808 event pairs, 23 based on Foata normal form. 13/469 useless extension candidates. Maximal degree in co-relation 2054. Up to 267 conditions per place. [2021-03-26 00:42:06,086 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 12 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2021-03-26 00:42:06,086 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 365 flow [2021-03-26 00:42:06,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:42:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:42:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 654 transitions. [2021-03-26 00:42:06,089 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7604651162790698 [2021-03-26 00:42:06,089 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 654 transitions. [2021-03-26 00:42:06,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 654 transitions. [2021-03-26 00:42:06,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:42:06,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 654 transitions. [2021-03-26 00:42:06,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 163.5) internal successors, (654), 4 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:06,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:06,093 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:06,093 INFO L185 Difference]: Start difference. First operand has 57 places, 48 transitions, 340 flow. Second operand 4 states and 654 transitions. [2021-03-26 00:42:06,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 365 flow [2021-03-26 00:42:06,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 320 flow, removed 16 selfloop flow, removed 4 redundant places. [2021-03-26 00:42:06,101 INFO L241 Difference]: Finished difference. Result has 55 places, 48 transitions, 312 flow [2021-03-26 00:42:06,101 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2021-03-26 00:42:06,102 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places. [2021-03-26 00:42:06,102 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:42:06,102 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 48 transitions, 312 flow [2021-03-26 00:42:06,102 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 48 transitions, 312 flow [2021-03-26 00:42:06,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 48 transitions, 312 flow [2021-03-26 00:42:06,147 INFO L129 PetriNetUnfolder]: 190/454 cut-off events. [2021-03-26 00:42:06,148 INFO L130 PetriNetUnfolder]: For 831/877 co-relation queries the response was YES. [2021-03-26 00:42:06,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1563 conditions, 454 events. 190/454 cut-off events. For 831/877 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2705 event pairs, 17 based on Foata normal form. 5/431 useless extension candidates. Maximal degree in co-relation 1541. Up to 184 conditions per place. [2021-03-26 00:42:06,154 INFO L142 LiptonReduction]: Number of co-enabled transitions 532 [2021-03-26 00:42:06,160 INFO L154 LiptonReduction]: Checked pairs total: 18 [2021-03-26 00:42:06,160 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:42:06,160 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 58 [2021-03-26 00:42:06,161 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 312 flow [2021-03-26 00:42:06,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:06,161 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:06,161 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] [2021-03-26 00:42:06,162 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:42:06,162 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:06,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:06,162 INFO L82 PathProgramCache]: Analyzing trace with hash -820698985, now seen corresponding path program 1 times [2021-03-26 00:42:06,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:06,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263537092] [2021-03-26 00:42:06,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:42:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:42:06,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:06,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:06,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:06,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:06,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:06,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:06,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:06,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:06,255 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:42:06,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:42:06,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:06,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:42:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:42:06,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263537092] [2021-03-26 00:42:06,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:42:06,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:42:06,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062358518] [2021-03-26 00:42:06,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:42:06,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:42:06,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:42:06,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:42:06,270 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 215 [2021-03-26 00:42:06,271 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 312 flow. Second operand has 7 states, 7 states have (on average 184.85714285714286) internal successors, (1294), 7 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:06,271 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:42:06,271 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 215 [2021-03-26 00:42:06,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:42:06,399 INFO L129 PetriNetUnfolder]: 171/404 cut-off events. [2021-03-26 00:42:06,400 INFO L130 PetriNetUnfolder]: For 748/1110 co-relation queries the response was YES. [2021-03-26 00:42:06,402 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 404 events. 171/404 cut-off events. For 748/1110 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2192 event pairs, 8 based on Foata normal form. 159/526 useless extension candidates. Maximal degree in co-relation 1622. Up to 171 conditions per place. [2021-03-26 00:42:06,403 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 2 selfloop transitions, 18 changer transitions 4/53 dead transitions. [2021-03-26 00:42:06,403 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 408 flow [2021-03-26 00:42:06,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:42:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:42:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1498 transitions. [2021-03-26 00:42:06,407 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8709302325581395 [2021-03-26 00:42:06,407 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1498 transitions. [2021-03-26 00:42:06,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1498 transitions. [2021-03-26 00:42:06,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:42:06,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1498 transitions. [2021-03-26 00:42:06,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 187.25) internal successors, (1498), 8 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:06,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:06,413 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:06,413 INFO L185 Difference]: Start difference. First operand has 55 places, 48 transitions, 312 flow. Second operand 8 states and 1498 transitions. [2021-03-26 00:42:06,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 53 transitions, 408 flow [2021-03-26 00:42:06,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 362 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-26 00:42:06,419 INFO L241 Difference]: Finished difference. Result has 61 places, 49 transitions, 334 flow [2021-03-26 00:42:06,419 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=334, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2021-03-26 00:42:06,419 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2021-03-26 00:42:06,419 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:42:06,419 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 49 transitions, 334 flow [2021-03-26 00:42:06,420 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 49 transitions, 334 flow [2021-03-26 00:42:06,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 49 transitions, 334 flow [2021-03-26 00:42:06,457 INFO L129 PetriNetUnfolder]: 162/396 cut-off events. [2021-03-26 00:42:06,458 INFO L130 PetriNetUnfolder]: For 812/926 co-relation queries the response was YES. [2021-03-26 00:42:06,460 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 396 events. 162/396 cut-off events. For 812/926 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2286 event pairs, 7 based on Foata normal form. 4/364 useless extension candidates. Maximal degree in co-relation 1531. Up to 158 conditions per place. [2021-03-26 00:42:06,463 INFO L142 LiptonReduction]: Number of co-enabled transitions 500 [2021-03-26 00:42:08,124 WARN L205 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 295 DAG size of output: 244 [2021-03-26 00:42:08,520 WARN L205 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 222 [2021-03-26 00:42:11,835 WARN L205 SmtUtils]: Spent 3.31 s on a formula simplification. DAG size of input: 407 DAG size of output: 331 [2021-03-26 00:42:12,747 WARN L205 SmtUtils]: Spent 907.00 ms on a formula simplification that was a NOOP. DAG size: 306 [2021-03-26 00:42:13,216 WARN L205 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 234 [2021-03-26 00:42:13,666 WARN L205 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 234 [2021-03-26 00:42:14,667 WARN L205 SmtUtils]: Spent 998.00 ms on a formula simplification that was a NOOP. DAG size: 318 [2021-03-26 00:42:15,682 WARN L205 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 318 [2021-03-26 00:42:15,691 INFO L154 LiptonReduction]: Checked pairs total: 112 [2021-03-26 00:42:15,691 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:42:15,692 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9273 [2021-03-26 00:42:15,692 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 318 flow [2021-03-26 00:42:15,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 184.85714285714286) internal successors, (1294), 7 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:15,693 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:15,693 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:42:15,693 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:42:15,693 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:15,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:15,694 INFO L82 PathProgramCache]: Analyzing trace with hash 287954081, now seen corresponding path program 1 times [2021-03-26 00:42:15,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:15,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46991309] [2021-03-26 00:42:15,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:42:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:42:15,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:15,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:42:15,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:15,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:15,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:15,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:42:15,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46991309] [2021-03-26 00:42:15,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:42:15,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:42:15,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953091950] [2021-03-26 00:42:15,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:42:15,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:42:15,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:42:15,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:42:15,776 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 217 [2021-03-26 00:42:15,777 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 189.25) internal successors, (757), 4 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:15,777 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:42:15,777 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 217 [2021-03-26 00:42:15,777 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:42:15,870 INFO L129 PetriNetUnfolder]: 273/600 cut-off events. [2021-03-26 00:42:15,870 INFO L130 PetriNetUnfolder]: For 2793/3143 co-relation queries the response was YES. [2021-03-26 00:42:15,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2315 conditions, 600 events. 273/600 cut-off events. For 2793/3143 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 3683 event pairs, 8 based on Foata normal form. 37/576 useless extension candidates. Maximal degree in co-relation 2290. Up to 224 conditions per place. [2021-03-26 00:42:15,875 INFO L132 encePairwiseOnDemand]: 213/217 looper letters, 4 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2021-03-26 00:42:15,875 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 48 transitions, 343 flow [2021-03-26 00:42:15,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:42:15,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:42:15,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 949 transitions. [2021-03-26 00:42:15,879 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8746543778801843 [2021-03-26 00:42:15,879 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 949 transitions. [2021-03-26 00:42:15,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 949 transitions. [2021-03-26 00:42:15,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:42:15,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 949 transitions. [2021-03-26 00:42:15,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 189.8) internal successors, (949), 5 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:15,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:15,883 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:15,884 INFO L185 Difference]: Start difference. First operand has 57 places, 46 transitions, 318 flow. Second operand 5 states and 949 transitions. [2021-03-26 00:42:15,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 48 transitions, 343 flow [2021-03-26 00:42:15,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 282 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-03-26 00:42:15,898 INFO L241 Difference]: Finished difference. Result has 55 places, 48 transitions, 283 flow [2021-03-26 00:42:15,898 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2021-03-26 00:42:15,898 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places. [2021-03-26 00:42:15,898 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:42:15,899 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 48 transitions, 283 flow [2021-03-26 00:42:15,899 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 48 transitions, 283 flow [2021-03-26 00:42:15,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 48 transitions, 283 flow [2021-03-26 00:42:15,946 INFO L129 PetriNetUnfolder]: 276/607 cut-off events. [2021-03-26 00:42:15,946 INFO L130 PetriNetUnfolder]: For 989/1097 co-relation queries the response was YES. [2021-03-26 00:42:15,949 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1811 conditions, 607 events. 276/607 cut-off events. For 989/1097 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3941 event pairs, 7 based on Foata normal form. 22/573 useless extension candidates. Maximal degree in co-relation 1791. Up to 194 conditions per place. [2021-03-26 00:42:15,954 INFO L142 LiptonReduction]: Number of co-enabled transitions 514 [2021-03-26 00:42:15,958 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:42:15,958 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:42:15,958 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 60 [2021-03-26 00:42:15,959 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 283 flow [2021-03-26 00:42:15,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 189.25) internal successors, (757), 4 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:15,971 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:15,971 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:42:15,971 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:42:15,971 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:15,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:15,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1466247645, now seen corresponding path program 1 times [2021-03-26 00:42:15,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:15,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261009] [2021-03-26 00:42:15,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:42:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:42:16,027 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:42:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:42:16,091 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:42:16,135 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:42:16,135 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:42:16,136 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:42:16,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:42:16 BasicIcfg [2021-03-26 00:42:16,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:42:16,265 INFO L168 Benchmark]: Toolchain (without parser) took 54690.58 ms. Allocated memory was 255.9 MB in the beginning and 767.6 MB in the end (delta: 511.7 MB). Free memory was 233.9 MB in the beginning and 430.5 MB in the end (delta: -196.6 MB). Peak memory consumption was 314.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:42:16,265 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:42:16,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 545.93 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 233.9 MB in the beginning and 326.1 MB in the end (delta: -92.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:42:16,265 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.35 ms. Allocated memory is still 367.0 MB. Free memory was 325.7 MB in the beginning and 323.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:42:16,266 INFO L168 Benchmark]: Boogie Preprocessor took 33.07 ms. Allocated memory is still 367.0 MB. Free memory was 323.0 MB in the beginning and 320.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:42:16,266 INFO L168 Benchmark]: RCFGBuilder took 2223.09 ms. Allocated memory is still 367.0 MB. Free memory was 320.3 MB in the beginning and 220.9 MB in the end (delta: 99.4 MB). Peak memory consumption was 115.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:42:16,266 INFO L168 Benchmark]: TraceAbstraction took 51822.71 ms. Allocated memory was 367.0 MB in the beginning and 767.6 MB in the end (delta: 400.6 MB). Free memory was 220.9 MB in the beginning and 430.5 MB in the end (delta: -209.6 MB). Peak memory consumption was 189.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:42:16,267 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.56 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 545.93 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 233.9 MB in the beginning and 326.1 MB in the end (delta: -92.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 61.35 ms. Allocated memory is still 367.0 MB. Free memory was 325.7 MB in the beginning and 323.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 33.07 ms. Allocated memory is still 367.0 MB. Free memory was 323.0 MB in the beginning and 320.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2223.09 ms. Allocated memory is still 367.0 MB. Free memory was 320.3 MB in the beginning and 220.9 MB in the end (delta: 99.4 MB). Peak memory consumption was 115.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 51822.71 ms. Allocated memory was 367.0 MB in the beginning and 767.6 MB in the end (delta: 400.6 MB). Free memory was 220.9 MB in the beginning and 430.5 MB in the end (delta: -209.6 MB). Peak memory consumption was 189.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14942.7ms, 122 PlacesBefore, 57 PlacesAfterwards, 110 TransitionsBefore, 45 TransitionsAfterwards, 1430 CoEnabledTransitionPairs, 4 FixpointIterations, 39 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 68 TotalNumberOfCompositions, 1880 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1112, positive: 1062, positive conditional: 1062, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 969, positive: 930, positive conditional: 0, positive unconditional: 930, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 969, positive: 930, positive conditional: 0, positive unconditional: 930, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 969, positive: 915, positive conditional: 0, positive unconditional: 915, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5209, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 776, negative conditional: 0, negative unconditional: 776, unknown: 4377, unknown conditional: 0, unknown unconditional: 4377] ], Cache Queries: [ total: 1112, positive: 132, positive conditional: 132, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 969, unknown conditional: 969, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 21, Positive conditional cache size: 21, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10310.8ms, 60 PlacesBefore, 43 PlacesAfterwards, 42 TransitionsBefore, 28 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 3 FixpointIterations, 13 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 787 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 198, positive: 143, positive conditional: 143, positive unconditional: 0, negative: 55, negative conditional: 55, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 70, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 70, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4878, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 256, negative conditional: 0, negative unconditional: 256, unknown: 4622, unknown conditional: 0, unknown unconditional: 4622] ], Cache Queries: [ total: 198, positive: 89, positive conditional: 89, positive unconditional: 0, negative: 39, negative conditional: 39, negative unconditional: 0, unknown: 70, unknown conditional: 70, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 62, Positive conditional cache size: 62, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3254.6ms, 41 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 24 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 4 FixpointIterations, 4 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 948 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 231, positive: 163, positive conditional: 163, positive unconditional: 0, negative: 68, negative conditional: 68, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 12, positive conditional: 7, positive unconditional: 5, negative: 10, negative conditional: 3, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 12, positive conditional: 7, positive unconditional: 5, negative: 10, negative conditional: 3, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 10, negative conditional: 3, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 866, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 866, negative conditional: 14, negative unconditional: 852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 231, positive: 151, positive conditional: 151, positive unconditional: 0, negative: 58, negative conditional: 58, negative unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 74, Positive conditional cache size: 74, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4244.5ms, 38 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 420 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 21, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2311, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 274, negative conditional: 0, negative unconditional: 274, unknown: 2037, unknown conditional: 0, unknown unconditional: 2037] ], Cache Queries: [ total: 66, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 86, Positive conditional cache size: 86, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.3ms, 39 PlacesBefore, 39 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 260 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 58, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 35, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 89, Positive conditional cache size: 89, Positive unconditional cache size: 0, Negative cache size: 49, Negative conditional cache size: 49, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.9ms, 42 PlacesBefore, 42 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 272 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 250 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 53, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 53, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 96, Positive conditional cache size: 96, Positive unconditional cache size: 0, Negative cache size: 49, Negative conditional cache size: 49, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3645.7ms, 42 PlacesBefore, 42 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 223 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 5, negative conditional: 1, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 5, negative conditional: 1, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3632, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 3627, unknown conditional: 0, unknown unconditional: 3627] ], Cache Queries: [ total: 33, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 101, Positive conditional cache size: 101, Positive unconditional cache size: 0, Negative cache size: 54, Negative conditional cache size: 54, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1556.3ms, 45 PlacesBefore, 45 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 148 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, 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: 2, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1523, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1523, unknown conditional: 0, unknown unconditional: 1523] ], Cache Queries: [ total: 12, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 102, Positive conditional cache size: 102, Positive unconditional cache size: 0, Negative cache size: 55, Negative conditional cache size: 55, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 218.5ms, 50 PlacesBefore, 50 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 53 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 27, 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: 27, positive: 27, positive conditional: 0, positive unconditional: 27, 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: 40, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 95, Positive conditional cache size: 95, Positive unconditional cache size: 0, Negative cache size: 51, Negative conditional cache size: 51, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 222.6ms, 54 PlacesBefore, 54 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 560 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 59 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 25, 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: 25, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 103, Positive conditional cache size: 103, Positive unconditional cache size: 0, Negative cache size: 51, Negative conditional cache size: 51, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 63.7ms, 57 PlacesBefore, 57 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 516 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 57 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 25, 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: 25, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 114, Positive conditional cache size: 114, Positive unconditional cache size: 0, Negative cache size: 51, Negative conditional cache size: 51, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 58.0ms, 55 PlacesBefore, 55 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 18 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 124, Positive conditional cache size: 124, Positive unconditional cache size: 0, Negative cache size: 51, Negative conditional cache size: 51, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9271.7ms, 61 PlacesBefore, 57 PlacesAfterwards, 49 TransitionsBefore, 46 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 112 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 84, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 20, 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: 20, positive: 20, positive conditional: 0, positive unconditional: 20, 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: 84, positive: 58, positive conditional: 58, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 114, Positive conditional cache size: 114, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 59.1ms, 55 PlacesBefore, 55 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: 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: 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): 142, Positive cache size: 114, Positive conditional cache size: 114, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2161; [L852] FCALL, FORK 0 pthread_create(&t2161, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] 0 pthread_t t2162; [L854] FCALL, FORK 0 pthread_create(&t2162, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] 0 pthread_t t2163; [L856] FCALL, FORK 0 pthread_create(&t2163, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] 0 pthread_t t2164; [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] EXPR 1 \read(y) [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L769] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L769] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L769] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L769] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L770] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L770] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L770] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L770] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L771] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L771] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L771] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L771] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L772] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L772] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L773] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L773] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L773] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L774] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L774] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L777] EXPR 1 \read(y) [L777] 1 __unbuffered_p0_EAX = y [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] EXPR 1 \read(y) [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] 1 y = y$flush_delayed ? y$mem_tmp : y [L779] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=55, weak$$choice1=0, weak$$choice2=0, x=0, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=55, weak$$choice1=0, weak$$choice2=0, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=55, weak$$choice1=0, weak$$choice2=0, x=2, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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=55, weak$$choice1=0, weak$$choice2=0, x=2, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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=55, weak$$choice1=0, weak$$choice2=0, x=2, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L858] FCALL, FORK 0 pthread_create(&t2164, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0: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=55, weak$$choice1=0, weak$$choice2=0, x=2, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 4 y = 2 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0: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=55, weak$$choice1=0, weak$$choice2=0, x=2, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 \read(y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L4] COND FALSE 0 !(!cond) [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 \read(y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 0 \read(y) [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 x == 2 && y == 2 [L884] EXPR 0 \read(y) [L884] EXPR 0 x == 2 && y == 2 [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0: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=51, weak$$choice1=255, weak$$choice2=255, x=2, y={8:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 127 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 7.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 51543.0ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1509.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15052.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 62 SDtfs, 28 SDslu, 27 SDs, 0 SdLazy, 310 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 377.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 332.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=10, InterpolantAutomatonStates: 61, 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: 56.6ms SsaConstructionTime, 715.3ms SatisfiabilityAnalysisTime, 895.1ms InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 1410 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...