/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/mix007_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:01:05,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:01:05,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:01:05,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:01:05,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:01:05,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:01:05,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:01:05,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:01:05,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:01:05,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:01:05,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:01:05,473 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:01:05,473 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:01:05,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:01:05,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:01:05,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:01:05,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:01:05,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:01:05,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:01:05,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:01:05,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:01:05,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:01:05,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:01:05,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:01:05,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:01:05,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:01:05,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:01:05,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:01:05,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:01:05,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:01:05,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:01:05,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:01:05,506 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:01:05,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:01:05,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:01:05,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:01:05,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:01:05,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:01:05,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:01:05,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:01:05,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:01:05,510 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:01:05,545 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:01:05,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:01:05,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:01:05,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:01:05,548 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:01:05,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:01:05,549 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:01:05,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:01:05,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:01:05,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:01:05,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:01:05,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:01:05,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:01:05,551 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:01:05,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:01:05,551 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:01:05,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:01:05,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:01:05,551 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:01:05,551 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:01:05,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:01:05,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:01:05,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:01:05,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:01:05,552 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:01:05,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:01:05,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:01:05,553 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:01:05,553 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:01:05,553 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:01:05,553 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:01:05,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:01:05,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:01:05,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:01:05,899 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:01:05,900 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:01:05,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007_tso.oepc.i [2021-03-26 00:01:05,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ffa3fe5/19f58c2e145e4fbaa493e7ef0a78b2e6/FLAG6a01f7de4 [2021-03-26 00:01:06,337 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:01:06,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007_tso.oepc.i [2021-03-26 00:01:06,350 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ffa3fe5/19f58c2e145e4fbaa493e7ef0a78b2e6/FLAG6a01f7de4 [2021-03-26 00:01:06,681 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ffa3fe5/19f58c2e145e4fbaa493e7ef0a78b2e6 [2021-03-26 00:01:06,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:01:06,685 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:01:06,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:01:06,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:01:06,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:01:06,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:01:06" (1/1) ... [2021-03-26 00:01:06,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72232b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:01:06, skipping insertion in model container [2021-03-26 00:01:06,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:01:06" (1/1) ... [2021-03-26 00:01:06,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:01:06,743 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:01:06,854 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/mix007_tso.oepc.i[949,962] [2021-03-26 00:01:07,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:01:07,102 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:01:07,114 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/mix007_tso.oepc.i[949,962] [2021-03-26 00:01:07,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:01:07,237 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:01:07,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:01:07 WrapperNode [2021-03-26 00:01:07,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:01:07,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:01:07,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:01:07,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:01:07,247 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:01:07" (1/1) ... [2021-03-26 00:01:07,280 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:01:07" (1/1) ... [2021-03-26 00:01:07,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:01:07,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:01:07,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:01:07,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:01:07,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:01:07" (1/1) ... [2021-03-26 00:01:07,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:01:07" (1/1) ... [2021-03-26 00:01:07,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:01:07" (1/1) ... [2021-03-26 00:01:07,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:01:07" (1/1) ... [2021-03-26 00:01:07,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:01:07" (1/1) ... [2021-03-26 00:01:07,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:01:07" (1/1) ... [2021-03-26 00:01:07,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:01:07" (1/1) ... [2021-03-26 00:01:07,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:01:07,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:01:07,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:01:07,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:01:07,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:01:07" (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:01:07,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:01:07,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:01:07,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:01:07,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:01:07,434 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:01:07,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:01:07,434 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:01:07,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:01:07,435 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:01:07,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:01:07,435 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:01:07,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:01:07,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:01:07,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:01:07,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:01:07,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:01:07,437 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:01:09,108 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:01:09,108 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:01:09,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:01:09 BoogieIcfgContainer [2021-03-26 00:01:09,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:01:09,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:01:09,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:01:09,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:01:09,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:01:06" (1/3) ... [2021-03-26 00:01:09,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcddd90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:01:09, skipping insertion in model container [2021-03-26 00:01:09,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:01:07" (2/3) ... [2021-03-26 00:01:09,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcddd90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:01:09, skipping insertion in model container [2021-03-26 00:01:09,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:01:09" (3/3) ... [2021-03-26 00:01:09,118 INFO L111 eAbstractionObserver]: Analyzing ICFG mix007_tso.oepc.i [2021-03-26 00:01:09,125 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:01:09,129 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:01:09,130 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:01:09,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,172 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,172 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,172 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,173 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,173 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,173 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,173 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,174 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,181 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,181 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,181 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,182 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,185 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,185 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,185 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,186 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,186 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,186 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,186 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,186 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,186 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,187 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,187 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,190 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,190 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,191 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,191 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,198 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,199 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,209 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,209 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,209 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,209 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,209 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,209 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,209 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,209 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,209 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,213 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,213 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,213 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,213 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,213 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,213 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,213 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,214 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,223 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,223 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,224 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,225 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,225 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,233 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,233 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:01:09,235 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:01:09,250 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:01:09,278 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:01:09,278 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:01:09,278 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:01:09,278 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:01:09,278 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:01:09,279 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:01:09,279 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:01:09,279 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:01:09,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-03-26 00:01:09,343 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-26 00:01:09,344 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:01:09,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 00:01:09,358 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-03-26 00:01:09,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-03-26 00:01:09,363 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:01:09,376 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-26 00:01:09,378 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-26 00:01:09,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-03-26 00:01:09,418 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-26 00:01:09,418 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:01:09,419 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 96 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 00:01:09,424 INFO L142 LiptonReduction]: Number of co-enabled transitions 2886 [2021-03-26 00:01:10,964 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:01:11,353 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 00:01:11,478 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:01:12,886 INFO L154 LiptonReduction]: Checked pairs total: 5647 [2021-03-26 00:01:12,886 INFO L156 LiptonReduction]: Total number of compositions: 75 [2021-03-26 00:01:12,894 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3532 [2021-03-26 00:01:12,905 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-26 00:01:12,905 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:01:12,905 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:01:12,906 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:01:12,906 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:01:12,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:01:12,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1588435965, now seen corresponding path program 1 times [2021-03-26 00:01:12,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:01:12,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965629208] [2021-03-26 00:01:12,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:01:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:01:13,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:13,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:01:13,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:13,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:01:13,189 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:01:13,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965629208] [2021-03-26 00:01:13,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:01:13,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:01:13,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278719325] [2021-03-26 00:01:13,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:01:13,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:01:13,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:01:13,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:01:13,208 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 195 [2021-03-26 00:01:13,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 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:01:13,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:01:13,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 195 [2021-03-26 00:01:13,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:01:13,305 INFO L129 PetriNetUnfolder]: 133/349 cut-off events. [2021-03-26 00:01:13,305 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:01:13,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 349 events. 133/349 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1875 event pairs, 110 based on Foata normal form. 33/362 useless extension candidates. Maximal degree in co-relation 546. Up to 153 conditions per place. [2021-03-26 00:01:13,310 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 11 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2021-03-26 00:01:13,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 52 transitions, 142 flow [2021-03-26 00:01:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:01:13,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:01:13,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2021-03-26 00:01:13,321 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145299145299145 [2021-03-26 00:01:13,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2021-03-26 00:01:13,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2021-03-26 00:01:13,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:01:13,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2021-03-26 00:01:13,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 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:01:13,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:01:13,335 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:01:13,336 INFO L185 Difference]: Start difference. First operand has 62 places, 50 transitions, 112 flow. Second operand 3 states and 535 transitions. [2021-03-26 00:01:13,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 52 transitions, 142 flow [2021-03-26 00:01:13,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:01:13,340 INFO L241 Difference]: Finished difference. Result has 58 places, 47 transitions, 106 flow [2021-03-26 00:01:13,341 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2021-03-26 00:01:13,342 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2021-03-26 00:01:13,342 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:01:13,342 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 47 transitions, 106 flow [2021-03-26 00:01:13,343 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 47 transitions, 106 flow [2021-03-26 00:01:13,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 47 transitions, 106 flow [2021-03-26 00:01:13,348 INFO L129 PetriNetUnfolder]: 0/47 cut-off events. [2021-03-26 00:01:13,348 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:01:13,348 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 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 62 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:01:13,349 INFO L142 LiptonReduction]: Number of co-enabled transitions 702 [2021-03-26 00:01:14,646 INFO L154 LiptonReduction]: Checked pairs total: 3042 [2021-03-26 00:01:14,646 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 00:01:14,646 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1304 [2021-03-26 00:01:14,651 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 82 flow [2021-03-26 00:01:14,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 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:01:14,651 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:01:14,651 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:01:14,651 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:01:14,652 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:01:14,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:01:14,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1813580090, now seen corresponding path program 1 times [2021-03-26 00:01:14,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:01:14,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488239772] [2021-03-26 00:01:14,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:01:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:01:14,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:14,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:01:14,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:14,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:01:14,774 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 00:01:14,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:01:14,790 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:01:14,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:01:14,794 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:01:14,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488239772] [2021-03-26 00:01:14,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:01:14,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:01:14,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380442652] [2021-03-26 00:01:14,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:01:14,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:01:14,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:01:14,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:01:14,798 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 207 [2021-03-26 00:01:14,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 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:01:14,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:01:14,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 207 [2021-03-26 00:01:14,799 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:01:14,966 INFO L129 PetriNetUnfolder]: 337/694 cut-off events. [2021-03-26 00:01:14,966 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:01:14,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 694 events. 337/694 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3917 event pairs, 29 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 1223. Up to 217 conditions per place. [2021-03-26 00:01:14,972 INFO L132 encePairwiseOnDemand]: 197/207 looper letters, 12 selfloop transitions, 8 changer transitions 21/65 dead transitions. [2021-03-26 00:01:14,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 224 flow [2021-03-26 00:01:14,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:01:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:01:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1177 transitions. [2021-03-26 00:01:14,977 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8122843340234644 [2021-03-26 00:01:14,977 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1177 transitions. [2021-03-26 00:01:14,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1177 transitions. [2021-03-26 00:01:14,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:01:14,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1177 transitions. [2021-03-26 00:01:14,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 168.14285714285714) internal successors, (1177), 7 states have internal predecessors, (1177), 0 states have call successors, (0), 0 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:01:14,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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:01:14,988 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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:01:14,988 INFO L185 Difference]: Start difference. First operand has 46 places, 35 transitions, 82 flow. Second operand 7 states and 1177 transitions. [2021-03-26 00:01:14,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 224 flow [2021-03-26 00:01:14,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:01:14,990 INFO L241 Difference]: Finished difference. Result has 55 places, 40 transitions, 148 flow [2021-03-26 00:01:14,991 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2021-03-26 00:01:14,991 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2021-03-26 00:01:14,991 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:01:14,991 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 40 transitions, 148 flow [2021-03-26 00:01:14,992 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 40 transitions, 148 flow [2021-03-26 00:01:14,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 148 flow [2021-03-26 00:01:15,046 INFO L129 PetriNetUnfolder]: 150/411 cut-off events. [2021-03-26 00:01:15,046 INFO L130 PetriNetUnfolder]: For 114/214 co-relation queries the response was YES. [2021-03-26 00:01:15,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 411 events. 150/411 cut-off events. For 114/214 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2482 event pairs, 82 based on Foata normal form. 0/376 useless extension candidates. Maximal degree in co-relation 905. Up to 213 conditions per place. [2021-03-26 00:01:15,051 INFO L142 LiptonReduction]: Number of co-enabled transitions 566 [2021-03-26 00:01:15,894 INFO L154 LiptonReduction]: Checked pairs total: 1206 [2021-03-26 00:01:15,894 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:01:15,894 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 903 [2021-03-26 00:01:15,895 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 142 flow [2021-03-26 00:01:15,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 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:01:15,896 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:01:15,896 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:01:15,896 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:01:15,897 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:01:15,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:01:15,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1102842643, now seen corresponding path program 1 times [2021-03-26 00:01:15,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:01:15,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893874860] [2021-03-26 00:01:15,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:01:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:01:15,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:15,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:01:15,964 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:01:15,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893874860] [2021-03-26 00:01:15,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:01:15,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:01:15,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174300204] [2021-03-26 00:01:15,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:01:15,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:01:15,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:01:15,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:01:15,967 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 210 [2021-03-26 00:01:15,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 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:01:15,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:01:15,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 210 [2021-03-26 00:01:15,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:01:16,029 INFO L129 PetriNetUnfolder]: 99/279 cut-off events. [2021-03-26 00:01:16,030 INFO L130 PetriNetUnfolder]: For 186/316 co-relation queries the response was YES. [2021-03-26 00:01:16,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 279 events. 99/279 cut-off events. For 186/316 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1516 event pairs, 50 based on Foata normal form. 13/265 useless extension candidates. Maximal degree in co-relation 658. Up to 146 conditions per place. [2021-03-26 00:01:16,034 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 1 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2021-03-26 00:01:16,034 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 37 transitions, 150 flow [2021-03-26 00:01:16,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:01:16,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:01:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2021-03-26 00:01:16,037 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9015873015873016 [2021-03-26 00:01:16,037 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 568 transitions. [2021-03-26 00:01:16,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 568 transitions. [2021-03-26 00:01:16,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:01:16,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 568 transitions. [2021-03-26 00:01:16,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 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:01:16,041 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:01:16,041 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:01:16,041 INFO L185 Difference]: Start difference. First operand has 48 places, 37 transitions, 142 flow. Second operand 3 states and 568 transitions. [2021-03-26 00:01:16,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 37 transitions, 150 flow [2021-03-26 00:01:16,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 37 transitions, 136 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-03-26 00:01:16,045 INFO L241 Difference]: Finished difference. Result has 48 places, 37 transitions, 139 flow [2021-03-26 00:01:16,045 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2021-03-26 00:01:16,045 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -14 predicate places. [2021-03-26 00:01:16,045 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:01:16,046 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 37 transitions, 139 flow [2021-03-26 00:01:16,046 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 37 transitions, 139 flow [2021-03-26 00:01:16,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 37 transitions, 139 flow [2021-03-26 00:01:16,082 INFO L129 PetriNetUnfolder]: 99/273 cut-off events. [2021-03-26 00:01:16,082 INFO L130 PetriNetUnfolder]: For 78/101 co-relation queries the response was YES. [2021-03-26 00:01:16,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 273 events. 99/273 cut-off events. For 78/101 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1506 event pairs, 50 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 578. Up to 146 conditions per place. [2021-03-26 00:01:16,086 INFO L142 LiptonReduction]: Number of co-enabled transitions 566 [2021-03-26 00:01:16,730 WARN L205 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-26 00:01:16,919 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-26 00:01:17,285 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-26 00:01:17,440 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-26 00:01:17,450 INFO L154 LiptonReduction]: Checked pairs total: 906 [2021-03-26 00:01:17,451 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:01:17,451 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1406 [2021-03-26 00:01:17,452 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 137 flow [2021-03-26 00:01:17,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 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:01:17,452 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:01:17,452 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:01:17,452 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:01:17,453 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:01:17,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:01:17,453 INFO L82 PathProgramCache]: Analyzing trace with hash -966126926, now seen corresponding path program 1 times [2021-03-26 00:01:17,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:01:17,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659589458] [2021-03-26 00:01:17,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:01:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:01:17,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:17,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:01:17,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:17,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:01:17,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:17,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:01:17,517 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:01:17,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659589458] [2021-03-26 00:01:17,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:01:17,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:01:17,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496997934] [2021-03-26 00:01:17,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:01:17,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:01:17,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:01:17,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:01:17,520 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 211 [2021-03-26 00:01:17,521 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 178.5) internal successors, (714), 4 states have internal predecessors, (714), 0 states have call successors, (0), 0 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:01:17,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:01:17,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 211 [2021-03-26 00:01:17,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:01:17,587 INFO L129 PetriNetUnfolder]: 123/400 cut-off events. [2021-03-26 00:01:17,588 INFO L130 PetriNetUnfolder]: For 303/426 co-relation queries the response was YES. [2021-03-26 00:01:17,589 INFO L84 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 400 events. 123/400 cut-off events. For 303/426 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2650 event pairs, 74 based on Foata normal form. 21/386 useless extension candidates. Maximal degree in co-relation 867. Up to 204 conditions per place. [2021-03-26 00:01:17,590 INFO L132 encePairwiseOnDemand]: 207/211 looper letters, 4 selfloop transitions, 4 changer transitions 2/38 dead transitions. [2021-03-26 00:01:17,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 168 flow [2021-03-26 00:01:17,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:01:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:01:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 717 transitions. [2021-03-26 00:01:17,593 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8495260663507109 [2021-03-26 00:01:17,593 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 717 transitions. [2021-03-26 00:01:17,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 717 transitions. [2021-03-26 00:01:17,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:01:17,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 717 transitions. [2021-03-26 00:01:17,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 179.25) internal successors, (717), 4 states have internal predecessors, (717), 0 states have call successors, (0), 0 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:01:17,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 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:01:17,597 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 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:01:17,597 INFO L185 Difference]: Start difference. First operand has 47 places, 36 transitions, 137 flow. Second operand 4 states and 717 transitions. [2021-03-26 00:01:17,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 168 flow [2021-03-26 00:01:17,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:01:17,600 INFO L241 Difference]: Finished difference. Result has 50 places, 36 transitions, 148 flow [2021-03-26 00:01:17,600 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2021-03-26 00:01:17,601 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -12 predicate places. [2021-03-26 00:01:17,601 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:01:17,601 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 36 transitions, 148 flow [2021-03-26 00:01:17,601 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 36 transitions, 148 flow [2021-03-26 00:01:17,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 36 transitions, 148 flow [2021-03-26 00:01:17,642 INFO L129 PetriNetUnfolder]: 106/355 cut-off events. [2021-03-26 00:01:17,642 INFO L130 PetriNetUnfolder]: For 290/343 co-relation queries the response was YES. [2021-03-26 00:01:17,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 355 events. 106/355 cut-off events. For 290/343 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2309 event pairs, 61 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 781. Up to 175 conditions per place. [2021-03-26 00:01:17,646 INFO L142 LiptonReduction]: Number of co-enabled transitions 566 [2021-03-26 00:01:17,663 INFO L154 LiptonReduction]: Checked pairs total: 340 [2021-03-26 00:01:17,663 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:01:17,663 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 62 [2021-03-26 00:01:17,665 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 148 flow [2021-03-26 00:01:17,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.5) internal successors, (714), 4 states have internal predecessors, (714), 0 states have call successors, (0), 0 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:01:17,666 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:01:17,666 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:01:17,666 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:01:17,666 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:01:17,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:01:17,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2032811454, now seen corresponding path program 1 times [2021-03-26 00:01:17,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:01:17,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133925070] [2021-03-26 00:01:17,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:01:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:01:17,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:17,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:01:17,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:17,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:01:17,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:17,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:01:17,757 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:01:17,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133925070] [2021-03-26 00:01:17,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:01:17,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:01:17,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928765081] [2021-03-26 00:01:17,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:01:17,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:01:17,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:01:17,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:01:17,760 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 211 [2021-03-26 00:01:17,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 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:01:17,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:01:17,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 211 [2021-03-26 00:01:17,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:01:17,977 INFO L129 PetriNetUnfolder]: 1099/2061 cut-off events. [2021-03-26 00:01:17,977 INFO L130 PetriNetUnfolder]: For 737/872 co-relation queries the response was YES. [2021-03-26 00:01:17,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4446 conditions, 2061 events. 1099/2061 cut-off events. For 737/872 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 16400 event pairs, 533 based on Foata normal form. 138/1757 useless extension candidates. Maximal degree in co-relation 4431. Up to 1434 conditions per place. [2021-03-26 00:01:17,995 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 12 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2021-03-26 00:01:17,996 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 220 flow [2021-03-26 00:01:17,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:01:17,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:01:17,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 899 transitions. [2021-03-26 00:01:17,998 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.852132701421801 [2021-03-26 00:01:17,998 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 899 transitions. [2021-03-26 00:01:17,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 899 transitions. [2021-03-26 00:01:17,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:01:17,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 899 transitions. [2021-03-26 00:01:18,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:01:18,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 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:01:18,004 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 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:01:18,004 INFO L185 Difference]: Start difference. First operand has 49 places, 36 transitions, 148 flow. Second operand 5 states and 899 transitions. [2021-03-26 00:01:18,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 220 flow [2021-03-26 00:01:18,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 214 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:01:18,010 INFO L241 Difference]: Finished difference. Result has 54 places, 45 transitions, 217 flow [2021-03-26 00:01:18,010 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2021-03-26 00:01:18,010 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -8 predicate places. [2021-03-26 00:01:18,010 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:01:18,010 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 217 flow [2021-03-26 00:01:18,011 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 45 transitions, 217 flow [2021-03-26 00:01:18,011 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 217 flow [2021-03-26 00:01:18,190 INFO L129 PetriNetUnfolder]: 852/1709 cut-off events. [2021-03-26 00:01:18,190 INFO L130 PetriNetUnfolder]: For 1363/1920 co-relation queries the response was YES. [2021-03-26 00:01:18,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4866 conditions, 1709 events. 852/1709 cut-off events. For 1363/1920 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 13436 event pairs, 405 based on Foata normal form. 7/1503 useless extension candidates. Maximal degree in co-relation 4850. Up to 1114 conditions per place. [2021-03-26 00:01:18,215 INFO L142 LiptonReduction]: Number of co-enabled transitions 838 [2021-03-26 00:01:18,718 INFO L154 LiptonReduction]: Checked pairs total: 807 [2021-03-26 00:01:18,718 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:01:18,719 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 709 [2021-03-26 00:01:18,719 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 211 flow [2021-03-26 00:01:18,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 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:01:18,720 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:01:18,720 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:01:18,720 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:01:18,720 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:01:18,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:01:18,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2095821307, now seen corresponding path program 1 times [2021-03-26 00:01:18,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:01:18,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562811649] [2021-03-26 00:01:18,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:01:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:01:18,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:18,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:01:18,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:18,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:01:18,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:18,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:01:18,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:18,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:01:18,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:18,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 00:01:18,826 INFO L142 QuantifierPusher]: treesize reduction 14, result has 70.2 percent of original size [2021-03-26 00:01:18,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 00:01:18,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:18,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:01:18,855 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:01:18,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562811649] [2021-03-26 00:01:18,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:01:18,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:01:18,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133004063] [2021-03-26 00:01:18,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 00:01:18,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:01:18,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 00:01:18,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-03-26 00:01:18,858 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 211 [2021-03-26 00:01:18,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 211 flow. Second operand has 8 states, 8 states have (on average 147.375) internal successors, (1179), 8 states have internal predecessors, (1179), 0 states have call successors, (0), 0 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:01:18,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:01:18,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 211 [2021-03-26 00:01:18,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:01:20,670 INFO L129 PetriNetUnfolder]: 7068/11541 cut-off events. [2021-03-26 00:01:20,671 INFO L130 PetriNetUnfolder]: For 13586/14739 co-relation queries the response was YES. [2021-03-26 00:01:20,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35173 conditions, 11541 events. 7068/11541 cut-off events. For 13586/14739 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 89358 event pairs, 1494 based on Foata normal form. 144/10919 useless extension candidates. Maximal degree in co-relation 35155. Up to 3934 conditions per place. [2021-03-26 00:01:20,786 INFO L132 encePairwiseOnDemand]: 196/211 looper letters, 53 selfloop transitions, 45 changer transitions 0/116 dead transitions. [2021-03-26 00:01:20,786 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 116 transitions, 743 flow [2021-03-26 00:01:20,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:01:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:01:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1395 transitions. [2021-03-26 00:01:20,790 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7345971563981043 [2021-03-26 00:01:20,790 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1395 transitions. [2021-03-26 00:01:20,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1395 transitions. [2021-03-26 00:01:20,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:01:20,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1395 transitions. [2021-03-26 00:01:20,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 155.0) internal successors, (1395), 9 states have internal predecessors, (1395), 0 states have call successors, (0), 0 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:01:20,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 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:01:20,797 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 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:01:20,797 INFO L185 Difference]: Start difference. First operand has 54 places, 44 transitions, 211 flow. Second operand 9 states and 1395 transitions. [2021-03-26 00:01:20,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 116 transitions, 743 flow [2021-03-26 00:01:21,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 116 transitions, 726 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-03-26 00:01:21,074 INFO L241 Difference]: Finished difference. Result has 64 places, 84 transitions, 629 flow [2021-03-26 00:01:21,074 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=629, PETRI_PLACES=64, PETRI_TRANSITIONS=84} [2021-03-26 00:01:21,074 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2021-03-26 00:01:21,074 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:01:21,075 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 84 transitions, 629 flow [2021-03-26 00:01:21,075 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 84 transitions, 629 flow [2021-03-26 00:01:21,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 84 transitions, 629 flow [2021-03-26 00:01:21,744 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][43], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 155#true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 194#(= ~__unbuffered_cnt~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 50#L768true, Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 52#P2EXITtrue, 180#(= ~y~0 1), 85#L889true, 59#L831true, 126#P1EXITtrue, 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:01:21,744 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 00:01:21,744 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 00:01:21,744 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 00:01:21,744 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 00:01:22,051 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][43], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, Black: 155#true, P0Thread1of1ForFork1InUse, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 194#(= ~__unbuffered_cnt~0 0), 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 180#(= ~y~0 1), 52#P2EXITtrue, Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 85#L889true, 25#L847true, 58#P0EXITtrue, 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 126#P1EXITtrue]) [2021-03-26 00:01:22,051 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-26 00:01:22,051 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 00:01:22,051 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 00:01:22,052 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 00:01:22,079 INFO L129 PetriNetUnfolder]: 4634/8165 cut-off events. [2021-03-26 00:01:22,079 INFO L130 PetriNetUnfolder]: For 17800/19762 co-relation queries the response was YES. [2021-03-26 00:01:22,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29805 conditions, 8165 events. 4634/8165 cut-off events. For 17800/19762 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 68489 event pairs, 1656 based on Foata normal form. 260/7619 useless extension candidates. Maximal degree in co-relation 29783. Up to 3634 conditions per place. [2021-03-26 00:01:22,273 INFO L142 LiptonReduction]: Number of co-enabled transitions 1410 [2021-03-26 00:01:30,624 INFO L154 LiptonReduction]: Checked pairs total: 270 [2021-03-26 00:01:30,624 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:01:30,624 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9550 [2021-03-26 00:01:30,625 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 84 transitions, 629 flow [2021-03-26 00:01:30,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 147.375) internal successors, (1179), 8 states have internal predecessors, (1179), 0 states have call successors, (0), 0 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:01:30,626 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:01:30,626 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:01:30,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:01:30,626 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:01:30,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:01:30,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1196782721, now seen corresponding path program 1 times [2021-03-26 00:01:30,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:01:30,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360229400] [2021-03-26 00:01:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:01:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:01:30,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:30,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:01:30,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:01:30,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:01:30,682 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 00:01:30,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:01:30,694 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:01:30,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360229400] [2021-03-26 00:01:30,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:01:30,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:01:30,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552007546] [2021-03-26 00:01:30,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:01:30,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:01:30,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:01:30,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:01:30,697 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 211 [2021-03-26 00:01:30,697 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 84 transitions, 629 flow. Second operand has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 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:01:30,697 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:01:30,697 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 211 [2021-03-26 00:01:30,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:01:32,001 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][41], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 155#true, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 173#(= ~__unbuffered_p2_EAX~0 0), 79#P3EXITtrue, Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 180#(= ~y~0 1), 85#L889true, 58#P0EXITtrue, 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 94#L811true, 126#P1EXITtrue, 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:01:32,001 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-26 00:01:32,002 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 00:01:32,002 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 00:01:32,002 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 00:01:32,081 INFO L129 PetriNetUnfolder]: 6384/11505 cut-off events. [2021-03-26 00:01:32,081 INFO L130 PetriNetUnfolder]: For 32063/36446 co-relation queries the response was YES. [2021-03-26 00:01:32,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43025 conditions, 11505 events. 6384/11505 cut-off events. For 32063/36446 co-relation queries the response was YES. Maximal size of possible extension queue 1177. Compared 103020 event pairs, 2528 based on Foata normal form. 807/11178 useless extension candidates. Maximal degree in co-relation 43001. Up to 5498 conditions per place. [2021-03-26 00:01:32,182 INFO L132 encePairwiseOnDemand]: 202/211 looper letters, 40 selfloop transitions, 53 changer transitions 3/133 dead transitions. [2021-03-26 00:01:32,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 133 transitions, 1257 flow [2021-03-26 00:01:32,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:01:32,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:01:32,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 837 transitions. [2021-03-26 00:01:32,185 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7933649289099526 [2021-03-26 00:01:32,185 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 837 transitions. [2021-03-26 00:01:32,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 837 transitions. [2021-03-26 00:01:32,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:01:32,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 837 transitions. [2021-03-26 00:01:32,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 0 states have call successors, (0), 0 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:01:32,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 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:01:32,189 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 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:01:32,189 INFO L185 Difference]: Start difference. First operand has 64 places, 84 transitions, 629 flow. Second operand 5 states and 837 transitions. [2021-03-26 00:01:32,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 133 transitions, 1257 flow [2021-03-26 00:01:32,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 133 transitions, 1244 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-03-26 00:01:32,205 INFO L241 Difference]: Finished difference. Result has 71 places, 118 transitions, 1186 flow [2021-03-26 00:01:32,205 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1186, PETRI_PLACES=71, PETRI_TRANSITIONS=118} [2021-03-26 00:01:32,206 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2021-03-26 00:01:32,206 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:01:32,206 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 118 transitions, 1186 flow [2021-03-26 00:01:32,206 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 118 transitions, 1186 flow [2021-03-26 00:01:32,207 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 118 transitions, 1186 flow [2021-03-26 00:01:33,107 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L3-->L889: Formula: (let ((.cse7 (= (mod v_~a$w_buff0_used~0_564 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd0~0_78 256) 0)) (.cse9 (= (mod v_~a$w_buff1_used~0_462 256) 0)) (.cse8 (= (mod v_~a$r_buff1_thd0~0_72 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and (or (and .cse0 (= v_~a~0_235 |v_ULTIMATE.start_main_#t~ite56_30|)) (and .cse1 (= |v_ULTIMATE.start_main_#t~ite56_30| v_~a$w_buff1~0_176) .cse2)) (= v_~a~0_234 |v_ULTIMATE.start_main_#t~ite56_30|) .cse3) (and .cse4 (= v_~a~0_234 v_~a$w_buff0~0_171) (= |v_ULTIMATE.start_main_#t~ite56_29| |v_ULTIMATE.start_main_#t~ite56_30|) .cse5)) (or (and .cse1 (= v_~a$w_buff1_used~0_461 0) .cse2) (and .cse0 (= v_~a$w_buff1_used~0_462 v_~a$w_buff1_used~0_461))) (or (and (= v_~a$w_buff0_used~0_564 v_~a$w_buff0_used~0_563) .cse3) (and .cse4 (= v_~a$w_buff0_used~0_563 0) .cse5)) (= v_~a$r_buff1_thd0~0_72 v_~a$r_buff1_thd0~0_71) (not (= v_ULTIMATE.start_assume_abort_if_not_~cond_9 0)) (= v_~a$r_buff0_thd0~0_78 v_~a$r_buff0_thd0~0_77)))) InVars {~a~0=v_~a~0_235, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_9, ~a$w_buff1~0=v_~a$w_buff1~0_176, ~a$w_buff0~0=v_~a$w_buff0~0_171, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_72, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_564, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_78, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_462, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_29|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_32|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_563, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_30|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_77, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_30|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_28|, ~a~0=v_~a~0_234, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_36|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_32|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_9, ~a$w_buff1~0=v_~a$w_buff1~0_176, ~a$w_buff0~0=v_~a$w_buff0~0_171, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_71, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_461} AuxVars[|v_ULTIMATE.start_main_#t~ite56_30|] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~ite58, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ULTIMATE.start_main_#t~ite57, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite59, ~a$w_buff1_used~0, ULTIMATE.start_main_#t~ite56][57], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 85#L889true, 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 31#L818true, Black: 155#true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 114#L775true, Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 180#(= ~y~0 1), Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 59#L831true, 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 246#true, Black: 248#(= ~z~0 1), 126#P1EXITtrue, Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:01:33,107 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 00:01:33,107 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 00:01:33,107 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 00:01:33,107 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 00:01:33,125 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1095] L847-->L854: Formula: (let ((.cse14 (= (mod v_~a$w_buff1_used~0_402 256) 0)) (.cse8 (= (mod v_~a$r_buff1_thd4~0_185 256) 0)) (.cse13 (= (mod v_~a$w_buff0_used~0_486 256) 0)) (.cse12 (= (mod v_~a$r_buff0_thd4~0_232 256) 0)) (.cse9 (= 0 (mod v_~a$w_buff0_used~0_485 256)))) (let ((.cse4 (not .cse9)) (.cse3 (or .cse12 .cse9)) (.cse0 (or .cse13 .cse12)) (.cse6 (not .cse8)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse8)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_486 v_~a$w_buff0_used~0_485) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_485 0))) (or (and (= v_~a$r_buff0_thd4~0_232 v_~a$r_buff0_thd4~0_231) .cse3) (and (= v_~a$r_buff0_thd4~0_231 0) .cse2 .cse4)) (let ((.cse7 (= (mod v_~a$w_buff1_used~0_401 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_231 256) 0))) (or (and (= v_~a$r_buff1_thd4~0_184 0) (or (and .cse4 (not .cse5)) (and .cse6 (not .cse7)))) (and (= v_~a$r_buff1_thd4~0_185 v_~a$r_buff1_thd4~0_184) (or .cse7 .cse8) (or .cse9 .cse5)))) (or (and (= v_~a$w_buff1_used~0_401 0) (or (and .cse2 .cse4) (and .cse6 .cse10))) (and (= v_~a$w_buff1_used~0_402 v_~a$w_buff1_used~0_401) .cse3 .cse11)) (or (and .cse0 (= |v_P3_#t~ite46_35| v_~a~0_188) (or (and .cse6 .cse10 (= |v_P3_#t~ite46_35| v_~a$w_buff1~0_126)) (and .cse11 (= |v_P3_#t~ite46_35| v_~a~0_189)))) (and .cse1 (= |v_P3_#t~ite46_35| |v_P3Thread1of1ForFork0_#t~ite46_1|) .cse2 (= v_~a~0_188 v_~a$w_buff0~0_107)))))) InVars {~a~0=v_~a~0_189, ~a$w_buff1~0=v_~a$w_buff1~0_126, P3Thread1of1ForFork0_#t~ite46=|v_P3Thread1of1ForFork0_#t~ite46_1|, ~a$w_buff0~0=v_~a$w_buff0~0_107, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_185, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_486, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_402, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_232} OutVars{P3Thread1of1ForFork0_#t~ite46=|v_P3Thread1of1ForFork0_#t~ite46_2|, P3Thread1of1ForFork0_#t~ite47=|v_P3Thread1of1ForFork0_#t~ite47_1|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_184, P3Thread1of1ForFork0_#t~ite48=|v_P3Thread1of1ForFork0_#t~ite48_1|, P3Thread1of1ForFork0_#t~ite49=|v_P3Thread1of1ForFork0_#t~ite49_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_485, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_231, ~a~0=v_~a~0_188, ~a$w_buff1~0=v_~a$w_buff1~0_126, ~a$w_buff0~0=v_~a$w_buff0~0_107, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_401, P3Thread1of1ForFork0_#t~ite50=|v_P3Thread1of1ForFork0_#t~ite50_1|, P3Thread1of1ForFork0_#t~ite51=|v_P3Thread1of1ForFork0_#t~ite51_1|} AuxVars[|v_P3_#t~ite46_35|] AssignedVars[~a~0, P3Thread1of1ForFork0_#t~ite46, P3Thread1of1ForFork0_#t~ite47, ~a$r_buff1_thd4~0, P3Thread1of1ForFork0_#t~ite48, P3Thread1of1ForFork0_#t~ite49, ~a$w_buff0_used~0, ~a$w_buff1_used~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite50, P3Thread1of1ForFork0_#t~ite51][1], [Black: 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 68#L785true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 77#L854true, 85#L889true, 155#true, 31#L818true, 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 248#(= ~z~0 1), Black: 180#(= ~y~0 1), 58#P0EXITtrue, Black: 246#true, Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:01:33,125 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 00:01:33,125 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 00:01:33,125 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 00:01:33,126 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 00:01:33,126 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1183] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_66 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_41|) (= v_~main$tmp_guard1~0_66 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_72 0) (= v_~y~0_75 2) (= 2 v_~__unbuffered_p2_EAX~0_67) (= v_~__unbuffered_p3_EAX~0_70 1) (= v_~__unbuffered_p3_EBX~0_101 0) (= v_~__unbuffered_p2_EBX~0_70 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_25 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_101, ~y~0=v_~y~0_75} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_66, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_101, ~y~0=v_~y~0_75, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_41|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression][110], [P1Thread1of1ForFork2InUse, Black: 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), P3Thread1of1ForFork0InUse, 68#L785true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 25#L847true, 155#true, 31#L818true, 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 55#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 248#(= ~z~0 1), Black: 180#(= ~y~0 1), 58#P0EXITtrue, Black: 246#true, Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:01:33,126 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 00:01:33,126 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 00:01:33,126 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 00:01:33,126 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 00:01:33,256 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][85], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 87#L878-1true, 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 155#true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 180#(= ~y~0 1), 52#P2EXITtrue, Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 58#P0EXITtrue, 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 59#L831true, Black: 246#true, Black: 248#(= ~z~0 1), 126#P1EXITtrue, Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:01:33,256 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2021-03-26 00:01:33,256 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 00:01:33,256 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 00:01:33,256 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 00:01:33,259 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][85], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 85#L889true, 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 155#true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 180#(= ~y~0 1), 52#P2EXITtrue, 58#P0EXITtrue, 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 59#L831true, Black: 246#true, 126#P1EXITtrue, Black: 248#(= ~z~0 1), Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:01:33,260 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 00:01:33,260 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 00:01:33,260 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 00:01:33,260 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 00:01:33,326 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][85], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 79#P3EXITtrue, 85#L889true, 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 155#true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 50#L768true, Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 52#P2EXITtrue, 180#(= ~y~0 1), 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 246#true, 126#P1EXITtrue, Black: 248#(= ~z~0 1), Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:01:33,326 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-26 00:01:33,326 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 00:01:33,326 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 00:01:33,326 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 00:01:33,327 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][85], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 83#L3true, 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 155#true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 180#(= ~y~0 1), 52#P2EXITtrue, Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 58#P0EXITtrue, 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 59#L831true, Black: 246#true, 126#P1EXITtrue, Black: 248#(= ~z~0 1), Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:01:33,327 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2021-03-26 00:01:33,327 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 00:01:33,327 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 00:01:33,327 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 00:01:33,370 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][85], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 85#L889true, 25#L847true, 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 155#true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 180#(= ~y~0 1), 52#P2EXITtrue, Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 58#P0EXITtrue, 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 246#true, Black: 248#(= ~z~0 1), 126#P1EXITtrue, Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:01:33,370 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-26 00:01:33,370 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 00:01:33,370 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 00:01:33,370 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 00:01:33,487 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][85], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 77#L854true, 85#L889true, 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 155#true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 52#P2EXITtrue, 180#(= ~y~0 1), 58#P0EXITtrue, 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 246#true, 126#P1EXITtrue, Black: 248#(= ~z~0 1), Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:01:33,487 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is not cut-off event [2021-03-26 00:01:33,487 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2021-03-26 00:01:33,488 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2021-03-26 00:01:33,488 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2021-03-26 00:01:33,492 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][85], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 79#P3EXITtrue, 85#L889true, 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 155#true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 52#P2EXITtrue, 180#(= ~y~0 1), 58#P0EXITtrue, 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 246#true, 126#P1EXITtrue, Black: 248#(= ~z~0 1), Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:01:33,492 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is not cut-off event [2021-03-26 00:01:33,492 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2021-03-26 00:01:33,492 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2021-03-26 00:01:33,492 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2021-03-26 00:01:33,493 INFO L129 PetriNetUnfolder]: 6895/12277 cut-off events. [2021-03-26 00:01:33,493 INFO L130 PetriNetUnfolder]: For 37019/41542 co-relation queries the response was YES. [2021-03-26 00:01:33,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47549 conditions, 12277 events. 6895/12277 cut-off events. For 37019/41542 co-relation queries the response was YES. Maximal size of possible extension queue 1348. Compared 110474 event pairs, 2116 based on Foata normal form. 442/11396 useless extension candidates. Maximal degree in co-relation 47522. Up to 5765 conditions per place. [2021-03-26 00:01:33,648 INFO L142 LiptonReduction]: Number of co-enabled transitions 1934 [2021-03-26 00:02:01,356 INFO L154 LiptonReduction]: Checked pairs total: 624 [2021-03-26 00:02:01,356 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:02:01,357 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29151 [2021-03-26 00:02:01,357 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 118 transitions, 1186 flow [2021-03-26 00:02:01,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 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:02:01,358 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:02:01,358 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:02:01,358 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:02:01,358 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:02:01,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:02:01,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2068692163, now seen corresponding path program 1 times [2021-03-26 00:02:01,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:02:01,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541461823] [2021-03-26 00:02:01,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:02:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:02:01,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:02:01,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:02:01,433 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-26 00:02:01,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:02:01,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:02:01,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:02:01,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:02:01,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:02:01,442 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:02:01,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541461823] [2021-03-26 00:02:01,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:02:01,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:02:01,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865353771] [2021-03-26 00:02:01,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:02:01,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:02:01,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:02:01,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:02:01,445 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 211 [2021-03-26 00:02:01,446 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 118 transitions, 1186 flow. Second operand has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 0 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:02:01,446 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:02:01,446 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 211 [2021-03-26 00:02:01,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:02:02,514 INFO L129 PetriNetUnfolder]: 5062/9805 cut-off events. [2021-03-26 00:02:02,514 INFO L130 PetriNetUnfolder]: For 34839/43931 co-relation queries the response was YES. [2021-03-26 00:02:02,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38879 conditions, 9805 events. 5062/9805 cut-off events. For 34839/43931 co-relation queries the response was YES. Maximal size of possible extension queue 1063. Compared 91772 event pairs, 748 based on Foata normal form. 2657/11351 useless extension candidates. Maximal degree in co-relation 38850. Up to 5735 conditions per place. [2021-03-26 00:02:02,595 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 16 selfloop transitions, 14 changer transitions 0/133 dead transitions. [2021-03-26 00:02:02,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 133 transitions, 1326 flow [2021-03-26 00:02:02,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:02:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:02:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1079 transitions. [2021-03-26 00:02:02,598 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8522906793048973 [2021-03-26 00:02:02,598 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1079 transitions. [2021-03-26 00:02:02,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1079 transitions. [2021-03-26 00:02:02,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:02:02,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1079 transitions. [2021-03-26 00:02:02,601 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:02:02,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 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:02:02,603 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 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:02:02,603 INFO L185 Difference]: Start difference. First operand has 71 places, 118 transitions, 1186 flow. Second operand 6 states and 1079 transitions. [2021-03-26 00:02:02,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 133 transitions, 1326 flow [2021-03-26 00:02:02,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 133 transitions, 1310 flow, removed 8 selfloop flow, removed 0 redundant places. [2021-03-26 00:02:02,626 INFO L241 Difference]: Finished difference. Result has 79 places, 127 transitions, 1302 flow [2021-03-26 00:02:02,626 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1302, PETRI_PLACES=79, PETRI_TRANSITIONS=127} [2021-03-26 00:02:02,626 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2021-03-26 00:02:02,626 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:02:02,627 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 127 transitions, 1302 flow [2021-03-26 00:02:02,627 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 127 transitions, 1302 flow [2021-03-26 00:02:02,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 127 transitions, 1302 flow [2021-03-26 00:02:03,056 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][39], [P1Thread1of1ForFork2InUse, 257#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 260#(not (= 4 ~__unbuffered_cnt~0)), Black: 261#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 263#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 87#L878-1true, 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 155#true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 180#(= ~y~0 1), Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 52#P2EXITtrue, 58#P0EXITtrue, 59#L831true, 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 246#true, Black: 248#(= ~z~0 1), 126#P1EXITtrue, Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:02:03,056 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 00:02:03,056 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 00:02:03,056 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 00:02:03,056 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 00:02:03,112 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][39], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 261#(= ULTIMATE.start_assume_abort_if_not_~cond 0), P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 260#(not (= 4 ~__unbuffered_cnt~0)), Black: 263#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 83#L3true, 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 155#true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 180#(= ~y~0 1), Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 52#P2EXITtrue, 58#P0EXITtrue, 59#L831true, 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 246#true, Black: 248#(= ~z~0 1), 126#P1EXITtrue, Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:02:03,112 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 00:02:03,112 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 00:02:03,112 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 00:02:03,112 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 00:02:03,114 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][39], [P1Thread1of1ForFork2InUse, 257#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 260#(not (= 4 ~__unbuffered_cnt~0)), Black: 261#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 263#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 83#L3true, 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 155#true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 180#(= ~y~0 1), Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 52#P2EXITtrue, 58#P0EXITtrue, 59#L831true, 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 246#true, Black: 248#(= ~z~0 1), 126#P1EXITtrue, Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:02:03,115 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 00:02:03,115 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 00:02:03,115 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 00:02:03,115 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 00:02:03,184 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1095] L847-->L854: Formula: (let ((.cse14 (= (mod v_~a$w_buff1_used~0_402 256) 0)) (.cse8 (= (mod v_~a$r_buff1_thd4~0_185 256) 0)) (.cse13 (= (mod v_~a$w_buff0_used~0_486 256) 0)) (.cse12 (= (mod v_~a$r_buff0_thd4~0_232 256) 0)) (.cse9 (= 0 (mod v_~a$w_buff0_used~0_485 256)))) (let ((.cse4 (not .cse9)) (.cse3 (or .cse12 .cse9)) (.cse0 (or .cse13 .cse12)) (.cse6 (not .cse8)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse8)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_486 v_~a$w_buff0_used~0_485) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_485 0))) (or (and (= v_~a$r_buff0_thd4~0_232 v_~a$r_buff0_thd4~0_231) .cse3) (and (= v_~a$r_buff0_thd4~0_231 0) .cse2 .cse4)) (let ((.cse7 (= (mod v_~a$w_buff1_used~0_401 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_231 256) 0))) (or (and (= v_~a$r_buff1_thd4~0_184 0) (or (and .cse4 (not .cse5)) (and .cse6 (not .cse7)))) (and (= v_~a$r_buff1_thd4~0_185 v_~a$r_buff1_thd4~0_184) (or .cse7 .cse8) (or .cse9 .cse5)))) (or (and (= v_~a$w_buff1_used~0_401 0) (or (and .cse2 .cse4) (and .cse6 .cse10))) (and (= v_~a$w_buff1_used~0_402 v_~a$w_buff1_used~0_401) .cse3 .cse11)) (or (and .cse0 (= |v_P3_#t~ite46_35| v_~a~0_188) (or (and .cse6 .cse10 (= |v_P3_#t~ite46_35| v_~a$w_buff1~0_126)) (and .cse11 (= |v_P3_#t~ite46_35| v_~a~0_189)))) (and .cse1 (= |v_P3_#t~ite46_35| |v_P3Thread1of1ForFork0_#t~ite46_1|) .cse2 (= v_~a~0_188 v_~a$w_buff0~0_107)))))) InVars {~a~0=v_~a~0_189, ~a$w_buff1~0=v_~a$w_buff1~0_126, P3Thread1of1ForFork0_#t~ite46=|v_P3Thread1of1ForFork0_#t~ite46_1|, ~a$w_buff0~0=v_~a$w_buff0~0_107, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_185, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_486, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_402, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_232} OutVars{P3Thread1of1ForFork0_#t~ite46=|v_P3Thread1of1ForFork0_#t~ite46_2|, P3Thread1of1ForFork0_#t~ite47=|v_P3Thread1of1ForFork0_#t~ite47_1|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_184, P3Thread1of1ForFork0_#t~ite48=|v_P3Thread1of1ForFork0_#t~ite48_1|, P3Thread1of1ForFork0_#t~ite49=|v_P3Thread1of1ForFork0_#t~ite49_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_485, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_231, ~a~0=v_~a~0_188, ~a$w_buff1~0=v_~a$w_buff1~0_126, ~a$w_buff0~0=v_~a$w_buff0~0_107, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_401, P3Thread1of1ForFork0_#t~ite50=|v_P3Thread1of1ForFork0_#t~ite50_1|, P3Thread1of1ForFork0_#t~ite51=|v_P3Thread1of1ForFork0_#t~ite51_1|} AuxVars[|v_P3_#t~ite46_35|] AssignedVars[~a~0, P3Thread1of1ForFork0_#t~ite46, P3Thread1of1ForFork0_#t~ite47, ~a$r_buff1_thd4~0, P3Thread1of1ForFork0_#t~ite48, P3Thread1of1ForFork0_#t~ite49, ~a$w_buff0_used~0, ~a$w_buff1_used~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite50, P3Thread1of1ForFork0_#t~ite51][1], [P1Thread1of1ForFork2InUse, Black: 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 257#true, P3Thread1of1ForFork0InUse, 68#L785true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 260#(not (= 4 ~__unbuffered_cnt~0)), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 261#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 263#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 77#L854true, 85#L889true, 155#true, 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 52#P2EXITtrue, Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 248#(= ~z~0 1), Black: 180#(= ~y~0 1), 58#P0EXITtrue, Black: 246#true, Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:02:03,184 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 00:02:03,184 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 00:02:03,184 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 00:02:03,184 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 00:02:03,240 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1183] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_66 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_41|) (= v_~main$tmp_guard1~0_66 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_72 0) (= v_~y~0_75 2) (= 2 v_~__unbuffered_p2_EAX~0_67) (= v_~__unbuffered_p3_EAX~0_70 1) (= v_~__unbuffered_p3_EBX~0_101 0) (= v_~__unbuffered_p2_EBX~0_70 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_25 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_101, ~y~0=v_~y~0_75} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_66, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_101, ~y~0=v_~y~0_75, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_41|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression][120], [P1Thread1of1ForFork2InUse, Black: 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 257#true, P3Thread1of1ForFork0InUse, 68#L785true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 260#(not (= 4 ~__unbuffered_cnt~0)), Black: 261#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 263#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 25#L847true, 155#true, 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 52#P2EXITtrue, Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 55#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 248#(= ~z~0 1), Black: 180#(= ~y~0 1), 58#P0EXITtrue, Black: 246#true, Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:02:03,240 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2021-03-26 00:02:03,241 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 00:02:03,241 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 00:02:03,241 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 00:02:03,243 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][39], [P1Thread1of1ForFork2InUse, 257#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 260#(not (= 4 ~__unbuffered_cnt~0)), Black: 261#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 263#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 85#L889true, 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 155#true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 52#P2EXITtrue, 180#(= ~y~0 1), 58#P0EXITtrue, 59#L831true, 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 246#true, 126#P1EXITtrue, Black: 248#(= ~z~0 1), Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:02:03,243 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 00:02:03,243 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 00:02:03,243 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 00:02:03,243 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 00:02:03,302 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][39], [P1Thread1of1ForFork2InUse, 257#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 197#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 260#(not (= 4 ~__unbuffered_cnt~0)), Black: 261#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 263#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 85#L889true, 25#L847true, 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 155#true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 173#(= ~__unbuffered_p2_EAX~0 0), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 180#(= ~y~0 1), Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 52#P2EXITtrue, 58#P0EXITtrue, 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 246#true, 126#P1EXITtrue, Black: 248#(= ~z~0 1), Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:02:03,302 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-26 00:02:03,302 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 00:02:03,302 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 00:02:03,302 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-26 00:02:03,336 INFO L129 PetriNetUnfolder]: 3839/7947 cut-off events. [2021-03-26 00:02:03,336 INFO L130 PetriNetUnfolder]: For 38161/43630 co-relation queries the response was YES. [2021-03-26 00:02:03,375 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37903 conditions, 7947 events. 3839/7947 cut-off events. For 38161/43630 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 77087 event pairs, 697 based on Foata normal form. 674/8082 useless extension candidates. Maximal degree in co-relation 37871. Up to 4365 conditions per place. [2021-03-26 00:02:03,440 INFO L142 LiptonReduction]: Number of co-enabled transitions 2702 [2021-03-26 00:02:11,041 INFO L154 LiptonReduction]: Checked pairs total: 765 [2021-03-26 00:02:11,041 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:02:11,041 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8415 [2021-03-26 00:02:11,042 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 127 transitions, 1302 flow [2021-03-26 00:02:11,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 0 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:02:11,042 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:02:11,043 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:02:11,043 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:02:11,043 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:02:11,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:02:11,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1827085746, now seen corresponding path program 1 times [2021-03-26 00:02:11,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:02:11,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593633062] [2021-03-26 00:02:11,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:02:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:02:11,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:02:11,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:02:11,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:02:11,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:02:11,116 INFO L142 QuantifierPusher]: treesize reduction 4, result has 90.0 percent of original size [2021-03-26 00:02:11,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 00:02:11,142 INFO L142 QuantifierPusher]: treesize reduction 4, result has 90.0 percent of original size [2021-03-26 00:02:11,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 00:02:11,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:02:11,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:02:11,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:02:11,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:02:11,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:02:11,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:02:11,213 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:02:11,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593633062] [2021-03-26 00:02:11,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:02:11,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 00:02:11,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735243027] [2021-03-26 00:02:11,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 00:02:11,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:02:11,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 00:02:11,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-03-26 00:02:11,216 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 211 [2021-03-26 00:02:11,217 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 127 transitions, 1302 flow. Second operand has 9 states, 9 states have (on average 139.44444444444446) internal successors, (1255), 9 states have internal predecessors, (1255), 0 states have call successors, (0), 0 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:02:11,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:02:11,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 211 [2021-03-26 00:02:11,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:02:13,284 INFO L129 PetriNetUnfolder]: 8986/17569 cut-off events. [2021-03-26 00:02:13,284 INFO L130 PetriNetUnfolder]: For 108602/126207 co-relation queries the response was YES. [2021-03-26 00:02:13,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89311 conditions, 17569 events. 8986/17569 cut-off events. For 108602/126207 co-relation queries the response was YES. Maximal size of possible extension queue 1799. Compared 175651 event pairs, 1549 based on Foata normal form. 1709/18352 useless extension candidates. Maximal degree in co-relation 89277. Up to 9054 conditions per place. [2021-03-26 00:02:13,426 INFO L132 encePairwiseOnDemand]: 197/211 looper letters, 152 selfloop transitions, 92 changer transitions 12/284 dead transitions. [2021-03-26 00:02:13,426 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 284 transitions, 3630 flow [2021-03-26 00:02:13,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-26 00:02:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-26 00:02:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1776 transitions. [2021-03-26 00:02:13,430 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7014218009478673 [2021-03-26 00:02:13,430 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1776 transitions. [2021-03-26 00:02:13,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1776 transitions. [2021-03-26 00:02:13,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:02:13,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1776 transitions. [2021-03-26 00:02:13,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 148.0) internal successors, (1776), 12 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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:02:13,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 211.0) internal successors, (2743), 13 states have internal predecessors, (2743), 0 states have call successors, (0), 0 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:02:13,438 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 211.0) internal successors, (2743), 13 states have internal predecessors, (2743), 0 states have call successors, (0), 0 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:02:13,439 INFO L185 Difference]: Start difference. First operand has 79 places, 127 transitions, 1302 flow. Second operand 12 states and 1776 transitions. [2021-03-26 00:02:13,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 284 transitions, 3630 flow [2021-03-26 00:02:15,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 284 transitions, 3586 flow, removed 17 selfloop flow, removed 2 redundant places. [2021-03-26 00:02:15,544 INFO L241 Difference]: Finished difference. Result has 96 places, 168 transitions, 2133 flow [2021-03-26 00:02:15,544 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2133, PETRI_PLACES=96, PETRI_TRANSITIONS=168} [2021-03-26 00:02:15,544 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 34 predicate places. [2021-03-26 00:02:15,544 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:02:15,544 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 168 transitions, 2133 flow [2021-03-26 00:02:15,545 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 168 transitions, 2133 flow [2021-03-26 00:02:15,546 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 168 transitions, 2133 flow [2021-03-26 00:02:16,914 INFO L129 PetriNetUnfolder]: 6239/12751 cut-off events. [2021-03-26 00:02:16,915 INFO L130 PetriNetUnfolder]: For 71960/77143 co-relation queries the response was YES. [2021-03-26 00:02:16,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57871 conditions, 12751 events. 6239/12751 cut-off events. For 71960/77143 co-relation queries the response was YES. Maximal size of possible extension queue 1541. Compared 131770 event pairs, 1145 based on Foata normal form. 1393/13349 useless extension candidates. Maximal degree in co-relation 57831. Up to 5833 conditions per place. [2021-03-26 00:02:17,070 INFO L142 LiptonReduction]: Number of co-enabled transitions 3642 [2021-03-26 00:02:44,165 INFO L154 LiptonReduction]: Checked pairs total: 1890 [2021-03-26 00:02:44,165 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:02:44,165 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28621 [2021-03-26 00:02:44,165 INFO L480 AbstractCegarLoop]: Abstraction has has 96 places, 168 transitions, 2133 flow [2021-03-26 00:02:44,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 139.44444444444446) internal successors, (1255), 9 states have internal predecessors, (1255), 0 states have call successors, (0), 0 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:02:44,166 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:02:44,166 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:02:44,166 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:02:44,166 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:02:44,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:02:44,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1074485697, now seen corresponding path program 1 times [2021-03-26 00:02:44,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:02:44,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5960477] [2021-03-26 00:02:44,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:02:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:02:44,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:02:44,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:02:44,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:02:44,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:02:44,306 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-26 00:02:44,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:02:44,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:02:44,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:02:44,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:02:44,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:02:44,315 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:02:44,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5960477] [2021-03-26 00:02:44,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:02:44,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:02:44,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173319811] [2021-03-26 00:02:44,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:02:44,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:02:44,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:02:44,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:02:44,317 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 211 [2021-03-26 00:02:44,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 168 transitions, 2133 flow. Second operand has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 0 states have call successors, (0), 0 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:02:44,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:02:44,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 211 [2021-03-26 00:02:44,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:02:45,957 INFO L129 PetriNetUnfolder]: 6937/13658 cut-off events. [2021-03-26 00:02:45,957 INFO L130 PetriNetUnfolder]: For 104009/130627 co-relation queries the response was YES. [2021-03-26 00:02:46,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60228 conditions, 13658 events. 6937/13658 cut-off events. For 104009/130627 co-relation queries the response was YES. Maximal size of possible extension queue 1793. Compared 138906 event pairs, 335 based on Foata normal form. 5920/17979 useless extension candidates. Maximal degree in co-relation 60186. Up to 7169 conditions per place. [2021-03-26 00:02:46,067 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 12 selfloop transitions, 23 changer transitions 6/184 dead transitions. [2021-03-26 00:02:46,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 184 transitions, 2347 flow [2021-03-26 00:02:46,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:02:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:02:46,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1439 transitions. [2021-03-26 00:02:46,070 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8524881516587678 [2021-03-26 00:02:46,070 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1439 transitions. [2021-03-26 00:02:46,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1439 transitions. [2021-03-26 00:02:46,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:02:46,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1439 transitions. [2021-03-26 00:02:46,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 179.875) internal successors, (1439), 8 states have internal predecessors, (1439), 0 states have call successors, (0), 0 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:02:46,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 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:02:46,076 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 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:02:46,076 INFO L185 Difference]: Start difference. First operand has 96 places, 168 transitions, 2133 flow. Second operand 8 states and 1439 transitions. [2021-03-26 00:02:46,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 184 transitions, 2347 flow [2021-03-26 00:02:47,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 184 transitions, 2241 flow, removed 27 selfloop flow, removed 4 redundant places. [2021-03-26 00:02:47,095 INFO L241 Difference]: Finished difference. Result has 102 places, 175 transitions, 2187 flow [2021-03-26 00:02:47,095 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=2051, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2187, PETRI_PLACES=102, PETRI_TRANSITIONS=175} [2021-03-26 00:02:47,095 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 40 predicate places. [2021-03-26 00:02:47,095 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:02:47,095 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 175 transitions, 2187 flow [2021-03-26 00:02:47,096 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 175 transitions, 2187 flow [2021-03-26 00:02:47,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 175 transitions, 2187 flow [2021-03-26 00:02:48,000 INFO L129 PetriNetUnfolder]: 4368/9841 cut-off events. [2021-03-26 00:02:48,001 INFO L130 PetriNetUnfolder]: For 48135/50948 co-relation queries the response was YES. [2021-03-26 00:02:48,048 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47390 conditions, 9841 events. 4368/9841 cut-off events. For 48135/50948 co-relation queries the response was YES. Maximal size of possible extension queue 1256. Compared 106559 event pairs, 337 based on Foata normal form. 674/9974 useless extension candidates. Maximal degree in co-relation 47346. Up to 5118 conditions per place. [2021-03-26 00:02:48,128 INFO L142 LiptonReduction]: Number of co-enabled transitions 3946 [2021-03-26 00:02:54,813 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:02:54,947 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:03:09,285 INFO L154 LiptonReduction]: Checked pairs total: 4671 [2021-03-26 00:03:09,285 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:03:09,286 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22191 [2021-03-26 00:03:09,286 INFO L480 AbstractCegarLoop]: Abstraction has has 102 places, 175 transitions, 2205 flow [2021-03-26 00:03:09,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 0 states have call successors, (0), 0 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:03:09,287 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:03:09,287 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] [2021-03-26 00:03:09,287 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:03:09,287 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:03:09,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:03:09,287 INFO L82 PathProgramCache]: Analyzing trace with hash -2016304183, now seen corresponding path program 1 times [2021-03-26 00:03:09,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:03:09,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959423070] [2021-03-26 00:03:09,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:03:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:03:09,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:09,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:09,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:09,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:09,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:09,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:09,366 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-26 00:03:09,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:03:09,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:09,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:09,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:09,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:03:09,378 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:03:09,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959423070] [2021-03-26 00:03:09,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:03:09,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:03:09,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238154079] [2021-03-26 00:03:09,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:03:09,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:03:09,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:03:09,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:03:09,380 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 212 [2021-03-26 00:03:09,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 175 transitions, 2205 flow. Second operand has 7 states, 7 states have (on average 175.85714285714286) internal successors, (1231), 7 states have internal predecessors, (1231), 0 states have call successors, (0), 0 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:03:09,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:03:09,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 212 [2021-03-26 00:03:09,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:03:11,212 INFO L129 PetriNetUnfolder]: 6591/13070 cut-off events. [2021-03-26 00:03:11,212 INFO L130 PetriNetUnfolder]: For 92154/113179 co-relation queries the response was YES. [2021-03-26 00:03:11,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65504 conditions, 13070 events. 6591/13070 cut-off events. For 92154/113179 co-relation queries the response was YES. Maximal size of possible extension queue 1793. Compared 133743 event pairs, 236 based on Foata normal form. 4163/15658 useless extension candidates. Maximal degree in co-relation 65458. Up to 6940 conditions per place. [2021-03-26 00:03:11,434 INFO L132 encePairwiseOnDemand]: 204/212 looper letters, 6 selfloop transitions, 28 changer transitions 6/183 dead transitions. [2021-03-26 00:03:11,435 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 183 transitions, 2307 flow [2021-03-26 00:03:11,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 00:03:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 00:03:11,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1792 transitions. [2021-03-26 00:03:11,438 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8452830188679246 [2021-03-26 00:03:11,438 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1792 transitions. [2021-03-26 00:03:11,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1792 transitions. [2021-03-26 00:03:11,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:03:11,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1792 transitions. [2021-03-26 00:03:11,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 179.2) internal successors, (1792), 10 states have internal predecessors, (1792), 0 states have call successors, (0), 0 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:03:11,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 212.0) internal successors, (2332), 11 states have internal predecessors, (2332), 0 states have call successors, (0), 0 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:03:11,445 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 212.0) internal successors, (2332), 11 states have internal predecessors, (2332), 0 states have call successors, (0), 0 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:03:11,445 INFO L185 Difference]: Start difference. First operand has 102 places, 175 transitions, 2205 flow. Second operand 10 states and 1792 transitions. [2021-03-26 00:03:11,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 183 transitions, 2307 flow [2021-03-26 00:03:13,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 183 transitions, 2215 flow, removed 30 selfloop flow, removed 5 redundant places. [2021-03-26 00:03:13,468 INFO L241 Difference]: Finished difference. Result has 109 places, 174 transitions, 2145 flow [2021-03-26 00:03:13,468 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=2079, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2145, PETRI_PLACES=109, PETRI_TRANSITIONS=174} [2021-03-26 00:03:13,469 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 47 predicate places. [2021-03-26 00:03:13,469 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:03:13,469 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 174 transitions, 2145 flow [2021-03-26 00:03:13,469 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 174 transitions, 2145 flow [2021-03-26 00:03:13,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 174 transitions, 2145 flow [2021-03-26 00:03:14,055 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][90], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, Black: 324#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 318#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 260#(not (= 4 ~__unbuffered_cnt~0)), Black: 261#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 263#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 275#(not (= ~__unbuffered_p0_EAX~0 0)), 87#L878-1true, 25#L847true, Black: 274#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd2~0 0) (= ~__unbuffered_p0_EAX~0 ~a~0) (not (= ~a~0 ~a$w_buff1~0)) (= ~a$r_buff0_thd2~0 0)), 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 276#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 278#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 280#(and (= ~x~0 1) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 268#true, Black: 270#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0)), Black: 271#(and (= ~x~0 1) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0)), Black: 155#true, 296#true, 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 305#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 52#P2EXITtrue, Black: 300#(not (= 4 ~__unbuffered_cnt~0)), Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 180#(= ~y~0 1), Black: 301#(= ULTIMATE.start_assume_abort_if_not_~cond 0), 58#P0EXITtrue, 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 317#(not (= 4 ~__unbuffered_cnt~0)), Black: 246#true, 126#P1EXITtrue, Black: 248#(= ~z~0 1), Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:03:14,055 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 00:03:14,055 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 00:03:14,055 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 00:03:14,055 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 00:03:14,180 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][11], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 324#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 317#(not (= 4 ~__unbuffered_cnt~0)), Black: 318#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 260#(not (= 4 ~__unbuffered_cnt~0)), Black: 261#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 263#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 83#L3true, 275#(not (= ~__unbuffered_p0_EAX~0 0)), 25#L847true, Black: 274#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd2~0 0) (= ~__unbuffered_p0_EAX~0 ~a~0) (not (= ~a~0 ~a$w_buff1~0)) (= ~a$r_buff0_thd2~0 0)), 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 276#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 278#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 280#(and (= ~x~0 1) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 268#true, Black: 270#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0)), Black: 271#(and (= ~x~0 1) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0)), Black: 155#true, 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 301#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 305#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 52#P2EXITtrue, Black: 300#(not (= 4 ~__unbuffered_cnt~0)), Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 180#(= ~y~0 1), 58#P0EXITtrue, 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 246#true, Black: 248#(= ~z~0 1), 126#P1EXITtrue, Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:03:14,180 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2021-03-26 00:03:14,180 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 00:03:14,180 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 00:03:14,180 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 00:03:14,183 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][11], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 324#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), P2Thread1of1ForFork3InUse, 261#(= ULTIMATE.start_assume_abort_if_not_~cond 0), P0Thread1of1ForFork1InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 317#(not (= 4 ~__unbuffered_cnt~0)), Black: 318#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 260#(not (= 4 ~__unbuffered_cnt~0)), Black: 263#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 83#L3true, 275#(not (= ~__unbuffered_p0_EAX~0 0)), 25#L847true, Black: 274#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd2~0 0) (= ~__unbuffered_p0_EAX~0 ~a~0) (not (= ~a~0 ~a$w_buff1~0)) (= ~a$r_buff0_thd2~0 0)), 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 276#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 278#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 280#(and (= ~x~0 1) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 268#true, Black: 270#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0)), Black: 271#(and (= ~x~0 1) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0)), Black: 155#true, 233#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 301#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 227#(and (= ~x~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 228#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 230#(and (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 235#(and (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 305#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (not (= 4 ~__unbuffered_cnt~0))), 52#P2EXITtrue, Black: 237#(and (= ~a$w_buff0_used~0 ~__unbuffered_p0_EAX~0) (= ~a$w_buff0_used~0 ~x~0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd2~0 0)), 180#(= ~y~0 1), Black: 300#(not (= 4 ~__unbuffered_cnt~0)), 58#P0EXITtrue, 251#(and (= ~z~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 246#true, Black: 248#(= ~z~0 1), 126#P1EXITtrue, Black: 249#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))]) [2021-03-26 00:03:14,183 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2021-03-26 00:03:14,183 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 00:03:14,183 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 00:03:14,183 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 00:03:14,195 INFO L129 PetriNetUnfolder]: 4012/9156 cut-off events. [2021-03-26 00:03:14,195 INFO L130 PetriNetUnfolder]: For 37511/39534 co-relation queries the response was YES. [2021-03-26 00:03:14,244 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41529 conditions, 9156 events. 4012/9156 cut-off events. For 37511/39534 co-relation queries the response was YES. Maximal size of possible extension queue 1247. Compared 99198 event pairs, 234 based on Foata normal form. 490/9129 useless extension candidates. Maximal degree in co-relation 41483. Up to 2252 conditions per place. [2021-03-26 00:03:14,323 INFO L142 LiptonReduction]: Number of co-enabled transitions 3864 [2021-03-26 00:03:23,328 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 00:03:23,457 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 00:03:31,651 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:03:31,805 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:03:43,476 INFO L154 LiptonReduction]: Checked pairs total: 6029 [2021-03-26 00:03:43,476 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 00:03:43,476 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30007 [2021-03-26 00:03:43,477 INFO L480 AbstractCegarLoop]: Abstraction has has 106 places, 169 transitions, 2113 flow [2021-03-26 00:03:43,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 175.85714285714286) internal successors, (1231), 7 states have internal predecessors, (1231), 0 states have call successors, (0), 0 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:03:43,477 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:03:43,477 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] [2021-03-26 00:03:43,478 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:03:43,478 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:03:43,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:03:43,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1660951316, now seen corresponding path program 1 times [2021-03-26 00:03:43,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:03:43,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685219340] [2021-03-26 00:03:43,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:03:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:03:43,546 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:03:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:03:43,594 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:03:43,636 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:03:43,637 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:03:43,638 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:03:43,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:03:43 BasicIcfg [2021-03-26 00:03:43,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:03:43,751 INFO L168 Benchmark]: Toolchain (without parser) took 157066.36 ms. Allocated memory was 255.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 235.1 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.0 GB. [2021-03-26 00:03:43,752 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 255.9 MB. Free memory is still 237.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:03:43,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 551.92 ms. Allocated memory was 255.9 MB in the beginning and 377.5 MB in the end (delta: 121.6 MB). Free memory was 234.7 MB in the beginning and 337.6 MB in the end (delta: -102.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:03:43,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.35 ms. Allocated memory is still 377.5 MB. Free memory was 337.6 MB in the beginning and 334.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:03:43,752 INFO L168 Benchmark]: Boogie Preprocessor took 26.55 ms. Allocated memory is still 377.5 MB. Free memory was 334.9 MB in the beginning and 332.3 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:03:43,753 INFO L168 Benchmark]: RCFGBuilder took 1772.04 ms. Allocated memory is still 377.5 MB. Free memory was 332.3 MB in the beginning and 293.2 MB in the end (delta: 39.0 MB). Peak memory consumption was 63.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:03:43,753 INFO L168 Benchmark]: TraceAbstraction took 154638.41 ms. Allocated memory was 377.5 MB in the beginning and 2.5 GB in the end (delta: 2.1 GB). Free memory was 293.2 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.0 GB. [2021-03-26 00:03:43,754 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.43 ms. Allocated memory is still 255.9 MB. Free memory is still 237.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 551.92 ms. Allocated memory was 255.9 MB in the beginning and 377.5 MB in the end (delta: 121.6 MB). Free memory was 234.7 MB in the beginning and 337.6 MB in the end (delta: -102.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 71.35 ms. Allocated memory is still 377.5 MB. Free memory was 337.6 MB in the beginning and 334.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 26.55 ms. Allocated memory is still 377.5 MB. Free memory was 334.9 MB in the beginning and 332.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1772.04 ms. Allocated memory is still 377.5 MB. Free memory was 332.3 MB in the beginning and 293.2 MB in the end (delta: 39.0 MB). Peak memory consumption was 63.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 154638.41 ms. Allocated memory was 377.5 MB in the beginning and 2.5 GB in the end (delta: 2.1 GB). Free memory was 293.2 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3508.1ms, 127 PlacesBefore, 62 PlacesAfterwards, 116 TransitionsBefore, 50 TransitionsAfterwards, 2886 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 5647 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2332, positive: 2210, positive conditional: 2210, positive unconditional: 0, negative: 122, negative conditional: 122, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1787, positive: 1737, positive conditional: 0, positive unconditional: 1737, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1787, positive: 1737, positive conditional: 0, positive unconditional: 1737, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1787, positive: 1724, positive conditional: 0, positive unconditional: 1724, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 633, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2332, positive: 473, positive conditional: 473, positive unconditional: 0, negative: 72, negative conditional: 72, negative unconditional: 0, unknown: 1787, unknown conditional: 1787, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 86, Positive conditional cache size: 86, Positive unconditional cache size: 0, Negative cache size: 25, Negative conditional cache size: 25, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1303.4ms, 58 PlacesBefore, 46 PlacesAfterwards, 47 TransitionsBefore, 35 TransitionsAfterwards, 702 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 3042 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 656, positive: 524, positive conditional: 524, positive unconditional: 0, negative: 132, negative conditional: 132, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 180, positive: 152, positive conditional: 15, positive unconditional: 137, negative: 28, negative conditional: 1, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 180, positive: 152, positive conditional: 15, positive unconditional: 137, negative: 28, negative conditional: 1, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 180, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 28, negative conditional: 1, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 454, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 434, negative conditional: 46, negative unconditional: 388, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 656, positive: 372, positive conditional: 372, positive unconditional: 0, negative: 104, negative conditional: 104, negative unconditional: 0, unknown: 180, unknown conditional: 180, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 133, Positive conditional cache size: 133, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 902.4ms, 55 PlacesBefore, 48 PlacesAfterwards, 40 TransitionsBefore, 37 TransitionsAfterwards, 566 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1206 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 202, positive: 151, positive conditional: 151, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 17, positive conditional: 1, positive unconditional: 16, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, positive: 17, positive conditional: 1, positive unconditional: 16, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 148, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 202, positive: 134, positive conditional: 134, positive unconditional: 0, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 150, Positive conditional cache size: 150, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1404.2ms, 48 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 566 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 906 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 145, positive: 107, positive conditional: 107, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 8, negative conditional: 2, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 8, negative conditional: 2, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 2, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 213, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 213, negative conditional: 92, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 145, positive: 91, positive conditional: 91, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 166, Positive conditional cache size: 166, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 62.1ms, 50 PlacesBefore, 49 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 566 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 340 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 67, positive: 53, positive conditional: 53, 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: 13, positive: 13, positive conditional: 5, positive unconditional: 8, 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: 13, positive: 13, positive conditional: 5, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 179, Positive conditional cache size: 179, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 707.7ms, 54 PlacesBefore, 54 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 838 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 807 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 126, positive: 100, positive conditional: 100, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 22, positive unconditional: 9, 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: 31, positive: 31, positive conditional: 22, positive unconditional: 9, 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: 31, positive: 31, positive conditional: 0, positive unconditional: 31, 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: 126, positive: 69, positive conditional: 69, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 163, Positive conditional cache size: 163, Positive unconditional cache size: 0, Negative cache size: 41, Negative conditional cache size: 41, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9549.3ms, 64 PlacesBefore, 64 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 1410 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 270 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 55, negative conditional: 5, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 164, Positive conditional cache size: 164, Positive unconditional cache size: 0, Negative cache size: 44, Negative conditional cache size: 44, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29150.5ms, 71 PlacesBefore, 71 PlacesAfterwards, 118 TransitionsBefore, 118 TransitionsAfterwards, 1934 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 624 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 8, 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: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 164, Positive conditional cache size: 164, Positive unconditional cache size: 0, Negative cache size: 44, Negative conditional cache size: 44, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8414.3ms, 79 PlacesBefore, 79 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 2702 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 765 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 9, 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: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 164, Positive conditional cache size: 164, Positive unconditional cache size: 0, Negative cache size: 44, Negative conditional cache size: 44, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28620.2ms, 96 PlacesBefore, 96 PlacesAfterwards, 168 TransitionsBefore, 168 TransitionsAfterwards, 3642 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1890 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 98, negative conditional: 98, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 164, Positive conditional cache size: 164, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22189.8ms, 102 PlacesBefore, 102 PlacesAfterwards, 175 TransitionsBefore, 175 TransitionsAfterwards, 3946 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 4671 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 44, negative conditional: 44, 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: 2, positive unconditional: 5, 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: 2, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 51, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 169, Positive conditional cache size: 169, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30007.1ms, 109 PlacesBefore, 106 PlacesAfterwards, 174 TransitionsBefore, 169 TransitionsAfterwards, 3864 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 6029 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 329, positive: 272, positive conditional: 272, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 272, positive: 272, positive conditional: 272, 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: 272, positive: 272, positive conditional: 272, 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: 272, positive: 272, positive conditional: 0, positive unconditional: 272, 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: 329, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 272, unknown conditional: 272, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 152, Positive conditional cache size: 152, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t201; [L872] FCALL, FORK 0 pthread_create(&t201, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t202; [L874] FCALL, FORK 0 pthread_create(&t202, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L875] 0 pthread_t t203; [L876] FCALL, FORK 0 pthread_create(&t203, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L877] 0 pthread_t t204; [L878] FCALL, FORK 0 pthread_create(&t204, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 154365.4ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 16857.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3622.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 143 SDtfs, 176 SDslu, 226 SDs, 0 SdLazy, 638 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 644.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 446.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2205occurred in iteration=10, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 35.1ms SsaConstructionTime, 418.7ms SatisfiabilityAnalysisTime, 800.0ms InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 1346 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...