/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-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:47:03,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:47:03,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:47:03,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:47:03,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:47:03,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:47:03,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:47:03,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:47:03,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:47:03,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:47:03,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:47:03,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:47:03,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:47:03,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:47:03,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:47:03,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:47:03,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:47:03,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:47:03,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:47:03,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:47:03,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:47:03,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:47:03,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:47:03,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:47:03,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:47:03,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:47:03,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:47:03,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:47:03,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:47:03,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:47:03,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:47:03,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:47:03,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:47:03,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:47:03,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:47:03,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:47:03,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:47:03,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:47:03,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:47:03,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:47:03,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:47:03,725 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-RepeatedVariableLbe.epf [2021-03-25 04:47:03,743 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:47:03,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:47:03,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:47:03,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:47:03,745 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:47:03,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:47:03,745 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:47:03,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:47:03,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:47:03,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:47:03,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:47:03,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:47:03,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:47:03,746 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:47:03,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:47:03,746 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:47:03,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:47:03,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:47:03,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:47:03,747 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:47:03,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:47:03,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:47:03,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:47:03,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:47:03,747 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:47:03,748 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:47:03,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:47:03,748 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:47:03,748 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:47:03,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:47:03,748 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-25 04:47:04,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:47:04,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:47:04,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:47:04,077 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:47:04,078 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:47:04,079 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i [2021-03-25 04:47:04,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1516d511/cdd01a93fac04d518e189a411a104ad9/FLAG225800953 [2021-03-25 04:47:04,645 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:47:04,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i [2021-03-25 04:47:04,667 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1516d511/cdd01a93fac04d518e189a411a104ad9/FLAG225800953 [2021-03-25 04:47:04,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1516d511/cdd01a93fac04d518e189a411a104ad9 [2021-03-25 04:47:04,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:47:04,978 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:47:04,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:47:04,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:47:04,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:47:04,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:47:04" (1/1) ... [2021-03-25 04:47:04,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34763996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:04, skipping insertion in model container [2021-03-25 04:47:04,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:47:04" (1/1) ... [2021-03-25 04:47:04,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:47:05,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:47:05,206 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/mix047_power.opt.i[950,963] [2021-03-25 04:47:05,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:47:05,389 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:47:05,402 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/mix047_power.opt.i[950,963] [2021-03-25 04:47:05,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:47:05,500 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:47:05,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:05 WrapperNode [2021-03-25 04:47:05,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:47:05,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:47:05,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:47:05,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:47:05,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:05" (1/1) ... [2021-03-25 04:47:05,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:05" (1/1) ... [2021-03-25 04:47:05,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:47:05,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:47:05,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:47:05,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:47:05,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:05" (1/1) ... [2021-03-25 04:47:05,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:05" (1/1) ... [2021-03-25 04:47:05,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:05" (1/1) ... [2021-03-25 04:47:05,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:05" (1/1) ... [2021-03-25 04:47:05,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:05" (1/1) ... [2021-03-25 04:47:05,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:05" (1/1) ... [2021-03-25 04:47:05,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:05" (1/1) ... [2021-03-25 04:47:05,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:47:05,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:47:05,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:47:05,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:47:05,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:05" (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-25 04:47:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:47:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:47:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:47:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:47:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:47:05,661 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:47:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:47:05,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:47:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:47:05,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:47:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 04:47:05,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 04:47:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:47:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:47:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:47:05,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:47:05,664 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:47:07,257 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:47:07,257 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:47:07,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:47:07 BoogieIcfgContainer [2021-03-25 04:47:07,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:47:07,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:47:07,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:47:07,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:47:07,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:47:04" (1/3) ... [2021-03-25 04:47:07,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c246264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:47:07, skipping insertion in model container [2021-03-25 04:47:07,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:05" (2/3) ... [2021-03-25 04:47:07,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c246264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:47:07, skipping insertion in model container [2021-03-25 04:47:07,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:47:07" (3/3) ... [2021-03-25 04:47:07,265 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_power.opt.i [2021-03-25 04:47:07,270 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:47:07,274 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:47:07,275 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:47:07,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,303 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,303 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,303 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,303 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,305 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,305 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,305 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,305 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,306 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,306 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,306 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,306 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,307 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,307 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,310 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,310 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,310 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,310 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,311 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,311 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,311 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,311 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,316 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,316 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,318 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,318 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,319 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,319 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,321 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,322 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,323 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:07,324 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:47:07,339 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 04:47:07,356 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:47:07,357 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:47:07,357 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:47:07,357 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:47:07,357 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:47:07,357 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:47:07,357 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:47:07,357 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:47:07,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 252 flow [2021-03-25 04:47:07,403 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-03-25 04:47:07,404 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:47:07,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 04:47:07,408 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 116 transitions, 252 flow [2021-03-25 04:47:07,413 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 112 transitions, 236 flow [2021-03-25 04:47:07,414 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:07,421 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 236 flow [2021-03-25 04:47:07,424 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 236 flow [2021-03-25 04:47:07,425 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 236 flow [2021-03-25 04:47:07,445 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-03-25 04:47:07,445 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:47:07,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 04:47:07,448 INFO L142 LiptonReduction]: Number of co-enabled transitions 2598 [2021-03-25 04:47:08,952 WARN L205 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-25 04:47:09,505 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-03-25 04:47:10,837 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 314 DAG size of output: 269 [2021-03-25 04:47:11,402 WARN L205 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 04:47:11,724 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:47:12,182 WARN L205 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 04:47:12,293 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 04:47:13,225 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 04:47:13,487 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 04:47:14,050 WARN L205 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 04:47:14,653 WARN L205 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 04:47:15,231 INFO L154 LiptonReduction]: Checked pairs total: 4306 [2021-03-25 04:47:15,231 INFO L156 LiptonReduction]: Total number of compositions: 75 [2021-03-25 04:47:15,234 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7821 [2021-03-25 04:47:15,242 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-03-25 04:47:15,242 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:47:15,242 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:15,243 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-25 04:47:15,243 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:15,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:15,248 INFO L82 PathProgramCache]: Analyzing trace with hash 316096465, now seen corresponding path program 1 times [2021-03-25 04:47:15,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:15,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849688721] [2021-03-25 04:47:15,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:15,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:15,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:47:15,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:15,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:15,481 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-25 04:47:15,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849688721] [2021-03-25 04:47:15,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:15,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:47:15,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480829747] [2021-03-25 04:47:15,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:47:15,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:15,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:47:15,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:47:15,502 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 191 [2021-03-25 04:47:15,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 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-25 04:47:15,505 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:15,505 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 191 [2021-03-25 04:47:15,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:15,563 INFO L129 PetriNetUnfolder]: 23/109 cut-off events. [2021-03-25 04:47:15,563 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:47:15,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 109 events. 23/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 410 event pairs, 3 based on Foata normal form. 6/108 useless extension candidates. Maximal degree in co-relation 150. Up to 37 conditions per place. [2021-03-25 04:47:15,565 INFO L132 encePairwiseOnDemand]: 187/191 looper letters, 7 selfloop transitions, 2 changer transitions 6/46 dead transitions. [2021-03-25 04:47:15,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 126 flow [2021-03-25 04:47:15,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:47:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:47:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2021-03-25 04:47:15,584 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9092495636998255 [2021-03-25 04:47:15,585 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 521 transitions. [2021-03-25 04:47:15,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions. [2021-03-25 04:47:15,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:15,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions. [2021-03-25 04:47:15,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-25 04:47:15,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 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-25 04:47:15,604 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 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-25 04:47:15,606 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 521 transitions. [2021-03-25 04:47:15,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 126 flow [2021-03-25 04:47:15,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 46 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 04:47:15,610 INFO L241 Difference]: Finished difference. Result has 53 places, 37 transitions, 86 flow [2021-03-25 04:47:15,612 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2021-03-25 04:47:15,613 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-25 04:47:15,613 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:15,613 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 37 transitions, 86 flow [2021-03-25 04:47:15,614 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 37 transitions, 86 flow [2021-03-25 04:47:15,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 37 transitions, 86 flow [2021-03-25 04:47:15,623 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-25 04:47:15,623 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:47:15,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:47:15,624 INFO L142 LiptonReduction]: Number of co-enabled transitions 392 [2021-03-25 04:47:16,053 WARN L205 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 04:47:16,352 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 04:47:16,949 WARN L205 SmtUtils]: Spent 593.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 04:47:17,527 WARN L205 SmtUtils]: Spent 576.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 04:47:18,755 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 04:47:18,901 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 04:47:19,229 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 04:47:19,394 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 04:47:19,399 INFO L154 LiptonReduction]: Checked pairs total: 2232 [2021-03-25 04:47:19,399 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-25 04:47:19,399 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3786 [2021-03-25 04:47:19,400 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2021-03-25 04:47:19,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 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-25 04:47:19,400 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:19,400 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-25 04:47:19,401 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:47:19,401 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:19,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:19,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2031321782, now seen corresponding path program 1 times [2021-03-25 04:47:19,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:19,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780455603] [2021-03-25 04:47:19,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:19,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:19,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:19,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:19,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:47:19,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780455603] [2021-03-25 04:47:19,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:19,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:47:19,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239423099] [2021-03-25 04:47:19,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:47:19,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:19,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:47:19,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:47:19,559 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 201 [2021-03-25 04:47:19,560 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 0 states have call successors, (0), 0 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-25 04:47:19,560 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:19,560 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 201 [2021-03-25 04:47:19,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:19,585 INFO L129 PetriNetUnfolder]: 3/39 cut-off events. [2021-03-25 04:47:19,586 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:47:19,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 39 events. 3/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 82 event pairs, 1 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2021-03-25 04:47:19,586 INFO L132 encePairwiseOnDemand]: 197/201 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-25 04:47:19,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 82 flow [2021-03-25 04:47:19,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:47:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:47:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2021-03-25 04:47:19,589 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8772802653399668 [2021-03-25 04:47:19,589 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 529 transitions. [2021-03-25 04:47:19,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 529 transitions. [2021-03-25 04:47:19,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:19,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 529 transitions. [2021-03-25 04:47:19,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 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-25 04:47:19,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:19,593 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:19,593 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 529 transitions. [2021-03-25 04:47:19,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 82 flow [2021-03-25 04:47:19,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:47:19,594 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 81 flow [2021-03-25 04:47:19,594 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-25 04:47:19,595 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -18 predicate places. [2021-03-25 04:47:19,595 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:19,595 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-25 04:47:19,595 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-25 04:47:19,596 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 81 flow [2021-03-25 04:47:19,600 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-25 04:47:19,600 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:47:19,600 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 35 events. 3/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-25 04:47:19,601 INFO L142 LiptonReduction]: Number of co-enabled transitions 408 [2021-03-25 04:47:19,603 INFO L154 LiptonReduction]: Checked pairs total: 397 [2021-03-25 04:47:19,603 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:19,603 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-03-25 04:47:19,604 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 81 flow [2021-03-25 04:47:19,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 0 states have call successors, (0), 0 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-25 04:47:19,604 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:19,605 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:19,605 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:47:19,605 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:19,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:19,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1632435728, now seen corresponding path program 1 times [2021-03-25 04:47:19,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:19,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229056184] [2021-03-25 04:47:19,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:19,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:19,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:19,695 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-25 04:47:19,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229056184] [2021-03-25 04:47:19,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:19,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:47:19,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617678495] [2021-03-25 04:47:19,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:47:19,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:19,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:47:19,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:47:19,698 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 201 [2021-03-25 04:47:19,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:19,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:19,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 201 [2021-03-25 04:47:19,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:19,713 INFO L129 PetriNetUnfolder]: 3/39 cut-off events. [2021-03-25 04:47:19,714 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-25 04:47:19,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 39 events. 3/39 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 1 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 58. Up to 10 conditions per place. [2021-03-25 04:47:19,715 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 1 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2021-03-25 04:47:19,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 87 flow [2021-03-25 04:47:19,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:47:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:47:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2021-03-25 04:47:19,718 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8971807628524047 [2021-03-25 04:47:19,718 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2021-03-25 04:47:19,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2021-03-25 04:47:19,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:19,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2021-03-25 04:47:19,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 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-25 04:47:19,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:19,721 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:19,721 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 81 flow. Second operand 3 states and 541 transitions. [2021-03-25 04:47:19,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 87 flow [2021-03-25 04:47:19,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 84 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:47:19,723 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 86 flow [2021-03-25 04:47:19,723 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2021-03-25 04:47:19,723 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -16 predicate places. [2021-03-25 04:47:19,723 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:19,723 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 86 flow [2021-03-25 04:47:19,724 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 29 transitions, 86 flow [2021-03-25 04:47:19,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 86 flow [2021-03-25 04:47:19,728 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-25 04:47:19,729 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 04:47:19,729 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 35 events. 3/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 77 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2021-03-25 04:47:19,729 INFO L142 LiptonReduction]: Number of co-enabled transitions 404 [2021-03-25 04:47:19,881 INFO L154 LiptonReduction]: Checked pairs total: 698 [2021-03-25 04:47:19,881 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:47:19,881 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 158 [2021-03-25 04:47:19,882 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 84 flow [2021-03-25 04:47:19,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:19,883 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:19,883 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:19,883 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:47:19,883 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:19,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:19,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1932846463, now seen corresponding path program 1 times [2021-03-25 04:47:19,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:19,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019687606] [2021-03-25 04:47:19,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:19,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:19,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:20,001 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-25 04:47:20,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019687606] [2021-03-25 04:47:20,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:20,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:47:20,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771380827] [2021-03-25 04:47:20,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:47:20,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:20,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:47:20,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:47:20,003 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 202 [2021-03-25 04:47:20,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:20,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:20,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 202 [2021-03-25 04:47:20,004 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:20,028 INFO L129 PetriNetUnfolder]: 10/59 cut-off events. [2021-03-25 04:47:20,028 INFO L130 PetriNetUnfolder]: For 24/33 co-relation queries the response was YES. [2021-03-25 04:47:20,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 59 events. 10/59 cut-off events. For 24/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 174 event pairs, 3 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 104. Up to 19 conditions per place. [2021-03-25 04:47:20,029 INFO L132 encePairwiseOnDemand]: 198/202 looper letters, 3 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-03-25 04:47:20,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 100 flow [2021-03-25 04:47:20,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:47:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:47:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2021-03-25 04:47:20,031 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8976897689768977 [2021-03-25 04:47:20,032 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 544 transitions. [2021-03-25 04:47:20,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 544 transitions. [2021-03-25 04:47:20,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:20,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 544 transitions. [2021-03-25 04:47:20,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 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-25 04:47:20,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 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-25 04:47:20,035 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 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-25 04:47:20,035 INFO L185 Difference]: Start difference. First operand has 40 places, 28 transitions, 84 flow. Second operand 3 states and 544 transitions. [2021-03-25 04:47:20,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 100 flow [2021-03-25 04:47:20,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:47:20,037 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 99 flow [2021-03-25 04:47:20,037 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2021-03-25 04:47:20,037 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -16 predicate places. [2021-03-25 04:47:20,037 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:20,038 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 99 flow [2021-03-25 04:47:20,038 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 99 flow [2021-03-25 04:47:20,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 99 flow [2021-03-25 04:47:20,044 INFO L129 PetriNetUnfolder]: 7/46 cut-off events. [2021-03-25 04:47:20,044 INFO L130 PetriNetUnfolder]: For 21/23 co-relation queries the response was YES. [2021-03-25 04:47:20,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 46 events. 7/46 cut-off events. For 21/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 3 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 87. Up to 15 conditions per place. [2021-03-25 04:47:20,045 INFO L142 LiptonReduction]: Number of co-enabled transitions 428 [2021-03-25 04:47:20,047 INFO L154 LiptonReduction]: Checked pairs total: 257 [2021-03-25 04:47:20,047 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:20,047 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-25 04:47:20,048 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 99 flow [2021-03-25 04:47:20,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:20,049 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:20,049 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:20,049 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:47:20,049 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:20,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:20,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1669921867, now seen corresponding path program 1 times [2021-03-25 04:47:20,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:20,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057166880] [2021-03-25 04:47:20,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:20,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:20,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:47:20,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:20,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 04:47:20,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:20,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 04:47:20,154 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-25 04:47:20,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057166880] [2021-03-25 04:47:20,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:20,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:47:20,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465734] [2021-03-25 04:47:20,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:47:20,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:20,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:47:20,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:47:20,157 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 202 [2021-03-25 04:47:20,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 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-25 04:47:20,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:20,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 202 [2021-03-25 04:47:20,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:20,269 INFO L129 PetriNetUnfolder]: 121/259 cut-off events. [2021-03-25 04:47:20,269 INFO L130 PetriNetUnfolder]: For 209/236 co-relation queries the response was YES. [2021-03-25 04:47:20,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 259 events. 121/259 cut-off events. For 209/236 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1256 event pairs, 57 based on Foata normal form. 7/233 useless extension candidates. Maximal degree in co-relation 592. Up to 156 conditions per place. [2021-03-25 04:47:20,274 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 8 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2021-03-25 04:47:20,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 150 flow [2021-03-25 04:47:20,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:47:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:47:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 833 transitions. [2021-03-25 04:47:20,277 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8247524752475247 [2021-03-25 04:47:20,277 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 833 transitions. [2021-03-25 04:47:20,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 833 transitions. [2021-03-25 04:47:20,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:20,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 833 transitions. [2021-03-25 04:47:20,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 0 states have call successors, (0), 0 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-25 04:47:20,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 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-25 04:47:20,283 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 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-25 04:47:20,283 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 99 flow. Second operand 5 states and 833 transitions. [2021-03-25 04:47:20,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 150 flow [2021-03-25 04:47:20,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 147 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:47:20,286 INFO L241 Difference]: Finished difference. Result has 47 places, 37 transitions, 151 flow [2021-03-25 04:47:20,286 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2021-03-25 04:47:20,286 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -10 predicate places. [2021-03-25 04:47:20,286 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:20,286 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 37 transitions, 151 flow [2021-03-25 04:47:20,287 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 151 flow [2021-03-25 04:47:20,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 151 flow [2021-03-25 04:47:20,311 INFO L129 PetriNetUnfolder]: 38/126 cut-off events. [2021-03-25 04:47:20,312 INFO L130 PetriNetUnfolder]: For 334/349 co-relation queries the response was YES. [2021-03-25 04:47:20,312 INFO L84 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 126 events. 38/126 cut-off events. For 334/349 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 602 event pairs, 16 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 366. Up to 51 conditions per place. [2021-03-25 04:47:20,314 INFO L142 LiptonReduction]: Number of co-enabled transitions 588 [2021-03-25 04:47:20,318 INFO L154 LiptonReduction]: Checked pairs total: 192 [2021-03-25 04:47:20,318 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:20,318 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-03-25 04:47:20,322 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 151 flow [2021-03-25 04:47:20,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 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-25 04:47:20,322 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:20,323 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:20,323 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:47:20,323 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:20,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:20,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1656169957, now seen corresponding path program 2 times [2021-03-25 04:47:20,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:20,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506178253] [2021-03-25 04:47:20,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:20,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:20,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:47:20,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:20,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:20,412 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-25 04:47:20,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506178253] [2021-03-25 04:47:20,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:20,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:47:20,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401555837] [2021-03-25 04:47:20,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:47:20,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:20,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:47:20,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:47:20,415 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 202 [2021-03-25 04:47:20,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 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-25 04:47:20,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:20,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 202 [2021-03-25 04:47:20,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:20,449 INFO L129 PetriNetUnfolder]: 34/159 cut-off events. [2021-03-25 04:47:20,449 INFO L130 PetriNetUnfolder]: For 672/897 co-relation queries the response was YES. [2021-03-25 04:47:20,450 INFO L84 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 159 events. 34/159 cut-off events. For 672/897 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 920 event pairs, 10 based on Foata normal form. 8/142 useless extension candidates. Maximal degree in co-relation 432. Up to 40 conditions per place. [2021-03-25 04:47:20,451 INFO L132 encePairwiseOnDemand]: 199/202 looper letters, 3 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2021-03-25 04:47:20,451 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 37 transitions, 163 flow [2021-03-25 04:47:20,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:47:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:47:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2021-03-25 04:47:20,453 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8960396039603961 [2021-03-25 04:47:20,453 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 543 transitions. [2021-03-25 04:47:20,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 543 transitions. [2021-03-25 04:47:20,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:20,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 543 transitions. [2021-03-25 04:47:20,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 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-25 04:47:20,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 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-25 04:47:20,457 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 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-25 04:47:20,457 INFO L185 Difference]: Start difference. First operand has 47 places, 37 transitions, 151 flow. Second operand 3 states and 543 transitions. [2021-03-25 04:47:20,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 37 transitions, 163 flow [2021-03-25 04:47:20,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 37 transitions, 163 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:47:20,462 INFO L241 Difference]: Finished difference. Result has 50 places, 37 transitions, 162 flow [2021-03-25 04:47:20,462 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=162, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2021-03-25 04:47:20,462 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -7 predicate places. [2021-03-25 04:47:20,462 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:20,462 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 37 transitions, 162 flow [2021-03-25 04:47:20,463 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 37 transitions, 162 flow [2021-03-25 04:47:20,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 37 transitions, 162 flow [2021-03-25 04:47:20,482 INFO L129 PetriNetUnfolder]: 39/148 cut-off events. [2021-03-25 04:47:20,483 INFO L130 PetriNetUnfolder]: For 525/574 co-relation queries the response was YES. [2021-03-25 04:47:20,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 148 events. 39/148 cut-off events. For 525/574 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 749 event pairs, 15 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 430. Up to 50 conditions per place. [2021-03-25 04:47:20,485 INFO L142 LiptonReduction]: Number of co-enabled transitions 588 [2021-03-25 04:47:20,490 INFO L154 LiptonReduction]: Checked pairs total: 244 [2021-03-25 04:47:20,490 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:20,490 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-25 04:47:20,491 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 162 flow [2021-03-25 04:47:20,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 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-25 04:47:20,492 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:20,492 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:20,492 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:47:20,492 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:20,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:20,493 INFO L82 PathProgramCache]: Analyzing trace with hash -143273012, now seen corresponding path program 1 times [2021-03-25 04:47:20,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:20,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140329592] [2021-03-25 04:47:20,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:20,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:20,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:47:20,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:20,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:20,637 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-25 04:47:20,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 04:47:20,662 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.6 percent of original size [2021-03-25 04:47:20,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 04:47:20,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:20,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:47:20,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:20,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:47:20,711 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-25 04:47:20,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140329592] [2021-03-25 04:47:20,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:20,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:47:20,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413487197] [2021-03-25 04:47:20,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 04:47:20,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:20,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 04:47:20,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-25 04:47:20,716 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 202 [2021-03-25 04:47:20,717 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 162 flow. Second operand has 8 states, 8 states have (on average 155.875) internal successors, (1247), 8 states have internal predecessors, (1247), 0 states have call successors, (0), 0 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-25 04:47:20,717 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:20,717 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 202 [2021-03-25 04:47:20,717 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:20,981 INFO L129 PetriNetUnfolder]: 350/774 cut-off events. [2021-03-25 04:47:20,981 INFO L130 PetriNetUnfolder]: For 1774/1862 co-relation queries the response was YES. [2021-03-25 04:47:20,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2258 conditions, 774 events. 350/774 cut-off events. For 1774/1862 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5042 event pairs, 37 based on Foata normal form. 41/779 useless extension candidates. Maximal degree in co-relation 2239. Up to 219 conditions per place. [2021-03-25 04:47:20,987 INFO L132 encePairwiseOnDemand]: 194/202 looper letters, 38 selfloop transitions, 21 changer transitions 1/79 dead transitions. [2021-03-25 04:47:20,988 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 79 transitions, 472 flow [2021-03-25 04:47:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 04:47:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 04:47:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1281 transitions. [2021-03-25 04:47:20,991 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7926980198019802 [2021-03-25 04:47:20,991 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1281 transitions. [2021-03-25 04:47:20,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1281 transitions. [2021-03-25 04:47:20,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:20,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1281 transitions. [2021-03-25 04:47:20,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 160.125) internal successors, (1281), 8 states have internal predecessors, (1281), 0 states have call successors, (0), 0 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-25 04:47:20,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 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-25 04:47:20,997 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 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-25 04:47:20,997 INFO L185 Difference]: Start difference. First operand has 50 places, 37 transitions, 162 flow. Second operand 8 states and 1281 transitions. [2021-03-25 04:47:20,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 79 transitions, 472 flow [2021-03-25 04:47:21,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 79 transitions, 467 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 04:47:21,001 INFO L241 Difference]: Finished difference. Result has 60 places, 52 transitions, 317 flow [2021-03-25 04:47:21,001 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=317, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2021-03-25 04:47:21,002 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2021-03-25 04:47:21,002 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:21,002 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 52 transitions, 317 flow [2021-03-25 04:47:21,002 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 52 transitions, 317 flow [2021-03-25 04:47:21,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 52 transitions, 317 flow [2021-03-25 04:47:21,038 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L862-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~z$w_buff1_used~0_304 256) 0)) (.cse17 (= (mod v_~z$r_buff1_thd0~0_209 256) 0)) (.cse8 (= (mod v_~z$r_buff0_thd0~0_264 256) 0))) (let ((.cse2 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse9 (not .cse8)) (.cse15 (and .cse8 .cse17)) (.cse19 (= (mod v_~z$w_buff0_used~0_414 256) 0)) (.cse16 (and .cse8 .cse18))) (let ((.cse3 (or .cse15 .cse19 .cse16)) (.cse5 (not .cse19)) (.cse4 (or (not .cse18) .cse9)) (.cse6 (or (not .cse17) .cse9)) (.cse1 (not .cse2))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (let ((.cse0 (= |v_ULTIMATE.start_main_#t~ite31_68| |v_ULTIMATE.start_main_#t~ite31_67|))) (or (and .cse0 (= |v_ULTIMATE.start_main_#t~ite32_59| |v_ULTIMATE.start_main_#t~ite32_60|) .cse1 (= v_~z$w_buff0~0_134 v_~z$w_buff0~0_133)) (and .cse2 (or (and .cse0 .cse3 (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite32_60|)) (and (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite31_68|) (= |v_ULTIMATE.start_main_#t~ite31_68| |v_ULTIMATE.start_main_#t~ite32_60|) .cse4 .cse5 .cse6)) (= v_~z$w_buff0~0_133 |v_ULTIMATE.start_main_#t~ite32_60|)))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_32 (ite (= (ite (not (and (= v_~y~0_35 2) (= v_~x~0_35 2) (= v_~__unbuffered_p3_EAX~0_34 1) (= 0 v_~__unbuffered_p3_EBX~0_32) (= v_~z~0_151 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#t~nondet27_39| v_~weak$$choice0~0_19) (= v_~z$mem_tmp~0_36 v_~z~0_150) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~ite37_88| |v_ULTIMATE.start_main_#t~ite37_87|))) (or (and .cse2 (or (and .cse7 (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite38_84|) .cse3) (and (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite37_88|) (or (and .cse8 (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite37_88|)) (and (= |v_ULTIMATE.start_main_#t~ite37_88| 0) .cse9)) .cse4 .cse5 .cse6)) (= v_~z$w_buff0_used~0_413 |v_ULTIMATE.start_main_#t~ite38_84|)) (and .cse7 (= v_~z$w_buff0_used~0_413 v_~z$w_buff0_used~0_414) .cse1 (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite38_83|)))) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (or (and (= v_~z~0_151 v_~z~0_150) .cse3 (= |v_ULTIMATE.start_main_#t~ite29_62| |v_ULTIMATE.start_main_#t~ite29_61|)) (and (or (and .cse8 (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite29_62|)) (and (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite29_62|) .cse9)) .cse4 (= v_~z~0_151 |v_ULTIMATE.start_main_#t~ite29_62|) .cse5 .cse6)) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite43_76| |v_ULTIMATE.start_main_#t~ite43_75|))) (or (and .cse2 .cse10 (= v_~z$r_buff0_thd0~0_263 |v_ULTIMATE.start_main_#t~ite44_64|) (= v_~z$r_buff0_thd0~0_264 |v_ULTIMATE.start_main_#t~ite44_64|)) (and .cse10 (= |v_ULTIMATE.start_main_#t~ite44_64| |v_ULTIMATE.start_main_#t~ite44_63|) (= v_~z$r_buff0_thd0~0_264 v_~z$r_buff0_thd0~0_263) .cse1))) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~ite34_78| |v_ULTIMATE.start_main_#t~ite34_77|))) (or (and (= |v_ULTIMATE.start_main_#t~ite35_70| |v_ULTIMATE.start_main_#t~ite35_69|) .cse11 (= v_~z$w_buff1~0_126 v_~z$w_buff1~0_127) .cse1) (and .cse2 (or (and (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite35_70|) .cse11 .cse3) (and .cse4 (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite34_78|) .cse5 .cse6 (= |v_ULTIMATE.start_main_#t~ite34_78| |v_ULTIMATE.start_main_#t~ite35_70|))) (= v_~z$w_buff1~0_126 |v_ULTIMATE.start_main_#t~ite35_70|)))) (or (and .cse2 (= v_~z~0_149 v_~z~0_151)) (and (= v_~z$mem_tmp~0_36 v_~z~0_149) .cse1)) (= v_~z$flush_delayed~0_62 0) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite46_82| |v_ULTIMATE.start_main_#t~ite46_81|))) (or (and (= v_~z$r_buff1_thd0~0_209 |v_ULTIMATE.start_main_#t~ite47_74|) .cse12 .cse2 (= v_~z$r_buff1_thd0~0_208 |v_ULTIMATE.start_main_#t~ite47_74|)) (and (= |v_ULTIMATE.start_main_#t~ite47_74| |v_ULTIMATE.start_main_#t~ite47_73|) .cse12 (= v_~z$r_buff1_thd0~0_209 v_~z$r_buff1_thd0~0_208) .cse1))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite40_59| |v_ULTIMATE.start_main_#t~ite40_60|))) (or (and .cse2 (= v_~z$w_buff1_used~0_303 |v_ULTIMATE.start_main_#t~ite41_54|) (let ((.cse13 (= (mod v_~z$w_buff0_used~0_413 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite40_60| |v_ULTIMATE.start_main_#t~ite41_54|) (= |v_ULTIMATE.start_main_#t~ite40_60| 0) .cse4 .cse6 (not .cse13)) (and .cse14 (= v_~z$w_buff1_used~0_304 |v_ULTIMATE.start_main_#t~ite41_54|) (or .cse15 .cse16 .cse13))))) (and (= |v_ULTIMATE.start_main_#t~ite41_54| |v_ULTIMATE.start_main_#t~ite41_53|) (= v_~z$w_buff1_used~0_304 v_~z$w_buff1_used~0_303) .cse14 .cse1))) (= |v_ULTIMATE.start_main_#t~nondet28_45| v_~weak$$choice2~0_84))))) InVars {ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_61|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_81|, ~z$w_buff1~0=v_~z$w_buff1~0_127, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_63|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_264, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_209, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_39|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_45|, ~y~0=v_~y~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_414, ~z$w_buff0~0=v_~z$w_buff0~0_134, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_304, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_69|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_83|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_87|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_67|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_77|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_59|, ~z~0=v_~z~0_150, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_60|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_80|, ~z$w_buff1~0=v_~z$w_buff1~0_126, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_50|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_74|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_48|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_263, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_36|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_208, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_38|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_44|, ~y~0=v_~y~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_413, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_44|, ~z$w_buff0~0=v_~z$w_buff0~0_133, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_303, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_68|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_48|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~z$flush_delayed~0=v_~z$flush_delayed~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_86|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_66|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_58|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_40|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_76|, ~weak$$choice0~0=v_~weak$$choice0~0_19, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_52|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_58|, ~z~0=v_~z~0_149, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~x~0=v_~x~0_35} AuxVars[|v_ULTIMATE.start_main_#t~ite44_64|, |v_ULTIMATE.start_main_#t~ite41_54|, |v_ULTIMATE.start_main_#t~ite43_76|, |v_ULTIMATE.start_main_#t~ite40_60|, |v_ULTIMATE.start_main_#t~ite29_62|, |v_ULTIMATE.start_main_#t~ite31_68|, |v_ULTIMATE.start_main_#t~ite46_82|, |v_ULTIMATE.start_main_#t~ite47_74|, |v_ULTIMATE.start_main_#t~ite32_60|, |v_ULTIMATE.start_main_#t~ite38_84|, |v_ULTIMATE.start_main_#t~ite34_78|, v_~z~0_151, |v_ULTIMATE.start_main_#t~ite35_70|, |v_ULTIMATE.start_main_#t~ite37_88|] AssignedVars[ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet27, ULTIMATE.start_main_#t~nondet28, ULTIMATE.start___VERIFIER_assert_#in~expression, ~z$mem_tmp~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0, ~weak$$choice2~0][35], [32#L754true, P1Thread1of1ForFork1InUse, Black: 156#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 163#(= ~y~0 1), 166#true, 104#L791true, Black: 137#(= ~y~0 0), 48#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 143#(= ~__unbuffered_p3_EAX~0 0), Black: 177#(and (= ~x~0 ~z~0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2)), Black: 170#(and (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2)), Black: 173#(not (= 2 ~x~0)), Black: 175#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0))), Black: 148#(= ~x~0 0), 54#L817true, 151#true, 90#L766true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 153#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 154#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0))]) [2021-03-25 04:47:21,039 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2021-03-25 04:47:21,039 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 04:47:21,039 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 04:47:21,039 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 04:47:21,045 INFO L129 PetriNetUnfolder]: 104/332 cut-off events. [2021-03-25 04:47:21,045 INFO L130 PetriNetUnfolder]: For 2059/2179 co-relation queries the response was YES. [2021-03-25 04:47:21,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 332 events. 104/332 cut-off events. For 2059/2179 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2146 event pairs, 28 based on Foata normal form. 1/306 useless extension candidates. Maximal degree in co-relation 1195. Up to 132 conditions per place. [2021-03-25 04:47:21,050 INFO L142 LiptonReduction]: Number of co-enabled transitions 730 [2021-03-25 04:47:21,078 INFO L154 LiptonReduction]: Checked pairs total: 486 [2021-03-25 04:47:21,078 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:21,079 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 77 [2021-03-25 04:47:21,083 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 317 flow [2021-03-25 04:47:21,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 155.875) internal successors, (1247), 8 states have internal predecessors, (1247), 0 states have call successors, (0), 0 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-25 04:47:21,084 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:21,084 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:21,084 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:47:21,084 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:21,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:21,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1107500570, now seen corresponding path program 1 times [2021-03-25 04:47:21,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:21,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103395264] [2021-03-25 04:47:21,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:21,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:21,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:47:21,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:21,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:21,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:21,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:21,179 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-25 04:47:21,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103395264] [2021-03-25 04:47:21,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:21,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:47:21,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729583713] [2021-03-25 04:47:21,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:47:21,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:21,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:47:21,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:47:21,181 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202 [2021-03-25 04:47:21,182 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:21,182 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:21,182 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202 [2021-03-25 04:47:21,182 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:21,292 INFO L129 PetriNetUnfolder]: 154/434 cut-off events. [2021-03-25 04:47:21,293 INFO L130 PetriNetUnfolder]: For 1541/1590 co-relation queries the response was YES. [2021-03-25 04:47:21,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 434 events. 154/434 cut-off events. For 1541/1590 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2785 event pairs, 68 based on Foata normal form. 11/423 useless extension candidates. Maximal degree in co-relation 1525. Up to 236 conditions per place. [2021-03-25 04:47:21,297 INFO L132 encePairwiseOnDemand]: 197/202 looper letters, 17 selfloop transitions, 15 changer transitions 0/60 dead transitions. [2021-03-25 04:47:21,297 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 435 flow [2021-03-25 04:47:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:47:21,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:47:21,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 654 transitions. [2021-03-25 04:47:21,300 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8094059405940595 [2021-03-25 04:47:21,300 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 654 transitions. [2021-03-25 04:47:21,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 654 transitions. [2021-03-25 04:47:21,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:21,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 654 transitions. [2021-03-25 04:47:21,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 163.5) internal successors, (654), 4 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:21,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 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-25 04:47:21,303 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 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-25 04:47:21,304 INFO L185 Difference]: Start difference. First operand has 60 places, 52 transitions, 317 flow. Second operand 4 states and 654 transitions. [2021-03-25 04:47:21,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 435 flow [2021-03-25 04:47:21,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 429 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-03-25 04:47:21,311 INFO L241 Difference]: Finished difference. Result has 65 places, 59 transitions, 426 flow [2021-03-25 04:47:21,311 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=426, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2021-03-25 04:47:21,311 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2021-03-25 04:47:21,312 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:21,312 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 59 transitions, 426 flow [2021-03-25 04:47:21,312 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 59 transitions, 426 flow [2021-03-25 04:47:21,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 59 transitions, 426 flow [2021-03-25 04:47:21,355 INFO L129 PetriNetUnfolder]: 101/358 cut-off events. [2021-03-25 04:47:21,355 INFO L130 PetriNetUnfolder]: For 2185/2255 co-relation queries the response was YES. [2021-03-25 04:47:21,356 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 358 events. 101/358 cut-off events. For 2185/2255 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2409 event pairs, 14 based on Foata normal form. 5/346 useless extension candidates. Maximal degree in co-relation 1351. Up to 125 conditions per place. [2021-03-25 04:47:21,361 INFO L142 LiptonReduction]: Number of co-enabled transitions 782 [2021-03-25 04:47:21,397 INFO L154 LiptonReduction]: Checked pairs total: 687 [2021-03-25 04:47:21,397 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:21,397 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 85 [2021-03-25 04:47:21,399 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 426 flow [2021-03-25 04:47:21,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:21,400 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:21,400 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:21,400 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:47:21,400 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash -223651348, now seen corresponding path program 1 times [2021-03-25 04:47:21,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:21,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204197859] [2021-03-25 04:47:21,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:21,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:21,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:21,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:21,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:47:21,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:21,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 04:47:21,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:21,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 04:47:21,496 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-25 04:47:21,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204197859] [2021-03-25 04:47:21,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:21,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:47:21,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17784660] [2021-03-25 04:47:21,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:47:21,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:21,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:47:21,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:47:21,499 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 202 [2021-03-25 04:47:21,501 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 426 flow. Second operand has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 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-25 04:47:21,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:21,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 202 [2021-03-25 04:47:21,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:21,608 INFO L129 PetriNetUnfolder]: 160/442 cut-off events. [2021-03-25 04:47:21,608 INFO L130 PetriNetUnfolder]: For 1970/2017 co-relation queries the response was YES. [2021-03-25 04:47:21,610 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1767 conditions, 442 events. 160/442 cut-off events. For 1970/2017 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2810 event pairs, 15 based on Foata normal form. 17/438 useless extension candidates. Maximal degree in co-relation 1739. Up to 222 conditions per place. [2021-03-25 04:47:21,613 INFO L132 encePairwiseOnDemand]: 196/202 looper letters, 22 selfloop transitions, 18 changer transitions 0/68 dead transitions. [2021-03-25 04:47:21,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 568 flow [2021-03-25 04:47:21,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:47:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:47:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 831 transitions. [2021-03-25 04:47:21,616 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8227722772277227 [2021-03-25 04:47:21,616 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 831 transitions. [2021-03-25 04:47:21,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 831 transitions. [2021-03-25 04:47:21,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:21,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 831 transitions. [2021-03-25 04:47:21,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.2) internal successors, (831), 5 states have internal predecessors, (831), 0 states have call successors, (0), 0 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-25 04:47:21,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 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-25 04:47:21,620 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 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-25 04:47:21,620 INFO L185 Difference]: Start difference. First operand has 65 places, 59 transitions, 426 flow. Second operand 5 states and 831 transitions. [2021-03-25 04:47:21,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 568 flow [2021-03-25 04:47:21,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 556 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-25 04:47:21,625 INFO L241 Difference]: Finished difference. Result has 69 places, 65 transitions, 511 flow [2021-03-25 04:47:21,625 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=511, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2021-03-25 04:47:21,626 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2021-03-25 04:47:21,626 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:21,626 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 65 transitions, 511 flow [2021-03-25 04:47:21,626 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 65 transitions, 511 flow [2021-03-25 04:47:21,627 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 65 transitions, 511 flow [2021-03-25 04:47:21,674 INFO L129 PetriNetUnfolder]: 114/399 cut-off events. [2021-03-25 04:47:21,674 INFO L130 PetriNetUnfolder]: For 2301/2380 co-relation queries the response was YES. [2021-03-25 04:47:21,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 399 events. 114/399 cut-off events. For 2301/2380 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2831 event pairs, 6 based on Foata normal form. 2/388 useless extension candidates. Maximal degree in co-relation 1568. Up to 125 conditions per place. [2021-03-25 04:47:21,681 INFO L142 LiptonReduction]: Number of co-enabled transitions 864 [2021-03-25 04:47:21,740 INFO L154 LiptonReduction]: Checked pairs total: 778 [2021-03-25 04:47:21,740 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:21,740 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 114 [2021-03-25 04:47:21,741 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 511 flow [2021-03-25 04:47:21,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 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-25 04:47:21,742 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:21,742 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:21,742 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:47:21,742 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:21,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:21,742 INFO L82 PathProgramCache]: Analyzing trace with hash -198295828, now seen corresponding path program 2 times [2021-03-25 04:47:21,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:21,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138920300] [2021-03-25 04:47:21,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:21,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:21,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:47:21,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:21,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:47:21,846 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-25 04:47:21,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 04:47:21,859 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.1 percent of original size [2021-03-25 04:47:21,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-25 04:47:21,883 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-25 04:47:21,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138920300] [2021-03-25 04:47:21,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:21,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:47:21,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968798172] [2021-03-25 04:47:21,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:47:21,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:21,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:47:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:47:21,885 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 202 [2021-03-25 04:47:21,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 511 flow. Second operand has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 0 states have call successors, (0), 0 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-25 04:47:21,886 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:21,886 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 202 [2021-03-25 04:47:21,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:22,012 INFO L129 PetriNetUnfolder]: 163/474 cut-off events. [2021-03-25 04:47:22,012 INFO L130 PetriNetUnfolder]: For 2437/2501 co-relation queries the response was YES. [2021-03-25 04:47:22,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 474 events. 163/474 cut-off events. For 2437/2501 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3193 event pairs, 7 based on Foata normal form. 33/485 useless extension candidates. Maximal degree in co-relation 1936. Up to 182 conditions per place. [2021-03-25 04:47:22,018 INFO L132 encePairwiseOnDemand]: 196/202 looper letters, 10 selfloop transitions, 31 changer transitions 0/69 dead transitions. [2021-03-25 04:47:22,018 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 619 flow [2021-03-25 04:47:22,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:47:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:47:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1000 transitions. [2021-03-25 04:47:22,021 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8250825082508251 [2021-03-25 04:47:22,021 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1000 transitions. [2021-03-25 04:47:22,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1000 transitions. [2021-03-25 04:47:22,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:22,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1000 transitions. [2021-03-25 04:47:22,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 166.66666666666666) internal successors, (1000), 6 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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-25 04:47:22,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 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-25 04:47:22,027 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 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-25 04:47:22,027 INFO L185 Difference]: Start difference. First operand has 69 places, 65 transitions, 511 flow. Second operand 6 states and 1000 transitions. [2021-03-25 04:47:22,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 619 flow [2021-03-25 04:47:22,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 69 transitions, 599 flow, removed 10 selfloop flow, removed 0 redundant places. [2021-03-25 04:47:22,035 INFO L241 Difference]: Finished difference. Result has 75 places, 67 transitions, 599 flow [2021-03-25 04:47:22,035 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=599, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2021-03-25 04:47:22,036 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 18 predicate places. [2021-03-25 04:47:22,036 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:22,036 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 67 transitions, 599 flow [2021-03-25 04:47:22,036 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 67 transitions, 599 flow [2021-03-25 04:47:22,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 67 transitions, 599 flow [2021-03-25 04:47:22,077 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L862-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~z$w_buff1_used~0_304 256) 0)) (.cse17 (= (mod v_~z$r_buff1_thd0~0_209 256) 0)) (.cse8 (= (mod v_~z$r_buff0_thd0~0_264 256) 0))) (let ((.cse2 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse9 (not .cse8)) (.cse15 (and .cse8 .cse17)) (.cse19 (= (mod v_~z$w_buff0_used~0_414 256) 0)) (.cse16 (and .cse8 .cse18))) (let ((.cse3 (or .cse15 .cse19 .cse16)) (.cse5 (not .cse19)) (.cse4 (or (not .cse18) .cse9)) (.cse6 (or (not .cse17) .cse9)) (.cse1 (not .cse2))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (let ((.cse0 (= |v_ULTIMATE.start_main_#t~ite31_68| |v_ULTIMATE.start_main_#t~ite31_67|))) (or (and .cse0 (= |v_ULTIMATE.start_main_#t~ite32_59| |v_ULTIMATE.start_main_#t~ite32_60|) .cse1 (= v_~z$w_buff0~0_134 v_~z$w_buff0~0_133)) (and .cse2 (or (and .cse0 .cse3 (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite32_60|)) (and (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite31_68|) (= |v_ULTIMATE.start_main_#t~ite31_68| |v_ULTIMATE.start_main_#t~ite32_60|) .cse4 .cse5 .cse6)) (= v_~z$w_buff0~0_133 |v_ULTIMATE.start_main_#t~ite32_60|)))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_32 (ite (= (ite (not (and (= v_~y~0_35 2) (= v_~x~0_35 2) (= v_~__unbuffered_p3_EAX~0_34 1) (= 0 v_~__unbuffered_p3_EBX~0_32) (= v_~z~0_151 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#t~nondet27_39| v_~weak$$choice0~0_19) (= v_~z$mem_tmp~0_36 v_~z~0_150) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~ite37_88| |v_ULTIMATE.start_main_#t~ite37_87|))) (or (and .cse2 (or (and .cse7 (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite38_84|) .cse3) (and (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite37_88|) (or (and .cse8 (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite37_88|)) (and (= |v_ULTIMATE.start_main_#t~ite37_88| 0) .cse9)) .cse4 .cse5 .cse6)) (= v_~z$w_buff0_used~0_413 |v_ULTIMATE.start_main_#t~ite38_84|)) (and .cse7 (= v_~z$w_buff0_used~0_413 v_~z$w_buff0_used~0_414) .cse1 (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite38_83|)))) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (or (and (= v_~z~0_151 v_~z~0_150) .cse3 (= |v_ULTIMATE.start_main_#t~ite29_62| |v_ULTIMATE.start_main_#t~ite29_61|)) (and (or (and .cse8 (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite29_62|)) (and (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite29_62|) .cse9)) .cse4 (= v_~z~0_151 |v_ULTIMATE.start_main_#t~ite29_62|) .cse5 .cse6)) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite43_76| |v_ULTIMATE.start_main_#t~ite43_75|))) (or (and .cse2 .cse10 (= v_~z$r_buff0_thd0~0_263 |v_ULTIMATE.start_main_#t~ite44_64|) (= v_~z$r_buff0_thd0~0_264 |v_ULTIMATE.start_main_#t~ite44_64|)) (and .cse10 (= |v_ULTIMATE.start_main_#t~ite44_64| |v_ULTIMATE.start_main_#t~ite44_63|) (= v_~z$r_buff0_thd0~0_264 v_~z$r_buff0_thd0~0_263) .cse1))) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~ite34_78| |v_ULTIMATE.start_main_#t~ite34_77|))) (or (and (= |v_ULTIMATE.start_main_#t~ite35_70| |v_ULTIMATE.start_main_#t~ite35_69|) .cse11 (= v_~z$w_buff1~0_126 v_~z$w_buff1~0_127) .cse1) (and .cse2 (or (and (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite35_70|) .cse11 .cse3) (and .cse4 (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite34_78|) .cse5 .cse6 (= |v_ULTIMATE.start_main_#t~ite34_78| |v_ULTIMATE.start_main_#t~ite35_70|))) (= v_~z$w_buff1~0_126 |v_ULTIMATE.start_main_#t~ite35_70|)))) (or (and .cse2 (= v_~z~0_149 v_~z~0_151)) (and (= v_~z$mem_tmp~0_36 v_~z~0_149) .cse1)) (= v_~z$flush_delayed~0_62 0) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite46_82| |v_ULTIMATE.start_main_#t~ite46_81|))) (or (and (= v_~z$r_buff1_thd0~0_209 |v_ULTIMATE.start_main_#t~ite47_74|) .cse12 .cse2 (= v_~z$r_buff1_thd0~0_208 |v_ULTIMATE.start_main_#t~ite47_74|)) (and (= |v_ULTIMATE.start_main_#t~ite47_74| |v_ULTIMATE.start_main_#t~ite47_73|) .cse12 (= v_~z$r_buff1_thd0~0_209 v_~z$r_buff1_thd0~0_208) .cse1))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite40_59| |v_ULTIMATE.start_main_#t~ite40_60|))) (or (and .cse2 (= v_~z$w_buff1_used~0_303 |v_ULTIMATE.start_main_#t~ite41_54|) (let ((.cse13 (= (mod v_~z$w_buff0_used~0_413 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite40_60| |v_ULTIMATE.start_main_#t~ite41_54|) (= |v_ULTIMATE.start_main_#t~ite40_60| 0) .cse4 .cse6 (not .cse13)) (and .cse14 (= v_~z$w_buff1_used~0_304 |v_ULTIMATE.start_main_#t~ite41_54|) (or .cse15 .cse16 .cse13))))) (and (= |v_ULTIMATE.start_main_#t~ite41_54| |v_ULTIMATE.start_main_#t~ite41_53|) (= v_~z$w_buff1_used~0_304 v_~z$w_buff1_used~0_303) .cse14 .cse1))) (= |v_ULTIMATE.start_main_#t~nondet28_45| v_~weak$$choice2~0_84))))) InVars {ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_61|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_81|, ~z$w_buff1~0=v_~z$w_buff1~0_127, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_63|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_264, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_209, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_39|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_45|, ~y~0=v_~y~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_414, ~z$w_buff0~0=v_~z$w_buff0~0_134, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_304, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_69|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_83|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_87|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_67|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_77|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_59|, ~z~0=v_~z~0_150, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_60|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_80|, ~z$w_buff1~0=v_~z$w_buff1~0_126, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_50|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_74|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_48|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_263, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_36|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_208, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_38|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_44|, ~y~0=v_~y~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_413, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_44|, ~z$w_buff0~0=v_~z$w_buff0~0_133, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_303, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_68|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_48|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~z$flush_delayed~0=v_~z$flush_delayed~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_86|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_66|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_58|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_40|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_76|, ~weak$$choice0~0=v_~weak$$choice0~0_19, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_52|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_58|, ~z~0=v_~z~0_149, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~x~0=v_~x~0_35} AuxVars[|v_ULTIMATE.start_main_#t~ite44_64|, |v_ULTIMATE.start_main_#t~ite41_54|, |v_ULTIMATE.start_main_#t~ite43_76|, |v_ULTIMATE.start_main_#t~ite40_60|, |v_ULTIMATE.start_main_#t~ite29_62|, |v_ULTIMATE.start_main_#t~ite31_68|, |v_ULTIMATE.start_main_#t~ite46_82|, |v_ULTIMATE.start_main_#t~ite47_74|, |v_ULTIMATE.start_main_#t~ite32_60|, |v_ULTIMATE.start_main_#t~ite38_84|, |v_ULTIMATE.start_main_#t~ite34_78|, v_~z~0_151, |v_ULTIMATE.start_main_#t~ite35_70|, |v_ULTIMATE.start_main_#t~ite37_88|] AssignedVars[ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet27, ULTIMATE.start_main_#t~nondet28, ULTIMATE.start___VERIFIER_assert_#in~expression, ~z$mem_tmp~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0, ~weak$$choice2~0][51], [Black: 189#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0~0 ~z~0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), P1Thread1of1ForFork1InUse, 193#true, P3Thread1of1ForFork3InUse, Black: 198#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 137#(= ~y~0 0), 204#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0)), Black: 143#(= ~__unbuffered_p3_EAX~0 0), Black: 205#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1)), Black: 148#(= ~x~0 0), 151#true, 90#L766true, Black: 153#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 154#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 32#L754true, Black: 163#(= ~y~0 1), 166#true, 104#L791true, 48#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 177#(and (= ~x~0 ~z~0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2)), Black: 170#(and (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2)), Black: 173#(not (= 2 ~x~0)), 54#L817true, Black: 175#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0))), 183#true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 187#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0))]) [2021-03-25 04:47:22,078 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2021-03-25 04:47:22,078 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 04:47:22,078 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 04:47:22,078 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 04:47:22,081 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L862-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~z$w_buff1_used~0_304 256) 0)) (.cse17 (= (mod v_~z$r_buff1_thd0~0_209 256) 0)) (.cse8 (= (mod v_~z$r_buff0_thd0~0_264 256) 0))) (let ((.cse2 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse9 (not .cse8)) (.cse15 (and .cse8 .cse17)) (.cse19 (= (mod v_~z$w_buff0_used~0_414 256) 0)) (.cse16 (and .cse8 .cse18))) (let ((.cse3 (or .cse15 .cse19 .cse16)) (.cse5 (not .cse19)) (.cse4 (or (not .cse18) .cse9)) (.cse6 (or (not .cse17) .cse9)) (.cse1 (not .cse2))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (let ((.cse0 (= |v_ULTIMATE.start_main_#t~ite31_68| |v_ULTIMATE.start_main_#t~ite31_67|))) (or (and .cse0 (= |v_ULTIMATE.start_main_#t~ite32_59| |v_ULTIMATE.start_main_#t~ite32_60|) .cse1 (= v_~z$w_buff0~0_134 v_~z$w_buff0~0_133)) (and .cse2 (or (and .cse0 .cse3 (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite32_60|)) (and (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite31_68|) (= |v_ULTIMATE.start_main_#t~ite31_68| |v_ULTIMATE.start_main_#t~ite32_60|) .cse4 .cse5 .cse6)) (= v_~z$w_buff0~0_133 |v_ULTIMATE.start_main_#t~ite32_60|)))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_32 (ite (= (ite (not (and (= v_~y~0_35 2) (= v_~x~0_35 2) (= v_~__unbuffered_p3_EAX~0_34 1) (= 0 v_~__unbuffered_p3_EBX~0_32) (= v_~z~0_151 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#t~nondet27_39| v_~weak$$choice0~0_19) (= v_~z$mem_tmp~0_36 v_~z~0_150) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~ite37_88| |v_ULTIMATE.start_main_#t~ite37_87|))) (or (and .cse2 (or (and .cse7 (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite38_84|) .cse3) (and (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite37_88|) (or (and .cse8 (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite37_88|)) (and (= |v_ULTIMATE.start_main_#t~ite37_88| 0) .cse9)) .cse4 .cse5 .cse6)) (= v_~z$w_buff0_used~0_413 |v_ULTIMATE.start_main_#t~ite38_84|)) (and .cse7 (= v_~z$w_buff0_used~0_413 v_~z$w_buff0_used~0_414) .cse1 (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite38_83|)))) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (or (and (= v_~z~0_151 v_~z~0_150) .cse3 (= |v_ULTIMATE.start_main_#t~ite29_62| |v_ULTIMATE.start_main_#t~ite29_61|)) (and (or (and .cse8 (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite29_62|)) (and (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite29_62|) .cse9)) .cse4 (= v_~z~0_151 |v_ULTIMATE.start_main_#t~ite29_62|) .cse5 .cse6)) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite43_76| |v_ULTIMATE.start_main_#t~ite43_75|))) (or (and .cse2 .cse10 (= v_~z$r_buff0_thd0~0_263 |v_ULTIMATE.start_main_#t~ite44_64|) (= v_~z$r_buff0_thd0~0_264 |v_ULTIMATE.start_main_#t~ite44_64|)) (and .cse10 (= |v_ULTIMATE.start_main_#t~ite44_64| |v_ULTIMATE.start_main_#t~ite44_63|) (= v_~z$r_buff0_thd0~0_264 v_~z$r_buff0_thd0~0_263) .cse1))) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~ite34_78| |v_ULTIMATE.start_main_#t~ite34_77|))) (or (and (= |v_ULTIMATE.start_main_#t~ite35_70| |v_ULTIMATE.start_main_#t~ite35_69|) .cse11 (= v_~z$w_buff1~0_126 v_~z$w_buff1~0_127) .cse1) (and .cse2 (or (and (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite35_70|) .cse11 .cse3) (and .cse4 (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite34_78|) .cse5 .cse6 (= |v_ULTIMATE.start_main_#t~ite34_78| |v_ULTIMATE.start_main_#t~ite35_70|))) (= v_~z$w_buff1~0_126 |v_ULTIMATE.start_main_#t~ite35_70|)))) (or (and .cse2 (= v_~z~0_149 v_~z~0_151)) (and (= v_~z$mem_tmp~0_36 v_~z~0_149) .cse1)) (= v_~z$flush_delayed~0_62 0) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite46_82| |v_ULTIMATE.start_main_#t~ite46_81|))) (or (and (= v_~z$r_buff1_thd0~0_209 |v_ULTIMATE.start_main_#t~ite47_74|) .cse12 .cse2 (= v_~z$r_buff1_thd0~0_208 |v_ULTIMATE.start_main_#t~ite47_74|)) (and (= |v_ULTIMATE.start_main_#t~ite47_74| |v_ULTIMATE.start_main_#t~ite47_73|) .cse12 (= v_~z$r_buff1_thd0~0_209 v_~z$r_buff1_thd0~0_208) .cse1))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite40_59| |v_ULTIMATE.start_main_#t~ite40_60|))) (or (and .cse2 (= v_~z$w_buff1_used~0_303 |v_ULTIMATE.start_main_#t~ite41_54|) (let ((.cse13 (= (mod v_~z$w_buff0_used~0_413 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite40_60| |v_ULTIMATE.start_main_#t~ite41_54|) (= |v_ULTIMATE.start_main_#t~ite40_60| 0) .cse4 .cse6 (not .cse13)) (and .cse14 (= v_~z$w_buff1_used~0_304 |v_ULTIMATE.start_main_#t~ite41_54|) (or .cse15 .cse16 .cse13))))) (and (= |v_ULTIMATE.start_main_#t~ite41_54| |v_ULTIMATE.start_main_#t~ite41_53|) (= v_~z$w_buff1_used~0_304 v_~z$w_buff1_used~0_303) .cse14 .cse1))) (= |v_ULTIMATE.start_main_#t~nondet28_45| v_~weak$$choice2~0_84))))) InVars {ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_61|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_81|, ~z$w_buff1~0=v_~z$w_buff1~0_127, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_63|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_264, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_209, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_39|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_45|, ~y~0=v_~y~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_414, ~z$w_buff0~0=v_~z$w_buff0~0_134, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_304, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_69|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_83|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_87|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_67|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_77|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_59|, ~z~0=v_~z~0_150, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_60|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_80|, ~z$w_buff1~0=v_~z$w_buff1~0_126, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_50|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_74|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_48|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_263, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_36|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_208, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_38|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_44|, ~y~0=v_~y~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_413, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_44|, ~z$w_buff0~0=v_~z$w_buff0~0_133, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_303, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_68|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_48|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~z$flush_delayed~0=v_~z$flush_delayed~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_86|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_66|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_58|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_40|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_76|, ~weak$$choice0~0=v_~weak$$choice0~0_19, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_52|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_58|, ~z~0=v_~z~0_149, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~x~0=v_~x~0_35} AuxVars[|v_ULTIMATE.start_main_#t~ite44_64|, |v_ULTIMATE.start_main_#t~ite41_54|, |v_ULTIMATE.start_main_#t~ite43_76|, |v_ULTIMATE.start_main_#t~ite40_60|, |v_ULTIMATE.start_main_#t~ite29_62|, |v_ULTIMATE.start_main_#t~ite31_68|, |v_ULTIMATE.start_main_#t~ite46_82|, |v_ULTIMATE.start_main_#t~ite47_74|, |v_ULTIMATE.start_main_#t~ite32_60|, |v_ULTIMATE.start_main_#t~ite38_84|, |v_ULTIMATE.start_main_#t~ite34_78|, v_~z~0_151, |v_ULTIMATE.start_main_#t~ite35_70|, |v_ULTIMATE.start_main_#t~ite37_88|] AssignedVars[ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet27, ULTIMATE.start_main_#t~nondet28, ULTIMATE.start___VERIFIER_assert_#in~expression, ~z$mem_tmp~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0, ~weak$$choice2~0][51], [Black: 189#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0~0 ~z~0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), P1Thread1of1ForFork1InUse, 193#true, P3Thread1of1ForFork3InUse, 71#L784true, Black: 198#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), 204#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0)), Black: 137#(= ~y~0 0), Black: 143#(= ~__unbuffered_p3_EAX~0 0), Black: 205#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1)), Black: 148#(= ~x~0 0), 151#true, 90#L766true, Black: 153#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 154#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 32#L754true, 100#L827true, Black: 163#(= ~y~0 1), 166#true, 48#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 177#(and (= ~x~0 ~z~0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2)), Black: 170#(and (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2)), Black: 173#(not (= 2 ~x~0)), Black: 175#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0))), 183#true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 187#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0))]) [2021-03-25 04:47:22,081 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-03-25 04:47:22,082 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-25 04:47:22,082 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-25 04:47:22,082 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-25 04:47:22,087 INFO L129 PetriNetUnfolder]: 108/421 cut-off events. [2021-03-25 04:47:22,087 INFO L130 PetriNetUnfolder]: For 2695/2792 co-relation queries the response was YES. [2021-03-25 04:47:22,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 421 events. 108/421 cut-off events. For 2695/2792 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3203 event pairs, 3 based on Foata normal form. 9/415 useless extension candidates. Maximal degree in co-relation 1755. Up to 122 conditions per place. [2021-03-25 04:47:22,094 INFO L142 LiptonReduction]: Number of co-enabled transitions 914 [2021-03-25 04:47:22,153 INFO L154 LiptonReduction]: Checked pairs total: 861 [2021-03-25 04:47:22,153 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:22,154 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 118 [2021-03-25 04:47:22,155 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 599 flow [2021-03-25 04:47:22,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 0 states have call successors, (0), 0 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-25 04:47:22,156 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:22,156 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:22,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:47:22,156 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:22,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:22,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1133444327, now seen corresponding path program 1 times [2021-03-25 04:47:22,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:22,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726668447] [2021-03-25 04:47:22,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:22,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:22,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:47:22,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:22,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:47:22,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:22,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:47:22,266 INFO L142 QuantifierPusher]: treesize reduction 10, result has 85.5 percent of original size [2021-03-25 04:47:22,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-03-25 04:47:22,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:22,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 04:47:22,307 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-25 04:47:22,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726668447] [2021-03-25 04:47:22,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:22,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:47:22,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326090378] [2021-03-25 04:47:22,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:47:22,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:22,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:47:22,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:47:22,309 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 202 [2021-03-25 04:47:22,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 599 flow. Second operand has 7 states, 7 states have (on average 159.85714285714286) internal successors, (1119), 7 states have internal predecessors, (1119), 0 states have call successors, (0), 0 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-25 04:47:22,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:22,311 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 202 [2021-03-25 04:47:22,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:22,442 INFO L129 PetriNetUnfolder]: 171/506 cut-off events. [2021-03-25 04:47:22,442 INFO L130 PetriNetUnfolder]: For 2717/2769 co-relation queries the response was YES. [2021-03-25 04:47:22,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2301 conditions, 506 events. 171/506 cut-off events. For 2717/2769 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3562 event pairs, 25 based on Foata normal form. 24/508 useless extension candidates. Maximal degree in co-relation 2268. Up to 229 conditions per place. [2021-03-25 04:47:22,448 INFO L132 encePairwiseOnDemand]: 197/202 looper letters, 25 selfloop transitions, 18 changer transitions 0/71 dead transitions. [2021-03-25 04:47:22,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 71 transitions, 718 flow [2021-03-25 04:47:22,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:47:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:47:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 811 transitions. [2021-03-25 04:47:22,451 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.802970297029703 [2021-03-25 04:47:22,451 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 811 transitions. [2021-03-25 04:47:22,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 811 transitions. [2021-03-25 04:47:22,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:22,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 811 transitions. [2021-03-25 04:47:22,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.2) internal successors, (811), 5 states have internal predecessors, (811), 0 states have call successors, (0), 0 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-25 04:47:22,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 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-25 04:47:22,455 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 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-25 04:47:22,455 INFO L185 Difference]: Start difference. First operand has 75 places, 67 transitions, 599 flow. Second operand 5 states and 811 transitions. [2021-03-25 04:47:22,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 71 transitions, 718 flow [2021-03-25 04:47:22,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 71 transitions, 671 flow, removed 14 selfloop flow, removed 3 redundant places. [2021-03-25 04:47:22,469 INFO L241 Difference]: Finished difference. Result has 77 places, 69 transitions, 628 flow [2021-03-25 04:47:22,469 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=628, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2021-03-25 04:47:22,469 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2021-03-25 04:47:22,469 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:22,469 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 69 transitions, 628 flow [2021-03-25 04:47:22,469 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 69 transitions, 628 flow [2021-03-25 04:47:22,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 69 transitions, 628 flow [2021-03-25 04:47:22,518 INFO L129 PetriNetUnfolder]: 107/422 cut-off events. [2021-03-25 04:47:22,519 INFO L130 PetriNetUnfolder]: For 2759/2828 co-relation queries the response was YES. [2021-03-25 04:47:22,521 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 422 events. 107/422 cut-off events. For 2759/2828 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3203 event pairs, 12 based on Foata normal form. 9/420 useless extension candidates. Maximal degree in co-relation 1703. Up to 127 conditions per place. [2021-03-25 04:47:22,526 INFO L142 LiptonReduction]: Number of co-enabled transitions 956 [2021-03-25 04:47:22,573 INFO L154 LiptonReduction]: Checked pairs total: 794 [2021-03-25 04:47:22,574 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:22,574 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 105 [2021-03-25 04:47:22,574 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 628 flow [2021-03-25 04:47:22,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 159.85714285714286) internal successors, (1119), 7 states have internal predecessors, (1119), 0 states have call successors, (0), 0 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-25 04:47:22,575 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:22,575 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:22,575 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:47:22,575 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:22,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:22,575 INFO L82 PathProgramCache]: Analyzing trace with hash 295809283, now seen corresponding path program 1 times [2021-03-25 04:47:22,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:22,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686656197] [2021-03-25 04:47:22,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:22,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:22,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:22,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:22,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:22,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:22,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:47:22,626 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-25 04:47:22,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686656197] [2021-03-25 04:47:22,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:22,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:47:22,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555639754] [2021-03-25 04:47:22,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:47:22,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:22,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:47:22,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:47:22,628 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 202 [2021-03-25 04:47:22,628 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 628 flow. Second operand has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 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-25 04:47:22,628 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:22,628 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 202 [2021-03-25 04:47:22,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:23,007 INFO L129 PetriNetUnfolder]: 1397/2626 cut-off events. [2021-03-25 04:47:23,007 INFO L130 PetriNetUnfolder]: For 6188/6593 co-relation queries the response was YES. [2021-03-25 04:47:23,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7412 conditions, 2626 events. 1397/2626 cut-off events. For 6188/6593 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 20711 event pairs, 606 based on Foata normal form. 220/2355 useless extension candidates. Maximal degree in co-relation 7379. Up to 1777 conditions per place. [2021-03-25 04:47:23,034 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 13 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2021-03-25 04:47:23,034 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 82 transitions, 685 flow [2021-03-25 04:47:23,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:47:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:47:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 859 transitions. [2021-03-25 04:47:23,037 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8504950495049505 [2021-03-25 04:47:23,037 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 859 transitions. [2021-03-25 04:47:23,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 859 transitions. [2021-03-25 04:47:23,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:23,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 859 transitions. [2021-03-25 04:47:23,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 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-25 04:47:23,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 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-25 04:47:23,042 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 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-25 04:47:23,042 INFO L185 Difference]: Start difference. First operand has 77 places, 69 transitions, 628 flow. Second operand 5 states and 859 transitions. [2021-03-25 04:47:23,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 82 transitions, 685 flow [2021-03-25 04:47:23,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 82 transitions, 650 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-03-25 04:47:23,061 INFO L241 Difference]: Finished difference. Result has 81 places, 77 transitions, 655 flow [2021-03-25 04:47:23,062 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=655, PETRI_PLACES=81, PETRI_TRANSITIONS=77} [2021-03-25 04:47:23,062 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2021-03-25 04:47:23,062 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:23,062 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 77 transitions, 655 flow [2021-03-25 04:47:23,062 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 77 transitions, 655 flow [2021-03-25 04:47:23,063 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 77 transitions, 655 flow [2021-03-25 04:47:23,223 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L862-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~z$w_buff1_used~0_304 256) 0)) (.cse17 (= (mod v_~z$r_buff1_thd0~0_209 256) 0)) (.cse8 (= (mod v_~z$r_buff0_thd0~0_264 256) 0))) (let ((.cse2 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse9 (not .cse8)) (.cse15 (and .cse8 .cse17)) (.cse19 (= (mod v_~z$w_buff0_used~0_414 256) 0)) (.cse16 (and .cse8 .cse18))) (let ((.cse3 (or .cse15 .cse19 .cse16)) (.cse5 (not .cse19)) (.cse4 (or (not .cse18) .cse9)) (.cse6 (or (not .cse17) .cse9)) (.cse1 (not .cse2))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (let ((.cse0 (= |v_ULTIMATE.start_main_#t~ite31_68| |v_ULTIMATE.start_main_#t~ite31_67|))) (or (and .cse0 (= |v_ULTIMATE.start_main_#t~ite32_59| |v_ULTIMATE.start_main_#t~ite32_60|) .cse1 (= v_~z$w_buff0~0_134 v_~z$w_buff0~0_133)) (and .cse2 (or (and .cse0 .cse3 (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite32_60|)) (and (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite31_68|) (= |v_ULTIMATE.start_main_#t~ite31_68| |v_ULTIMATE.start_main_#t~ite32_60|) .cse4 .cse5 .cse6)) (= v_~z$w_buff0~0_133 |v_ULTIMATE.start_main_#t~ite32_60|)))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_32 (ite (= (ite (not (and (= v_~y~0_35 2) (= v_~x~0_35 2) (= v_~__unbuffered_p3_EAX~0_34 1) (= 0 v_~__unbuffered_p3_EBX~0_32) (= v_~z~0_151 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#t~nondet27_39| v_~weak$$choice0~0_19) (= v_~z$mem_tmp~0_36 v_~z~0_150) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~ite37_88| |v_ULTIMATE.start_main_#t~ite37_87|))) (or (and .cse2 (or (and .cse7 (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite38_84|) .cse3) (and (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite37_88|) (or (and .cse8 (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite37_88|)) (and (= |v_ULTIMATE.start_main_#t~ite37_88| 0) .cse9)) .cse4 .cse5 .cse6)) (= v_~z$w_buff0_used~0_413 |v_ULTIMATE.start_main_#t~ite38_84|)) (and .cse7 (= v_~z$w_buff0_used~0_413 v_~z$w_buff0_used~0_414) .cse1 (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite38_83|)))) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (or (and (= v_~z~0_151 v_~z~0_150) .cse3 (= |v_ULTIMATE.start_main_#t~ite29_62| |v_ULTIMATE.start_main_#t~ite29_61|)) (and (or (and .cse8 (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite29_62|)) (and (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite29_62|) .cse9)) .cse4 (= v_~z~0_151 |v_ULTIMATE.start_main_#t~ite29_62|) .cse5 .cse6)) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite43_76| |v_ULTIMATE.start_main_#t~ite43_75|))) (or (and .cse2 .cse10 (= v_~z$r_buff0_thd0~0_263 |v_ULTIMATE.start_main_#t~ite44_64|) (= v_~z$r_buff0_thd0~0_264 |v_ULTIMATE.start_main_#t~ite44_64|)) (and .cse10 (= |v_ULTIMATE.start_main_#t~ite44_64| |v_ULTIMATE.start_main_#t~ite44_63|) (= v_~z$r_buff0_thd0~0_264 v_~z$r_buff0_thd0~0_263) .cse1))) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~ite34_78| |v_ULTIMATE.start_main_#t~ite34_77|))) (or (and (= |v_ULTIMATE.start_main_#t~ite35_70| |v_ULTIMATE.start_main_#t~ite35_69|) .cse11 (= v_~z$w_buff1~0_126 v_~z$w_buff1~0_127) .cse1) (and .cse2 (or (and (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite35_70|) .cse11 .cse3) (and .cse4 (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite34_78|) .cse5 .cse6 (= |v_ULTIMATE.start_main_#t~ite34_78| |v_ULTIMATE.start_main_#t~ite35_70|))) (= v_~z$w_buff1~0_126 |v_ULTIMATE.start_main_#t~ite35_70|)))) (or (and .cse2 (= v_~z~0_149 v_~z~0_151)) (and (= v_~z$mem_tmp~0_36 v_~z~0_149) .cse1)) (= v_~z$flush_delayed~0_62 0) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite46_82| |v_ULTIMATE.start_main_#t~ite46_81|))) (or (and (= v_~z$r_buff1_thd0~0_209 |v_ULTIMATE.start_main_#t~ite47_74|) .cse12 .cse2 (= v_~z$r_buff1_thd0~0_208 |v_ULTIMATE.start_main_#t~ite47_74|)) (and (= |v_ULTIMATE.start_main_#t~ite47_74| |v_ULTIMATE.start_main_#t~ite47_73|) .cse12 (= v_~z$r_buff1_thd0~0_209 v_~z$r_buff1_thd0~0_208) .cse1))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite40_59| |v_ULTIMATE.start_main_#t~ite40_60|))) (or (and .cse2 (= v_~z$w_buff1_used~0_303 |v_ULTIMATE.start_main_#t~ite41_54|) (let ((.cse13 (= (mod v_~z$w_buff0_used~0_413 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite40_60| |v_ULTIMATE.start_main_#t~ite41_54|) (= |v_ULTIMATE.start_main_#t~ite40_60| 0) .cse4 .cse6 (not .cse13)) (and .cse14 (= v_~z$w_buff1_used~0_304 |v_ULTIMATE.start_main_#t~ite41_54|) (or .cse15 .cse16 .cse13))))) (and (= |v_ULTIMATE.start_main_#t~ite41_54| |v_ULTIMATE.start_main_#t~ite41_53|) (= v_~z$w_buff1_used~0_304 v_~z$w_buff1_used~0_303) .cse14 .cse1))) (= |v_ULTIMATE.start_main_#t~nondet28_45| v_~weak$$choice2~0_84))))) InVars {ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_61|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_81|, ~z$w_buff1~0=v_~z$w_buff1~0_127, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_63|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_264, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_209, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_39|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_45|, ~y~0=v_~y~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_414, ~z$w_buff0~0=v_~z$w_buff0~0_134, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_304, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_69|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_83|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_87|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_67|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_77|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_59|, ~z~0=v_~z~0_150, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_60|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_80|, ~z$w_buff1~0=v_~z$w_buff1~0_126, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_50|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_74|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_48|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_263, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_36|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_208, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_38|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_44|, ~y~0=v_~y~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_413, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_44|, ~z$w_buff0~0=v_~z$w_buff0~0_133, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_303, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_68|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_48|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~z$flush_delayed~0=v_~z$flush_delayed~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_86|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_66|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_58|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_40|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_76|, ~weak$$choice0~0=v_~weak$$choice0~0_19, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_52|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_58|, ~z~0=v_~z~0_149, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~x~0=v_~x~0_35} AuxVars[|v_ULTIMATE.start_main_#t~ite44_64|, |v_ULTIMATE.start_main_#t~ite41_54|, |v_ULTIMATE.start_main_#t~ite43_76|, |v_ULTIMATE.start_main_#t~ite40_60|, |v_ULTIMATE.start_main_#t~ite29_62|, |v_ULTIMATE.start_main_#t~ite31_68|, |v_ULTIMATE.start_main_#t~ite46_82|, |v_ULTIMATE.start_main_#t~ite47_74|, |v_ULTIMATE.start_main_#t~ite32_60|, |v_ULTIMATE.start_main_#t~ite38_84|, |v_ULTIMATE.start_main_#t~ite34_78|, v_~z~0_151, |v_ULTIMATE.start_main_#t~ite35_70|, |v_ULTIMATE.start_main_#t~ite37_88|] AssignedVars[ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet27, ULTIMATE.start_main_#t~nondet28, ULTIMATE.start___VERIFIER_assert_#in~expression, ~z$mem_tmp~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0, ~weak$$choice2~0][9], [P1Thread1of1ForFork1InUse, 193#true, P3Thread1of1ForFork3InUse, 71#L784true, Black: 198#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), 204#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0)), Black: 137#(= ~y~0 0), Black: 143#(= ~__unbuffered_p3_EAX~0 0), Black: 205#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1)), Black: 148#(= ~x~0 0), 151#true, 90#L766true, Black: 217#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 221#true, Black: 153#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 154#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 100#L827true, Black: 224#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 226#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 163#(= ~y~0 1), 166#true, Black: 223#(= ~__unbuffered_cnt~0 0), 48#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 177#(and (= ~x~0 ~z~0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2)), Black: 170#(and (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2)), Black: 173#(not (= 2 ~x~0)), Black: 175#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0))), 183#true, 58#P0EXITtrue, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 187#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0))]) [2021-03-25 04:47:23,223 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 04:47:23,223 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 04:47:23,223 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 04:47:23,223 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 04:47:23,242 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L862-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~z$w_buff1_used~0_304 256) 0)) (.cse17 (= (mod v_~z$r_buff1_thd0~0_209 256) 0)) (.cse8 (= (mod v_~z$r_buff0_thd0~0_264 256) 0))) (let ((.cse2 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse9 (not .cse8)) (.cse15 (and .cse8 .cse17)) (.cse19 (= (mod v_~z$w_buff0_used~0_414 256) 0)) (.cse16 (and .cse8 .cse18))) (let ((.cse3 (or .cse15 .cse19 .cse16)) (.cse5 (not .cse19)) (.cse4 (or (not .cse18) .cse9)) (.cse6 (or (not .cse17) .cse9)) (.cse1 (not .cse2))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (let ((.cse0 (= |v_ULTIMATE.start_main_#t~ite31_68| |v_ULTIMATE.start_main_#t~ite31_67|))) (or (and .cse0 (= |v_ULTIMATE.start_main_#t~ite32_59| |v_ULTIMATE.start_main_#t~ite32_60|) .cse1 (= v_~z$w_buff0~0_134 v_~z$w_buff0~0_133)) (and .cse2 (or (and .cse0 .cse3 (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite32_60|)) (and (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite31_68|) (= |v_ULTIMATE.start_main_#t~ite31_68| |v_ULTIMATE.start_main_#t~ite32_60|) .cse4 .cse5 .cse6)) (= v_~z$w_buff0~0_133 |v_ULTIMATE.start_main_#t~ite32_60|)))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_32 (ite (= (ite (not (and (= v_~y~0_35 2) (= v_~x~0_35 2) (= v_~__unbuffered_p3_EAX~0_34 1) (= 0 v_~__unbuffered_p3_EBX~0_32) (= v_~z~0_151 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#t~nondet27_39| v_~weak$$choice0~0_19) (= v_~z$mem_tmp~0_36 v_~z~0_150) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~ite37_88| |v_ULTIMATE.start_main_#t~ite37_87|))) (or (and .cse2 (or (and .cse7 (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite38_84|) .cse3) (and (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite37_88|) (or (and .cse8 (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite37_88|)) (and (= |v_ULTIMATE.start_main_#t~ite37_88| 0) .cse9)) .cse4 .cse5 .cse6)) (= v_~z$w_buff0_used~0_413 |v_ULTIMATE.start_main_#t~ite38_84|)) (and .cse7 (= v_~z$w_buff0_used~0_413 v_~z$w_buff0_used~0_414) .cse1 (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite38_83|)))) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (or (and (= v_~z~0_151 v_~z~0_150) .cse3 (= |v_ULTIMATE.start_main_#t~ite29_62| |v_ULTIMATE.start_main_#t~ite29_61|)) (and (or (and .cse8 (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite29_62|)) (and (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite29_62|) .cse9)) .cse4 (= v_~z~0_151 |v_ULTIMATE.start_main_#t~ite29_62|) .cse5 .cse6)) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite43_76| |v_ULTIMATE.start_main_#t~ite43_75|))) (or (and .cse2 .cse10 (= v_~z$r_buff0_thd0~0_263 |v_ULTIMATE.start_main_#t~ite44_64|) (= v_~z$r_buff0_thd0~0_264 |v_ULTIMATE.start_main_#t~ite44_64|)) (and .cse10 (= |v_ULTIMATE.start_main_#t~ite44_64| |v_ULTIMATE.start_main_#t~ite44_63|) (= v_~z$r_buff0_thd0~0_264 v_~z$r_buff0_thd0~0_263) .cse1))) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~ite34_78| |v_ULTIMATE.start_main_#t~ite34_77|))) (or (and (= |v_ULTIMATE.start_main_#t~ite35_70| |v_ULTIMATE.start_main_#t~ite35_69|) .cse11 (= v_~z$w_buff1~0_126 v_~z$w_buff1~0_127) .cse1) (and .cse2 (or (and (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite35_70|) .cse11 .cse3) (and .cse4 (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite34_78|) .cse5 .cse6 (= |v_ULTIMATE.start_main_#t~ite34_78| |v_ULTIMATE.start_main_#t~ite35_70|))) (= v_~z$w_buff1~0_126 |v_ULTIMATE.start_main_#t~ite35_70|)))) (or (and .cse2 (= v_~z~0_149 v_~z~0_151)) (and (= v_~z$mem_tmp~0_36 v_~z~0_149) .cse1)) (= v_~z$flush_delayed~0_62 0) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite46_82| |v_ULTIMATE.start_main_#t~ite46_81|))) (or (and (= v_~z$r_buff1_thd0~0_209 |v_ULTIMATE.start_main_#t~ite47_74|) .cse12 .cse2 (= v_~z$r_buff1_thd0~0_208 |v_ULTIMATE.start_main_#t~ite47_74|)) (and (= |v_ULTIMATE.start_main_#t~ite47_74| |v_ULTIMATE.start_main_#t~ite47_73|) .cse12 (= v_~z$r_buff1_thd0~0_209 v_~z$r_buff1_thd0~0_208) .cse1))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite40_59| |v_ULTIMATE.start_main_#t~ite40_60|))) (or (and .cse2 (= v_~z$w_buff1_used~0_303 |v_ULTIMATE.start_main_#t~ite41_54|) (let ((.cse13 (= (mod v_~z$w_buff0_used~0_413 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite40_60| |v_ULTIMATE.start_main_#t~ite41_54|) (= |v_ULTIMATE.start_main_#t~ite40_60| 0) .cse4 .cse6 (not .cse13)) (and .cse14 (= v_~z$w_buff1_used~0_304 |v_ULTIMATE.start_main_#t~ite41_54|) (or .cse15 .cse16 .cse13))))) (and (= |v_ULTIMATE.start_main_#t~ite41_54| |v_ULTIMATE.start_main_#t~ite41_53|) (= v_~z$w_buff1_used~0_304 v_~z$w_buff1_used~0_303) .cse14 .cse1))) (= |v_ULTIMATE.start_main_#t~nondet28_45| v_~weak$$choice2~0_84))))) InVars {ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_61|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_81|, ~z$w_buff1~0=v_~z$w_buff1~0_127, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_63|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_264, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_209, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_39|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_45|, ~y~0=v_~y~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_414, ~z$w_buff0~0=v_~z$w_buff0~0_134, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_304, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_69|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_83|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_87|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_67|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_77|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_59|, ~z~0=v_~z~0_150, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_60|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_80|, ~z$w_buff1~0=v_~z$w_buff1~0_126, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_50|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_74|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_48|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_263, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_36|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_208, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_38|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_44|, ~y~0=v_~y~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_413, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_44|, ~z$w_buff0~0=v_~z$w_buff0~0_133, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_303, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_68|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_48|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~z$flush_delayed~0=v_~z$flush_delayed~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_86|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_66|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_58|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_40|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_76|, ~weak$$choice0~0=v_~weak$$choice0~0_19, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_52|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_58|, ~z~0=v_~z~0_149, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~x~0=v_~x~0_35} AuxVars[|v_ULTIMATE.start_main_#t~ite44_64|, |v_ULTIMATE.start_main_#t~ite41_54|, |v_ULTIMATE.start_main_#t~ite43_76|, |v_ULTIMATE.start_main_#t~ite40_60|, |v_ULTIMATE.start_main_#t~ite29_62|, |v_ULTIMATE.start_main_#t~ite31_68|, |v_ULTIMATE.start_main_#t~ite46_82|, |v_ULTIMATE.start_main_#t~ite47_74|, |v_ULTIMATE.start_main_#t~ite32_60|, |v_ULTIMATE.start_main_#t~ite38_84|, |v_ULTIMATE.start_main_#t~ite34_78|, v_~z~0_151, |v_ULTIMATE.start_main_#t~ite35_70|, |v_ULTIMATE.start_main_#t~ite37_88|] AssignedVars[ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet27, ULTIMATE.start_main_#t~nondet28, ULTIMATE.start___VERIFIER_assert_#in~expression, ~z$mem_tmp~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0, ~weak$$choice2~0][9], [P1Thread1of1ForFork1InUse, 193#true, P3Thread1of1ForFork3InUse, Black: 198#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), 204#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0)), Black: 137#(= ~y~0 0), Black: 143#(= ~__unbuffered_p3_EAX~0 0), Black: 205#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1)), Black: 148#(= ~x~0 0), 151#true, 90#L766true, Black: 217#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 221#true, Black: 153#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 154#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 100#L827true, Black: 224#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 163#(= ~y~0 1), Black: 226#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 223#(= ~__unbuffered_cnt~0 0), 166#true, 104#L791true, 48#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 177#(and (= ~x~0 ~z~0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2)), Black: 170#(and (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2)), Black: 173#(not (= 2 ~x~0)), Black: 175#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0))), 183#true, 58#P0EXITtrue, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 187#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0))]) [2021-03-25 04:47:23,242 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 04:47:23,242 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 04:47:23,242 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 04:47:23,243 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 04:47:23,285 INFO L129 PetriNetUnfolder]: 1143/2138 cut-off events. [2021-03-25 04:47:23,285 INFO L130 PetriNetUnfolder]: For 5393/6160 co-relation queries the response was YES. [2021-03-25 04:47:23,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7397 conditions, 2138 events. 1143/2138 cut-off events. For 5393/6160 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 16391 event pairs, 386 based on Foata normal form. 21/1853 useless extension candidates. Maximal degree in co-relation 7363. Up to 1510 conditions per place. [2021-03-25 04:47:23,327 INFO L142 LiptonReduction]: Number of co-enabled transitions 1334 [2021-03-25 04:47:23,826 INFO L154 LiptonReduction]: Checked pairs total: 465 [2021-03-25 04:47:23,826 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:23,827 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 765 [2021-03-25 04:47:23,828 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 77 transitions, 655 flow [2021-03-25 04:47:23,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 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-25 04:47:23,828 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:23,828 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-25 04:47:23,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:47:23,829 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:23,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:23,829 INFO L82 PathProgramCache]: Analyzing trace with hash 711169508, now seen corresponding path program 1 times [2021-03-25 04:47:23,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:23,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313933515] [2021-03-25 04:47:23,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:23,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:23,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:23,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:23,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:23,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:23,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:23,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:23,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:47:23,878 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-25 04:47:23,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313933515] [2021-03-25 04:47:23,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:23,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:47:23,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595980614] [2021-03-25 04:47:23,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:47:23,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:23,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:47:23,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:47:23,880 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 202 [2021-03-25 04:47:23,881 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 77 transitions, 655 flow. Second operand has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:23,881 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:23,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 202 [2021-03-25 04:47:23,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:24,239 INFO L129 PetriNetUnfolder]: 1094/2160 cut-off events. [2021-03-25 04:47:24,240 INFO L130 PetriNetUnfolder]: For 5511/11747 co-relation queries the response was YES. [2021-03-25 04:47:24,253 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8637 conditions, 2160 events. 1094/2160 cut-off events. For 5511/11747 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 16866 event pairs, 117 based on Foata normal form. 569/2444 useless extension candidates. Maximal degree in co-relation 8601. Up to 1549 conditions per place. [2021-03-25 04:47:24,269 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 14 selfloop transitions, 19 changer transitions 0/89 dead transitions. [2021-03-25 04:47:24,269 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 89 transitions, 762 flow [2021-03-25 04:47:24,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:47:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:47:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1203 transitions. [2021-03-25 04:47:24,272 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8507779349363508 [2021-03-25 04:47:24,272 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1203 transitions. [2021-03-25 04:47:24,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1203 transitions. [2021-03-25 04:47:24,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:24,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1203 transitions. [2021-03-25 04:47:24,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 171.85714285714286) internal successors, (1203), 7 states have internal predecessors, (1203), 0 states have call successors, (0), 0 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-25 04:47:24,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 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-25 04:47:24,278 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 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-25 04:47:24,278 INFO L185 Difference]: Start difference. First operand has 81 places, 77 transitions, 655 flow. Second operand 7 states and 1203 transitions. [2021-03-25 04:47:24,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 89 transitions, 762 flow [2021-03-25 04:47:24,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 89 transitions, 757 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:47:24,290 INFO L241 Difference]: Finished difference. Result has 89 places, 83 transitions, 749 flow [2021-03-25 04:47:24,291 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=749, PETRI_PLACES=89, PETRI_TRANSITIONS=83} [2021-03-25 04:47:24,291 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2021-03-25 04:47:24,291 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:24,291 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 83 transitions, 749 flow [2021-03-25 04:47:24,291 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 83 transitions, 749 flow [2021-03-25 04:47:24,292 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 83 transitions, 749 flow [2021-03-25 04:47:24,485 INFO L129 PetriNetUnfolder]: 858/1760 cut-off events. [2021-03-25 04:47:24,485 INFO L130 PetriNetUnfolder]: For 7173/9513 co-relation queries the response was YES. [2021-03-25 04:47:24,499 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8592 conditions, 1760 events. 858/1760 cut-off events. For 7173/9513 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 14232 event pairs, 101 based on Foata normal form. 45/1602 useless extension candidates. Maximal degree in co-relation 8554. Up to 1333 conditions per place. [2021-03-25 04:47:24,526 INFO L142 LiptonReduction]: Number of co-enabled transitions 1580 [2021-03-25 04:47:24,571 INFO L154 LiptonReduction]: Checked pairs total: 513 [2021-03-25 04:47:24,571 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:24,571 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 280 [2021-03-25 04:47:24,572 INFO L480 AbstractCegarLoop]: Abstraction has has 89 places, 83 transitions, 749 flow [2021-03-25 04:47:24,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:24,572 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:24,572 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-25 04:47:24,572 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 04:47:24,572 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:24,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:24,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1816264184, now seen corresponding path program 1 times [2021-03-25 04:47:24,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:24,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022733027] [2021-03-25 04:47:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:24,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:24,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:47:24,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:24,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:24,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:24,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:24,634 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-25 04:47:24,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022733027] [2021-03-25 04:47:24,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:24,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:47:24,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88392679] [2021-03-25 04:47:24,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:47:24,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:24,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:47:24,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:47:24,636 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 202 [2021-03-25 04:47:24,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 83 transitions, 749 flow. Second operand has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:24,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:24,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 202 [2021-03-25 04:47:24,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:24,998 INFO L129 PetriNetUnfolder]: 1405/2908 cut-off events. [2021-03-25 04:47:24,998 INFO L130 PetriNetUnfolder]: For 13705/19285 co-relation queries the response was YES. [2021-03-25 04:47:25,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14146 conditions, 2908 events. 1405/2908 cut-off events. For 13705/19285 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 25186 event pairs, 212 based on Foata normal form. 103/2665 useless extension candidates. Maximal degree in co-relation 14106. Up to 2226 conditions per place. [2021-03-25 04:47:25,040 INFO L132 encePairwiseOnDemand]: 199/202 looper letters, 4 selfloop transitions, 2 changer transitions 3/85 dead transitions. [2021-03-25 04:47:25,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 85 transitions, 783 flow [2021-03-25 04:47:25,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:47:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:47:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 715 transitions. [2021-03-25 04:47:25,042 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8849009900990099 [2021-03-25 04:47:25,043 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 715 transitions. [2021-03-25 04:47:25,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 715 transitions. [2021-03-25 04:47:25,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:25,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 715 transitions. [2021-03-25 04:47:25,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 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-25 04:47:25,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 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-25 04:47:25,046 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 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-25 04:47:25,046 INFO L185 Difference]: Start difference. First operand has 89 places, 83 transitions, 749 flow. Second operand 4 states and 715 transitions. [2021-03-25 04:47:25,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 85 transitions, 783 flow [2021-03-25 04:47:25,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 85 transitions, 733 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-25 04:47:25,118 INFO L241 Difference]: Finished difference. Result has 91 places, 81 transitions, 669 flow [2021-03-25 04:47:25,118 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=669, PETRI_PLACES=91, PETRI_TRANSITIONS=81} [2021-03-25 04:47:25,118 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 34 predicate places. [2021-03-25 04:47:25,118 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:25,118 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 81 transitions, 669 flow [2021-03-25 04:47:25,119 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 81 transitions, 669 flow [2021-03-25 04:47:25,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 81 transitions, 669 flow [2021-03-25 04:47:25,468 INFO L129 PetriNetUnfolder]: 1434/2857 cut-off events. [2021-03-25 04:47:25,468 INFO L130 PetriNetUnfolder]: For 11703/13136 co-relation queries the response was YES. [2021-03-25 04:47:25,492 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12184 conditions, 2857 events. 1434/2857 cut-off events. For 11703/13136 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 24783 event pairs, 196 based on Foata normal form. 52/2500 useless extension candidates. Maximal degree in co-relation 12145. Up to 1916 conditions per place. [2021-03-25 04:47:25,534 INFO L142 LiptonReduction]: Number of co-enabled transitions 1566 [2021-03-25 04:47:25,726 INFO L154 LiptonReduction]: Checked pairs total: 53 [2021-03-25 04:47:25,726 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:47:25,726 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 608 [2021-03-25 04:47:25,726 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 81 transitions, 672 flow [2021-03-25 04:47:25,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:25,727 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:25,727 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-25 04:47:25,727 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 04:47:25,727 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:25,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:25,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1537717679, now seen corresponding path program 1 times [2021-03-25 04:47:25,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:25,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708573815] [2021-03-25 04:47:25,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:25,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:25,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:25,814 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-25 04:47:25,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 04:47:25,835 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-25 04:47:25,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 04:47:25,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:25,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:25,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:25,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:25,869 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-25 04:47:25,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708573815] [2021-03-25 04:47:25,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:25,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:47:25,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757512869] [2021-03-25 04:47:25,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:47:25,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:25,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:47:25,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:47:25,871 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 203 [2021-03-25 04:47:25,883 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 81 transitions, 672 flow. Second operand has 6 states, 6 states have (on average 161.0) internal successors, (966), 6 states have internal predecessors, (966), 0 states have call successors, (0), 0 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-25 04:47:25,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:25,884 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 203 [2021-03-25 04:47:25,884 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:26,446 INFO L129 PetriNetUnfolder]: 2124/4032 cut-off events. [2021-03-25 04:47:26,446 INFO L130 PetriNetUnfolder]: For 22143/25535 co-relation queries the response was YES. [2021-03-25 04:47:26,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18386 conditions, 4032 events. 2124/4032 cut-off events. For 22143/25535 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 34891 event pairs, 303 based on Foata normal form. 147/3654 useless extension candidates. Maximal degree in co-relation 18345. Up to 2736 conditions per place. [2021-03-25 04:47:26,547 INFO L132 encePairwiseOnDemand]: 198/203 looper letters, 10 selfloop transitions, 15 changer transitions 15/83 dead transitions. [2021-03-25 04:47:26,547 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 83 transitions, 768 flow [2021-03-25 04:47:26,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:47:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:47:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 976 transitions. [2021-03-25 04:47:26,550 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8013136288998358 [2021-03-25 04:47:26,550 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 976 transitions. [2021-03-25 04:47:26,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 976 transitions. [2021-03-25 04:47:26,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:26,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 976 transitions. [2021-03-25 04:47:26,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 162.66666666666666) internal successors, (976), 6 states have internal predecessors, (976), 0 states have call successors, (0), 0 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-25 04:47:26,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 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-25 04:47:26,555 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 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-25 04:47:26,556 INFO L185 Difference]: Start difference. First operand has 91 places, 81 transitions, 672 flow. Second operand 6 states and 976 transitions. [2021-03-25 04:47:26,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 83 transitions, 768 flow [2021-03-25 04:47:26,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 83 transitions, 766 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:47:26,623 INFO L241 Difference]: Finished difference. Result has 96 places, 66 transitions, 559 flow [2021-03-25 04:47:26,623 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=559, PETRI_PLACES=96, PETRI_TRANSITIONS=66} [2021-03-25 04:47:26,624 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 39 predicate places. [2021-03-25 04:47:26,624 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:26,624 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 66 transitions, 559 flow [2021-03-25 04:47:26,624 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 66 transitions, 559 flow [2021-03-25 04:47:26,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 93 places, 66 transitions, 559 flow [2021-03-25 04:47:26,915 INFO L129 PetriNetUnfolder]: 1705/3219 cut-off events. [2021-03-25 04:47:26,915 INFO L130 PetriNetUnfolder]: For 13268/15489 co-relation queries the response was YES. [2021-03-25 04:47:26,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13968 conditions, 3219 events. 1705/3219 cut-off events. For 13268/15489 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 27427 event pairs, 287 based on Foata normal form. 49/2713 useless extension candidates. Maximal degree in co-relation 13927. Up to 2354 conditions per place. [2021-03-25 04:47:26,978 INFO L142 LiptonReduction]: Number of co-enabled transitions 1214 [2021-03-25 04:47:27,161 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 04:47:27,558 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2021-03-25 04:47:27,687 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-25 04:47:28,445 INFO L154 LiptonReduction]: Checked pairs total: 152 [2021-03-25 04:47:28,445 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:47:28,445 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1821 [2021-03-25 04:47:28,445 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 64 transitions, 555 flow [2021-03-25 04:47:28,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 161.0) internal successors, (966), 6 states have internal predecessors, (966), 0 states have call successors, (0), 0 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-25 04:47:28,446 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:28,446 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-25 04:47:28,446 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 04:47:28,446 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:28,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:28,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1838330244, now seen corresponding path program 1 times [2021-03-25 04:47:28,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:28,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559513761] [2021-03-25 04:47:28,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:28,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:28,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:28,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:28,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:28,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:28,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:28,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:28,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:28,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:28,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:47:28,500 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-25 04:47:28,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559513761] [2021-03-25 04:47:28,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:28,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:47:28,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887815455] [2021-03-25 04:47:28,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:47:28,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:28,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:47:28,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:47:28,505 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 204 [2021-03-25 04:47:28,506 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 64 transitions, 555 flow. Second operand has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 0 states have call successors, (0), 0 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-25 04:47:28,506 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:28,506 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 204 [2021-03-25 04:47:28,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:28,846 INFO L129 PetriNetUnfolder]: 1360/2526 cut-off events. [2021-03-25 04:47:28,847 INFO L130 PetriNetUnfolder]: For 10558/14801 co-relation queries the response was YES. [2021-03-25 04:47:28,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11677 conditions, 2526 events. 1360/2526 cut-off events. For 10558/14801 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 19238 event pairs, 32 based on Foata normal form. 518/2736 useless extension candidates. Maximal degree in co-relation 11634. Up to 1830 conditions per place. [2021-03-25 04:47:28,865 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 10 selfloop transitions, 18 changer transitions 4/72 dead transitions. [2021-03-25 04:47:28,866 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 72 transitions, 695 flow [2021-03-25 04:47:28,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:47:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:47:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1217 transitions. [2021-03-25 04:47:28,869 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8522408963585434 [2021-03-25 04:47:28,870 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1217 transitions. [2021-03-25 04:47:28,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1217 transitions. [2021-03-25 04:47:28,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:28,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1217 transitions. [2021-03-25 04:47:28,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 173.85714285714286) internal successors, (1217), 7 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:28,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 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-25 04:47:28,875 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 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-25 04:47:28,875 INFO L185 Difference]: Start difference. First operand has 93 places, 64 transitions, 555 flow. Second operand 7 states and 1217 transitions. [2021-03-25 04:47:28,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 72 transitions, 695 flow [2021-03-25 04:47:28,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 72 transitions, 584 flow, removed 34 selfloop flow, removed 13 redundant places. [2021-03-25 04:47:28,898 INFO L241 Difference]: Finished difference. Result has 85 places, 65 transitions, 550 flow [2021-03-25 04:47:28,898 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=550, PETRI_PLACES=85, PETRI_TRANSITIONS=65} [2021-03-25 04:47:28,898 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 28 predicate places. [2021-03-25 04:47:28,899 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:28,899 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 65 transitions, 550 flow [2021-03-25 04:47:28,899 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 65 transitions, 550 flow [2021-03-25 04:47:28,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 65 transitions, 550 flow [2021-03-25 04:47:29,024 INFO L129 PetriNetUnfolder]: 661/1488 cut-off events. [2021-03-25 04:47:29,024 INFO L130 PetriNetUnfolder]: For 4805/5534 co-relation queries the response was YES. [2021-03-25 04:47:29,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7181 conditions, 1488 events. 661/1488 cut-off events. For 4805/5534 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 12088 event pairs, 32 based on Foata normal form. 4/1355 useless extension candidates. Maximal degree in co-relation 7145. Up to 1181 conditions per place. [2021-03-25 04:47:29,049 INFO L142 LiptonReduction]: Number of co-enabled transitions 920 [2021-03-25 04:47:29,276 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 04:47:29,658 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 04:47:29,765 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 04:47:30,054 INFO L154 LiptonReduction]: Checked pairs total: 38 [2021-03-25 04:47:30,055 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:47:30,055 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1156 [2021-03-25 04:47:30,055 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 64 transitions, 545 flow [2021-03-25 04:47:30,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 0 states have call successors, (0), 0 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-25 04:47:30,056 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:30,056 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-25 04:47:30,056 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 04:47:30,056 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:30,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:30,056 INFO L82 PathProgramCache]: Analyzing trace with hash 170785033, now seen corresponding path program 1 times [2021-03-25 04:47:30,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:30,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618121892] [2021-03-25 04:47:30,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:30,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:30,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:30,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:30,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:30,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:30,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:30,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:30,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:30,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:30,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:30,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:30,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:47:30,140 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-25 04:47:30,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618121892] [2021-03-25 04:47:30,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:30,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:47:30,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999136647] [2021-03-25 04:47:30,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:47:30,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:30,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:47:30,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:47:30,142 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 205 [2021-03-25 04:47:30,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 64 transitions, 545 flow. Second operand has 7 states, 7 states have (on average 170.85714285714286) internal successors, (1196), 7 states have internal predecessors, (1196), 0 states have call successors, (0), 0 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-25 04:47:30,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:30,144 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 205 [2021-03-25 04:47:30,144 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:30,387 INFO L129 PetriNetUnfolder]: 1063/1916 cut-off events. [2021-03-25 04:47:30,387 INFO L130 PetriNetUnfolder]: For 5399/8419 co-relation queries the response was YES. [2021-03-25 04:47:30,397 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9269 conditions, 1916 events. 1063/1916 cut-off events. For 5399/8419 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 13332 event pairs, 0 based on Foata normal form. 301/1930 useless extension candidates. Maximal degree in co-relation 9231. Up to 1317 conditions per place. [2021-03-25 04:47:30,400 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 6 selfloop transitions, 18 changer transitions 13/69 dead transitions. [2021-03-25 04:47:30,400 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 69 transitions, 611 flow [2021-03-25 04:47:30,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 04:47:30,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 04:47:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1391 transitions. [2021-03-25 04:47:30,403 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.848170731707317 [2021-03-25 04:47:30,404 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1391 transitions. [2021-03-25 04:47:30,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1391 transitions. [2021-03-25 04:47:30,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:30,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1391 transitions. [2021-03-25 04:47:30,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 173.875) internal successors, (1391), 8 states have internal predecessors, (1391), 0 states have call successors, (0), 0 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-25 04:47:30,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 205.0) internal successors, (1845), 9 states have internal predecessors, (1845), 0 states have call successors, (0), 0 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-25 04:47:30,410 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 205.0) internal successors, (1845), 9 states have internal predecessors, (1845), 0 states have call successors, (0), 0 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-25 04:47:30,410 INFO L185 Difference]: Start difference. First operand has 85 places, 64 transitions, 545 flow. Second operand 8 states and 1391 transitions. [2021-03-25 04:47:30,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 69 transitions, 611 flow [2021-03-25 04:47:30,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 69 transitions, 546 flow, removed 21 selfloop flow, removed 6 redundant places. [2021-03-25 04:47:30,464 INFO L241 Difference]: Finished difference. Result has 87 places, 53 transitions, 411 flow [2021-03-25 04:47:30,464 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=411, PETRI_PLACES=87, PETRI_TRANSITIONS=53} [2021-03-25 04:47:30,464 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2021-03-25 04:47:30,464 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:30,464 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 53 transitions, 411 flow [2021-03-25 04:47:30,465 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 53 transitions, 411 flow [2021-03-25 04:47:30,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 53 transitions, 411 flow [2021-03-25 04:47:30,503 INFO L129 PetriNetUnfolder]: 205/516 cut-off events. [2021-03-25 04:47:30,504 INFO L130 PetriNetUnfolder]: For 1301/1464 co-relation queries the response was YES. [2021-03-25 04:47:30,506 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2264 conditions, 516 events. 205/516 cut-off events. For 1301/1464 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3427 event pairs, 0 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 2228. Up to 245 conditions per place. [2021-03-25 04:47:30,519 INFO L142 LiptonReduction]: Number of co-enabled transitions 564 [2021-03-25 04:47:31,179 WARN L205 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-25 04:47:31,388 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-25 04:47:32,688 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 338 DAG size of output: 260 [2021-03-25 04:47:33,186 WARN L205 SmtUtils]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-03-25 04:47:33,451 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 04:47:33,677 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 04:47:34,174 WARN L205 SmtUtils]: Spent 493.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 04:47:34,647 WARN L205 SmtUtils]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 04:47:34,652 INFO L154 LiptonReduction]: Checked pairs total: 10 [2021-03-25 04:47:34,653 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:47:34,653 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4189 [2021-03-25 04:47:34,653 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 50 transitions, 395 flow [2021-03-25 04:47:34,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 170.85714285714286) internal successors, (1196), 7 states have internal predecessors, (1196), 0 states have call successors, (0), 0 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-25 04:47:34,654 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:34,654 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-25 04:47:34,654 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 04:47:34,654 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:34,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:34,654 INFO L82 PathProgramCache]: Analyzing trace with hash -158649216, now seen corresponding path program 1 times [2021-03-25 04:47:34,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:34,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609646049] [2021-03-25 04:47:34,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:47:34,679 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:47:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:47:34,707 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:47:34,753 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:47:34,753 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:47:34,753 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 04:47:34,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:47:34 BasicIcfg [2021-03-25 04:47:34,846 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:47:34,846 INFO L168 Benchmark]: Toolchain (without parser) took 29867.96 ms. Allocated memory was 350.2 MB in the beginning and 771.8 MB in the end (delta: 421.5 MB). Free memory was 313.7 MB in the beginning and 441.4 MB in the end (delta: -127.7 MB). Peak memory consumption was 296.5 MB. Max. memory is 16.0 GB. [2021-03-25 04:47:34,847 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 350.2 MB. Free memory was 331.9 MB in the beginning and 331.8 MB in the end (delta: 70.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:47:34,847 INFO L168 Benchmark]: CACSL2BoogieTranslator took 518.42 ms. Allocated memory is still 350.2 MB. Free memory was 313.5 MB in the beginning and 308.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:47:34,847 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.03 ms. Allocated memory is still 350.2 MB. Free memory was 308.2 MB in the beginning and 306.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:47:34,847 INFO L168 Benchmark]: Boogie Preprocessor took 31.05 ms. Allocated memory is still 350.2 MB. Free memory was 306.1 MB in the beginning and 302.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:47:34,847 INFO L168 Benchmark]: RCFGBuilder took 1655.40 ms. Allocated memory is still 350.2 MB. Free memory was 302.9 MB in the beginning and 274.9 MB in the end (delta: 28.1 MB). Peak memory consumption was 157.6 MB. Max. memory is 16.0 GB. [2021-03-25 04:47:34,848 INFO L168 Benchmark]: TraceAbstraction took 27585.62 ms. Allocated memory was 350.2 MB in the beginning and 771.8 MB in the end (delta: 421.5 MB). Free memory was 274.3 MB in the beginning and 441.4 MB in the end (delta: -167.1 MB). Peak memory consumption was 255.5 MB. Max. memory is 16.0 GB. [2021-03-25 04:47:34,848 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 350.2 MB. Free memory was 331.9 MB in the beginning and 331.8 MB in the end (delta: 70.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 518.42 ms. Allocated memory is still 350.2 MB. Free memory was 313.5 MB in the beginning and 308.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 56.03 ms. Allocated memory is still 350.2 MB. Free memory was 308.2 MB in the beginning and 306.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 31.05 ms. Allocated memory is still 350.2 MB. Free memory was 306.1 MB in the beginning and 302.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1655.40 ms. Allocated memory is still 350.2 MB. Free memory was 302.9 MB in the beginning and 274.9 MB in the end (delta: 28.1 MB). Peak memory consumption was 157.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 27585.62 ms. Allocated memory was 350.2 MB in the beginning and 771.8 MB in the end (delta: 421.5 MB). Free memory was 274.3 MB in the beginning and 441.4 MB in the end (delta: -167.1 MB). Peak memory consumption was 255.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7807.7ms, 123 PlacesBefore, 57 PlacesAfterwards, 112 TransitionsBefore, 45 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4306 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2405, positive: 2302, positive conditional: 0, positive unconditional: 2302, negative: 103, negative conditional: 0, negative unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1267, positive: 1239, positive conditional: 0, positive unconditional: 1239, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1267, positive: 1239, positive conditional: 0, positive unconditional: 1239, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2405, positive: 1063, positive conditional: 0, positive unconditional: 1063, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 1267, unknown conditional: 0, unknown unconditional: 1267] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 157, Positive conditional cache size: 0, Positive unconditional cache size: 157, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3784.7ms, 53 PlacesBefore, 38 PlacesAfterwards, 37 TransitionsBefore, 27 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 2232 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 643, positive: 514, positive conditional: 0, positive unconditional: 514, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 33, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 643, positive: 491, positive conditional: 0, positive unconditional: 491, negative: 119, negative conditional: 0, negative unconditional: 119, unknown: 33, unknown conditional: 0, unknown unconditional: 33] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 165, Positive conditional cache size: 0, Positive unconditional cache size: 165, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.8ms, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 397 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 117, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 22, negative conditional: 0, negative unconditional: 22, 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: 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] , Cache Queries: [ total: 117, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 165, Positive conditional cache size: 0, Positive unconditional cache size: 165, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 157.7ms, 41 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 698 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 190, positive: 152, positive conditional: 0, positive unconditional: 152, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 190, positive: 149, positive conditional: 0, positive unconditional: 149, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 142, Positive conditional cache size: 0, Positive unconditional cache size: 142, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.2ms, 41 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 257 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 36, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 36, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.1ms, 47 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 588 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 192 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 72, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 146, Positive conditional cache size: 0, Positive unconditional cache size: 146, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.3ms, 50 PlacesBefore, 50 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 588 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 244 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 79, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 79, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 76.5ms, 60 PlacesBefore, 60 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 486 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 129, positive: 113, positive conditional: 0, positive unconditional: 113, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 129, positive: 112, positive conditional: 0, positive unconditional: 112, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 85.3ms, 65 PlacesBefore, 65 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 782 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 687 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 161, positive: 139, positive conditional: 0, positive unconditional: 139, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 161, positive: 137, positive conditional: 0, positive unconditional: 137, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 114.1ms, 69 PlacesBefore, 69 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 864 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 778 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 166, positive: 143, positive conditional: 0, positive unconditional: 143, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 166, positive: 141, positive conditional: 0, positive unconditional: 141, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 152, Positive conditional cache size: 0, Positive unconditional cache size: 152, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 117.5ms, 75 PlacesBefore, 75 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 914 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 861 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 175, positive: 150, positive conditional: 0, positive unconditional: 150, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 175, positive: 149, positive conditional: 0, positive unconditional: 149, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 153, Positive conditional cache size: 0, Positive unconditional cache size: 153, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 104.3ms, 77 PlacesBefore, 77 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 956 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 794 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 186, positive: 163, positive conditional: 0, positive unconditional: 163, negative: 23, negative conditional: 0, negative unconditional: 23, 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: 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] , Cache Queries: [ total: 186, positive: 163, positive conditional: 0, positive unconditional: 163, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 153, Positive conditional cache size: 0, Positive unconditional cache size: 153, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 764.3ms, 81 PlacesBefore, 81 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1334 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 465 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 165, positive: 153, positive conditional: 0, positive unconditional: 153, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 165, positive: 152, positive conditional: 0, positive unconditional: 152, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 154, Positive conditional cache size: 0, Positive unconditional cache size: 154, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 280.0ms, 89 PlacesBefore, 89 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 1580 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 513 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 177, positive: 165, positive conditional: 0, positive unconditional: 165, negative: 12, negative conditional: 0, negative unconditional: 12, 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: 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] , Cache Queries: [ total: 177, positive: 165, positive conditional: 0, positive unconditional: 165, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 154, Positive conditional cache size: 0, Positive unconditional cache size: 154, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 607.3ms, 91 PlacesBefore, 91 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 1566 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 53 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 53, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 53, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 149, Positive conditional cache size: 0, Positive unconditional cache size: 149, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1820.8ms, 96 PlacesBefore, 93 PlacesAfterwards, 66 TransitionsBefore, 64 TransitionsAfterwards, 1214 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 152 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 132, positive: 128, positive conditional: 0, positive unconditional: 128, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 132, positive: 114, positive conditional: 0, positive unconditional: 114, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1155.7ms, 85 PlacesBefore, 85 PlacesAfterwards, 65 TransitionsBefore, 64 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 38 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 38, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 143, Positive conditional cache size: 0, Positive unconditional cache size: 143, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4188.0ms, 87 PlacesBefore, 82 PlacesAfterwards, 53 TransitionsBefore, 50 TransitionsAfterwards, 564 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 10 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 130, Positive conditional cache size: 0, Positive unconditional cache size: 130, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - 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_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1253; [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1254; [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1255; [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1256; [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 27401.8ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 4053.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7880.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 68 SDtfs, 49 SDslu, 37 SDs, 0 SdLazy, 464 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 472.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 484.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=749occurred in iteration=13, InterpolantAutomatonStates: 85, 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: 71.3ms SsaConstructionTime, 550.2ms SatisfiabilityAnalysisTime, 1187.3ms InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 1529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...