/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:33:27,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:33:27,384 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:33:27,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:33:27,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:33:27,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:33:27,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:33:27,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:33:27,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:33:27,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:33:27,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:33:27,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:33:27,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:33:27,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:33:27,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:33:27,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:33:27,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:33:27,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:33:27,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:33:27,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:33:27,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:33:27,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:33:27,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:33:27,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:33:27,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:33:27,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:33:27,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:33:27,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:33:27,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:33:27,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:33:27,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:33:27,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:33:27,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:33:27,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:33:27,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:33:27,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:33:27,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:33:27,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:33:27,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:33:27,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:33:27,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:33:27,479 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-RepeatedSemanticLbe.epf [2021-03-25 14:33:27,517 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:33:27,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:33:27,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:33:27,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:33:27,521 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:33:27,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:33:27,521 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:33:27,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:33:27,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:33:27,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:33:27,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:33:27,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:33:27,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:33:27,523 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:33:27,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:33:27,523 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:33:27,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:33:27,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:33:27,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:33:27,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:33:27,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:33:27,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:33:27,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:33:27,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:33:27,525 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:33:27,525 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:33:27,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:33:27,525 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:33:27,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:33:27,525 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 14:33:27,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:33:27,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:33:27,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:33:27,894 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:33:27,895 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:33:27,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_pso.opt.i [2021-03-25 14:33:27,963 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7ac88c6/844af74e9e204b0bbae5a08829346f5a/FLAGb436d754f [2021-03-25 14:33:28,494 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:33:28,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_pso.opt.i [2021-03-25 14:33:28,512 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7ac88c6/844af74e9e204b0bbae5a08829346f5a/FLAGb436d754f [2021-03-25 14:33:28,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7ac88c6/844af74e9e204b0bbae5a08829346f5a [2021-03-25 14:33:28,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:33:28,783 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:33:28,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:33:28,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:33:28,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:33:28,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:33:28" (1/1) ... [2021-03-25 14:33:28,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca7363c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:28, skipping insertion in model container [2021-03-25 14:33:28,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:33:28" (1/1) ... [2021-03-25 14:33:28,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:33:28,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:33:28,952 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/mix044_pso.opt.i[948,961] [2021-03-25 14:33:29,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:33:29,219 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:33:29,230 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/mix044_pso.opt.i[948,961] [2021-03-25 14:33:29,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:33:29,358 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:33:29,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:29 WrapperNode [2021-03-25 14:33:29,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:33:29,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:33:29,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:33:29,362 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:33:29,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:29" (1/1) ... [2021-03-25 14:33:29,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:29" (1/1) ... [2021-03-25 14:33:29,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:33:29,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:33:29,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:33:29,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:33:29,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:29" (1/1) ... [2021-03-25 14:33:29,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:29" (1/1) ... [2021-03-25 14:33:29,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:29" (1/1) ... [2021-03-25 14:33:29,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:29" (1/1) ... [2021-03-25 14:33:29,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:29" (1/1) ... [2021-03-25 14:33:29,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:29" (1/1) ... [2021-03-25 14:33:29,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:29" (1/1) ... [2021-03-25 14:33:29,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:33:29,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:33:29,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:33:29,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:33:29,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:29" (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 14:33:29,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:33:29,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:33:29,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:33:29,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:33:29,556 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:33:29,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:33:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:33:29,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:33:29,558 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:33:29,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:33:29,558 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:33:29,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:33:29,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:33:29,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:33:29,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:33:29,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:33:29,560 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 14:33:31,302 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:33:31,302 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:33:31,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:33:31 BoogieIcfgContainer [2021-03-25 14:33:31,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:33:31,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:33:31,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:33:31,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:33:31,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:33:28" (1/3) ... [2021-03-25 14:33:31,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4f3cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:33:31, skipping insertion in model container [2021-03-25 14:33:31,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:29" (2/3) ... [2021-03-25 14:33:31,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4f3cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:33:31, skipping insertion in model container [2021-03-25 14:33:31,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:33:31" (3/3) ... [2021-03-25 14:33:31,312 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_pso.opt.i [2021-03-25 14:33:31,318 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:33:31,322 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:33:31,323 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:33:31,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,362 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,362 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,363 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,363 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,364 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,365 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,365 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,365 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,369 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,369 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,370 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,370 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,370 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,370 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,370 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,371 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,378 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,378 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,380 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,380 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,381 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,382 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,393 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,393 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,393 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,394 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:31,395 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:33:31,411 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:33:31,437 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:33:31,438 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:33:31,438 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:33:31,438 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:33:31,438 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:33:31,438 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:33:31,438 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:33:31,438 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:33:31,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 14:33:31,506 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:33:31,506 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:33:31,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 14:33:31,518 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 14:33:31,522 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-25 14:33:31,524 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:31,536 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 14:33:31,538 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 14:33:31,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-25 14:33:31,574 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:33:31,574 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:33:31,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 14:33:31,579 INFO L142 LiptonReduction]: Number of co-enabled transitions 2598 [2021-03-25 14:33:32,135 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2021-03-25 14:33:33,176 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:33:33,554 WARN L205 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 14:33:33,696 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:33:34,418 WARN L205 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-25 14:33:34,689 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 14:33:36,036 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-25 14:33:36,604 WARN L205 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 14:33:37,971 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 14:33:38,257 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 14:33:39,508 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 269 DAG size of output: 268 [2021-03-25 14:33:40,101 WARN L205 SmtUtils]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:33:40,326 INFO L154 LiptonReduction]: Checked pairs total: 4166 [2021-03-25 14:33:40,326 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-25 14:33:40,332 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8810 [2021-03-25 14:33:40,352 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-25 14:33:40,353 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:33:40,353 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:40,354 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] [2021-03-25 14:33:40,354 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 14:33:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:40,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1459371111, now seen corresponding path program 1 times [2021-03-25 14:33:40,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:40,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988497651] [2021-03-25 14:33:40,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:40,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:40,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:40,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:40,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:40,612 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 14:33:40,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988497651] [2021-03-25 14:33:40,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:40,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:33:40,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625465804] [2021-03-25 14:33:40,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:33:40,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:40,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:33:40,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:33:40,636 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 191 [2021-03-25 14:33:40,641 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 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 14:33:40,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:40,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 191 [2021-03-25 14:33:40,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:40,712 INFO L129 PetriNetUnfolder]: 23/111 cut-off events. [2021-03-25 14:33:40,713 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:33:40,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 111 events. 23/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 394 event pairs, 3 based on Foata normal form. 6/110 useless extension candidates. Maximal degree in co-relation 148. Up to 37 conditions per place. [2021-03-25 14:33:40,715 INFO L132 encePairwiseOnDemand]: 187/191 looper letters, 7 selfloop transitions, 2 changer transitions 5/49 dead transitions. [2021-03-25 14:33:40,716 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 132 flow [2021-03-25 14:33:40,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:33:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:33:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2021-03-25 14:33:40,733 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9144851657940664 [2021-03-25 14:33:40,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2021-03-25 14:33:40,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2021-03-25 14:33:40,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:40,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2021-03-25 14:33:40,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 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 14:33:40,758 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 14:33:40,759 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 14:33:40,760 INFO L185 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 3 states and 524 transitions. [2021-03-25 14:33:40,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 132 flow [2021-03-25 14:33:40,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:33:40,766 INFO L241 Difference]: Finished difference. Result has 56 places, 41 transitions, 94 flow [2021-03-25 14:33:40,768 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2021-03-25 14:33:40,769 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2021-03-25 14:33:40,769 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:40,769 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 41 transitions, 94 flow [2021-03-25 14:33:40,769 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 41 transitions, 94 flow [2021-03-25 14:33:40,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 94 flow [2021-03-25 14:33:40,774 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-25 14:33:40,774 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:33:40,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:33:40,775 INFO L142 LiptonReduction]: Number of co-enabled transitions 392 [2021-03-25 14:33:41,159 WARN L205 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-25 14:33:41,502 WARN L205 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-25 14:33:42,828 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 270 DAG size of output: 269 [2021-03-25 14:33:43,463 WARN L205 SmtUtils]: Spent 633.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 14:33:44,629 INFO L154 LiptonReduction]: Checked pairs total: 1274 [2021-03-25 14:33:44,629 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 14:33:44,629 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3860 [2021-03-25 14:33:44,630 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-25 14:33:44,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 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 14:33:44,631 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:44,631 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:44,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:33:44,632 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 14:33:44,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:44,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1826671133, now seen corresponding path program 1 times [2021-03-25 14:33:44,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:44,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396399527] [2021-03-25 14:33:44,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:44,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:44,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:44,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:44,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:44,730 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:33:44,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:33:44,733 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 14:33:44,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396399527] [2021-03-25 14:33:44,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:44,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:33:44,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867295517] [2021-03-25 14:33:44,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:33:44,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:44,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:33:44,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:33:44,737 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 203 [2021-03-25 14:33:44,738 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 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 14:33:44,738 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:44,738 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 203 [2021-03-25 14:33:44,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:44,760 INFO L129 PetriNetUnfolder]: 3/39 cut-off events. [2021-03-25 14:33:44,760 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:33:44,760 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 5. Compared 73 event pairs, 1 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-25 14:33:44,761 INFO L132 encePairwiseOnDemand]: 199/203 looper letters, 3 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2021-03-25 14:33:44,761 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 86 flow [2021-03-25 14:33:44,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:33:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:33:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2021-03-25 14:33:44,763 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8981937602627258 [2021-03-25 14:33:44,763 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2021-03-25 14:33:44,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2021-03-25 14:33:44,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:44,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2021-03-25 14:33:44,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 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 14:33:44,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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 14:33:44,769 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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 14:33:44,769 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 547 transitions. [2021-03-25 14:33:44,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 86 flow [2021-03-25 14:33:44,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:33:44,770 INFO L241 Difference]: Finished difference. Result has 41 places, 31 transitions, 85 flow [2021-03-25 14:33:44,770 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2021-03-25 14:33:44,771 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -19 predicate places. [2021-03-25 14:33:44,771 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:44,771 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 85 flow [2021-03-25 14:33:44,772 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 85 flow [2021-03-25 14:33:44,772 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 85 flow [2021-03-25 14:33:44,778 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-25 14:33:44,778 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:33:44,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 37 events. 3/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 1 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-03-25 14:33:44,779 INFO L142 LiptonReduction]: Number of co-enabled transitions 388 [2021-03-25 14:33:44,949 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-03-25 14:33:45,616 WARN L205 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 14:33:45,766 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:33:46,112 WARN L205 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 14:33:46,269 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:33:46,273 INFO L154 LiptonReduction]: Checked pairs total: 1047 [2021-03-25 14:33:46,273 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:33:46,273 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1502 [2021-03-25 14:33:46,274 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 79 flow [2021-03-25 14:33:46,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 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 14:33:46,275 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:46,275 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:46,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:33:46,275 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 14:33:46,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:46,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2131944862, now seen corresponding path program 1 times [2021-03-25 14:33:46,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:46,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704224389] [2021-03-25 14:33:46,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:46,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:46,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:46,425 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 14:33:46,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704224389] [2021-03-25 14:33:46,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:46,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:33:46,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058164529] [2021-03-25 14:33:46,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:33:46,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:46,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:33:46,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:33:46,436 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 206 [2021-03-25 14:33:46,436 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 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 14:33:46,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:46,436 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 206 [2021-03-25 14:33:46,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:46,452 INFO L129 PetriNetUnfolder]: 3/36 cut-off events. [2021-03-25 14:33:46,452 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-25 14:33:46,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 36 events. 3/36 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 1 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 55. Up to 10 conditions per place. [2021-03-25 14:33:46,453 INFO L132 encePairwiseOnDemand]: 203/206 looper letters, 1 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2021-03-25 14:33:46,453 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 28 transitions, 85 flow [2021-03-25 14:33:46,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:33:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:33:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2021-03-25 14:33:46,455 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8996763754045307 [2021-03-25 14:33:46,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2021-03-25 14:33:46,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2021-03-25 14:33:46,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:46,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2021-03-25 14:33:46,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 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 14:33:46,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 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 14:33:46,459 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 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 14:33:46,459 INFO L185 Difference]: Start difference. First operand has 38 places, 28 transitions, 79 flow. Second operand 3 states and 556 transitions. [2021-03-25 14:33:46,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 28 transitions, 85 flow [2021-03-25 14:33:46,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 28 transitions, 82 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:33:46,460 INFO L241 Difference]: Finished difference. Result has 40 places, 28 transitions, 84 flow [2021-03-25 14:33:46,460 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2021-03-25 14:33:46,460 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -20 predicate places. [2021-03-25 14:33:46,461 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:46,461 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 84 flow [2021-03-25 14:33:46,461 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 84 flow [2021-03-25 14:33:46,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 84 flow [2021-03-25 14:33:46,467 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-03-25 14:33:46,467 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 14:33:46,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 34 events. 3/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2021-03-25 14:33:46,468 INFO L142 LiptonReduction]: Number of co-enabled transitions 386 [2021-03-25 14:33:46,470 INFO L154 LiptonReduction]: Checked pairs total: 333 [2021-03-25 14:33:46,470 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:46,470 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-25 14:33:46,471 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 84 flow [2021-03-25 14:33:46,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 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 14:33:46,471 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:46,472 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:46,472 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:33:46,472 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 14:33:46,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:46,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1719635881, now seen corresponding path program 1 times [2021-03-25 14:33:46,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:46,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900192520] [2021-03-25 14:33:46,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:46,630 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-25 14:33:46,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:33:46,680 INFO L142 QuantifierPusher]: treesize reduction 40, result has 54.0 percent of original size [2021-03-25 14:33:46,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 14:33:46,703 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 14:33:46,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:33:46,726 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 14:33:46,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900192520] [2021-03-25 14:33:46,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:46,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:33:46,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390023770] [2021-03-25 14:33:46,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:33:46,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:46,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:33:46,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:33:46,732 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 206 [2021-03-25 14:33:46,733 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:46,733 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:46,734 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 206 [2021-03-25 14:33:46,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:46,821 INFO L129 PetriNetUnfolder]: 37/112 cut-off events. [2021-03-25 14:33:46,821 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-03-25 14:33:46,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 112 events. 37/112 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 377 event pairs, 22 based on Foata normal form. 1/102 useless extension candidates. Maximal degree in co-relation 230. Up to 55 conditions per place. [2021-03-25 14:33:46,824 INFO L132 encePairwiseOnDemand]: 201/206 looper letters, 8 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2021-03-25 14:33:46,824 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 125 flow [2021-03-25 14:33:46,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:33:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:33:46,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 678 transitions. [2021-03-25 14:33:46,832 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8228155339805825 [2021-03-25 14:33:46,832 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 678 transitions. [2021-03-25 14:33:46,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 678 transitions. [2021-03-25 14:33:46,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:46,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 678 transitions. [2021-03-25 14:33:46,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.5) internal successors, (678), 4 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:46,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 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 14:33:46,838 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 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 14:33:46,838 INFO L185 Difference]: Start difference. First operand has 40 places, 28 transitions, 84 flow. Second operand 4 states and 678 transitions. [2021-03-25 14:33:46,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 125 flow [2021-03-25 14:33:46,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 119 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:33:46,840 INFO L241 Difference]: Finished difference. Result has 43 places, 32 transitions, 113 flow [2021-03-25 14:33:46,841 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2021-03-25 14:33:46,842 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -17 predicate places. [2021-03-25 14:33:46,842 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:46,845 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 113 flow [2021-03-25 14:33:46,846 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 32 transitions, 113 flow [2021-03-25 14:33:46,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 113 flow [2021-03-25 14:33:46,853 INFO L129 PetriNetUnfolder]: 11/54 cut-off events. [2021-03-25 14:33:46,853 INFO L130 PetriNetUnfolder]: For 34/37 co-relation queries the response was YES. [2021-03-25 14:33:46,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 54 events. 11/54 cut-off events. For 34/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 151 event pairs, 5 based on Foata normal form. 1/48 useless extension candidates. Maximal degree in co-relation 110. Up to 20 conditions per place. [2021-03-25 14:33:46,854 INFO L142 LiptonReduction]: Number of co-enabled transitions 468 [2021-03-25 14:33:46,857 INFO L154 LiptonReduction]: Checked pairs total: 349 [2021-03-25 14:33:46,857 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:46,857 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-25 14:33:46,858 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 113 flow [2021-03-25 14:33:46,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:46,859 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:46,859 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:46,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:33:46,860 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 14:33:46,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:46,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1193190939, now seen corresponding path program 1 times [2021-03-25 14:33:46,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:46,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008222529] [2021-03-25 14:33:46,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:46,991 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-25 14:33:46,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 14:33:47,021 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-25 14:33:47,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 14:33:47,065 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.4 percent of original size [2021-03-25 14:33:47,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 14:33:47,086 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-25 14:33:47,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 14:33:47,111 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 14:33:47,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008222529] [2021-03-25 14:33:47,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:47,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:33:47,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043771355] [2021-03-25 14:33:47,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:33:47,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:47,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:33:47,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:33:47,114 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 206 [2021-03-25 14:33:47,115 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 113 flow. Second operand has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 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 14:33:47,115 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:47,115 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 206 [2021-03-25 14:33:47,115 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:47,223 INFO L129 PetriNetUnfolder]: 40/118 cut-off events. [2021-03-25 14:33:47,223 INFO L130 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2021-03-25 14:33:47,224 INFO L84 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 118 events. 40/118 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 400 event pairs, 7 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 284. Up to 55 conditions per place. [2021-03-25 14:33:47,225 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 9 selfloop transitions, 9 changer transitions 0/39 dead transitions. [2021-03-25 14:33:47,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 168 flow [2021-03-25 14:33:47,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:33:47,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:33:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 826 transitions. [2021-03-25 14:33:47,229 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8019417475728156 [2021-03-25 14:33:47,229 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 826 transitions. [2021-03-25 14:33:47,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 826 transitions. [2021-03-25 14:33:47,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:47,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 826 transitions. [2021-03-25 14:33:47,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.2) internal successors, (826), 5 states have internal predecessors, (826), 0 states have call successors, (0), 0 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 14:33:47,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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 14:33:47,234 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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 14:33:47,234 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 113 flow. Second operand 5 states and 826 transitions. [2021-03-25 14:33:47,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 168 flow [2021-03-25 14:33:47,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 14:33:47,238 INFO L241 Difference]: Finished difference. Result has 48 places, 37 transitions, 158 flow [2021-03-25 14:33:47,238 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2021-03-25 14:33:47,238 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -12 predicate places. [2021-03-25 14:33:47,238 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:47,238 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 37 transitions, 158 flow [2021-03-25 14:33:47,239 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 37 transitions, 158 flow [2021-03-25 14:33:47,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 37 transitions, 158 flow [2021-03-25 14:33:47,251 INFO L129 PetriNetUnfolder]: 19/73 cut-off events. [2021-03-25 14:33:47,251 INFO L130 PetriNetUnfolder]: For 76/88 co-relation queries the response was YES. [2021-03-25 14:33:47,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 73 events. 19/73 cut-off events. For 76/88 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 243 event pairs, 5 based on Foata normal form. 3/66 useless extension candidates. Maximal degree in co-relation 183. Up to 24 conditions per place. [2021-03-25 14:33:47,255 INFO L142 LiptonReduction]: Number of co-enabled transitions 566 [2021-03-25 14:33:47,261 INFO L154 LiptonReduction]: Checked pairs total: 426 [2021-03-25 14:33:47,262 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:47,262 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-25 14:33:47,262 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 158 flow [2021-03-25 14:33:47,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 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 14:33:47,263 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:47,263 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:47,263 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:33:47,263 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 14:33:47,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:47,264 INFO L82 PathProgramCache]: Analyzing trace with hash -639119263, now seen corresponding path program 2 times [2021-03-25 14:33:47,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:47,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662823229] [2021-03-25 14:33:47,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:47,369 INFO L142 QuantifierPusher]: treesize reduction 30, result has 18.9 percent of original size [2021-03-25 14:33:47,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:33:47,375 INFO L142 QuantifierPusher]: treesize reduction 30, result has 25.0 percent of original size [2021-03-25 14:33:47,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:33:47,384 INFO L142 QuantifierPusher]: treesize reduction 60, result has 21.1 percent of original size [2021-03-25 14:33:47,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:33:47,399 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.9 percent of original size [2021-03-25 14:33:47,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-25 14:33:47,433 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 14:33:47,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662823229] [2021-03-25 14:33:47,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:47,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:33:47,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016269305] [2021-03-25 14:33:47,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:33:47,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:47,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:33:47,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:33:47,436 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-25 14:33:47,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 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 14:33:47,437 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:47,437 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-25 14:33:47,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:47,522 INFO L129 PetriNetUnfolder]: 51/138 cut-off events. [2021-03-25 14:33:47,522 INFO L130 PetriNetUnfolder]: For 182/182 co-relation queries the response was YES. [2021-03-25 14:33:47,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 138 events. 51/138 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 13 based on Foata normal form. 1/124 useless extension candidates. Maximal degree in co-relation 427. Up to 72 conditions per place. [2021-03-25 14:33:47,524 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 12 selfloop transitions, 14 changer transitions 0/47 dead transitions. [2021-03-25 14:33:47,524 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 47 transitions, 268 flow [2021-03-25 14:33:47,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:33:47,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:33:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 871 transitions. [2021-03-25 14:33:47,527 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.845631067961165 [2021-03-25 14:33:47,527 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 871 transitions. [2021-03-25 14:33:47,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 871 transitions. [2021-03-25 14:33:47,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:47,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 871 transitions. [2021-03-25 14:33:47,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.2) internal successors, (871), 5 states have internal predecessors, (871), 0 states have call successors, (0), 0 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 14:33:47,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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 14:33:47,532 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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 14:33:47,532 INFO L185 Difference]: Start difference. First operand has 48 places, 37 transitions, 158 flow. Second operand 5 states and 871 transitions. [2021-03-25 14:33:47,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 47 transitions, 268 flow [2021-03-25 14:33:47,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 260 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-03-25 14:33:47,535 INFO L241 Difference]: Finished difference. Result has 54 places, 47 transitions, 268 flow [2021-03-25 14:33:47,535 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2021-03-25 14:33:47,535 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2021-03-25 14:33:47,536 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:47,536 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 268 flow [2021-03-25 14:33:47,536 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 268 flow [2021-03-25 14:33:47,536 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 268 flow [2021-03-25 14:33:47,553 INFO L129 PetriNetUnfolder]: 40/120 cut-off events. [2021-03-25 14:33:47,553 INFO L130 PetriNetUnfolder]: For 263/272 co-relation queries the response was YES. [2021-03-25 14:33:47,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 120 events. 40/120 cut-off events. For 263/272 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 468 event pairs, 5 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 403. Up to 44 conditions per place. [2021-03-25 14:33:47,556 INFO L142 LiptonReduction]: Number of co-enabled transitions 730 [2021-03-25 14:33:47,562 INFO L154 LiptonReduction]: Checked pairs total: 651 [2021-03-25 14:33:47,562 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:47,562 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-03-25 14:33:47,563 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 268 flow [2021-03-25 14:33:47,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 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 14:33:47,563 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:47,563 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:47,564 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:33:47,564 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 14:33:47,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:47,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1924841264, now seen corresponding path program 1 times [2021-03-25 14:33:47,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:47,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855208918] [2021-03-25 14:33:47,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:47,620 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 14:33:47,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:33:47,650 INFO L142 QuantifierPusher]: treesize reduction 11, result has 87.1 percent of original size [2021-03-25 14:33:47,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-03-25 14:33:47,692 INFO L142 QuantifierPusher]: treesize reduction 11, result has 88.0 percent of original size [2021-03-25 14:33:47,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 81 [2021-03-25 14:33:47,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:47,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:33:47,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:47,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:33:47,752 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 14:33:47,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855208918] [2021-03-25 14:33:47,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:47,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:33:47,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671564885] [2021-03-25 14:33:47,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:33:47,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:47,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:33:47,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:33:47,756 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 206 [2021-03-25 14:33:47,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 268 flow. Second operand has 7 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 0 states have call successors, (0), 0 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 14:33:47,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:47,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 206 [2021-03-25 14:33:47,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:47,991 INFO L129 PetriNetUnfolder]: 244/489 cut-off events. [2021-03-25 14:33:47,992 INFO L130 PetriNetUnfolder]: For 1055/1067 co-relation queries the response was YES. [2021-03-25 14:33:47,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1812 conditions, 489 events. 244/489 cut-off events. For 1055/1067 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2573 event pairs, 19 based on Foata normal form. 22/500 useless extension candidates. Maximal degree in co-relation 1791. Up to 252 conditions per place. [2021-03-25 14:33:47,998 INFO L132 encePairwiseOnDemand]: 197/206 looper letters, 28 selfloop transitions, 27 changer transitions 0/72 dead transitions. [2021-03-25 14:33:47,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 509 flow [2021-03-25 14:33:47,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:33:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:33:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1290 transitions. [2021-03-25 14:33:48,002 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7827669902912622 [2021-03-25 14:33:48,002 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1290 transitions. [2021-03-25 14:33:48,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1290 transitions. [2021-03-25 14:33:48,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:48,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1290 transitions. [2021-03-25 14:33:48,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 161.25) internal successors, (1290), 8 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:48,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 206.0) internal successors, (1854), 9 states have internal predecessors, (1854), 0 states have call successors, (0), 0 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 14:33:48,009 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 206.0) internal successors, (1854), 9 states have internal predecessors, (1854), 0 states have call successors, (0), 0 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 14:33:48,009 INFO L185 Difference]: Start difference. First operand has 54 places, 47 transitions, 268 flow. Second operand 8 states and 1290 transitions. [2021-03-25 14:33:48,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 509 flow [2021-03-25 14:33:48,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 490 flow, removed 9 selfloop flow, removed 1 redundant places. [2021-03-25 14:33:48,018 INFO L241 Difference]: Finished difference. Result has 64 places, 62 transitions, 444 flow [2021-03-25 14:33:48,018 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=444, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2021-03-25 14:33:48,018 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2021-03-25 14:33:48,018 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:48,018 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 62 transitions, 444 flow [2021-03-25 14:33:48,019 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 62 transitions, 444 flow [2021-03-25 14:33:48,019 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 62 transitions, 444 flow [2021-03-25 14:33:48,058 INFO L129 PetriNetUnfolder]: 100/288 cut-off events. [2021-03-25 14:33:48,058 INFO L130 PetriNetUnfolder]: For 1020/1074 co-relation queries the response was YES. [2021-03-25 14:33:48,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 288 events. 100/288 cut-off events. For 1020/1074 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1709 event pairs, 15 based on Foata normal form. 13/286 useless extension candidates. Maximal degree in co-relation 1092. Up to 88 conditions per place. [2021-03-25 14:33:48,064 INFO L142 LiptonReduction]: Number of co-enabled transitions 858 [2021-03-25 14:33:48,136 INFO L154 LiptonReduction]: Checked pairs total: 1178 [2021-03-25 14:33:48,136 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:48,136 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 118 [2021-03-25 14:33:48,138 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 444 flow [2021-03-25 14:33:48,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 0 states have call successors, (0), 0 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 14:33:48,138 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:48,138 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:48,138 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:33:48,138 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 14:33:48,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:48,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1457877594, now seen corresponding path program 1 times [2021-03-25 14:33:48,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:48,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535302757] [2021-03-25 14:33:48,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:48,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:48,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:48,202 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:33:48,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:33:48,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:48,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:48,210 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 14:33:48,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535302757] [2021-03-25 14:33:48,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:48,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:33:48,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936432051] [2021-03-25 14:33:48,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:33:48,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:48,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:33:48,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:33:48,212 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-25 14:33:48,213 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 444 flow. Second operand has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 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 14:33:48,213 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:48,213 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-25 14:33:48,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:48,465 INFO L129 PetriNetUnfolder]: 871/1473 cut-off events. [2021-03-25 14:33:48,465 INFO L130 PetriNetUnfolder]: For 3321/3964 co-relation queries the response was YES. [2021-03-25 14:33:48,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4605 conditions, 1473 events. 871/1473 cut-off events. For 3321/3964 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 9445 event pairs, 268 based on Foata normal form. 175/1349 useless extension candidates. Maximal degree in co-relation 4579. Up to 914 conditions per place. [2021-03-25 14:33:48,483 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 16 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2021-03-25 14:33:48,483 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 76 transitions, 524 flow [2021-03-25 14:33:48,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:33:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:33:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 879 transitions. [2021-03-25 14:33:48,486 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8533980582524272 [2021-03-25 14:33:48,486 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 879 transitions. [2021-03-25 14:33:48,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 879 transitions. [2021-03-25 14:33:48,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:48,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 879 transitions. [2021-03-25 14:33:48,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:48,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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 14:33:48,491 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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 14:33:48,491 INFO L185 Difference]: Start difference. First operand has 64 places, 62 transitions, 444 flow. Second operand 5 states and 879 transitions. [2021-03-25 14:33:48,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 76 transitions, 524 flow [2021-03-25 14:33:48,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 503 flow, removed 10 selfloop flow, removed 1 redundant places. [2021-03-25 14:33:48,500 INFO L241 Difference]: Finished difference. Result has 70 places, 71 transitions, 514 flow [2021-03-25 14:33:48,500 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=514, PETRI_PLACES=70, PETRI_TRANSITIONS=71} [2021-03-25 14:33:48,500 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 10 predicate places. [2021-03-25 14:33:48,500 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:48,501 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 71 transitions, 514 flow [2021-03-25 14:33:48,501 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 71 transitions, 514 flow [2021-03-25 14:33:48,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 71 transitions, 514 flow [2021-03-25 14:33:48,622 INFO L129 PetriNetUnfolder]: 589/1099 cut-off events. [2021-03-25 14:33:48,623 INFO L130 PetriNetUnfolder]: For 2923/3266 co-relation queries the response was YES. [2021-03-25 14:33:48,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4133 conditions, 1099 events. 589/1099 cut-off events. For 2923/3266 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 7359 event pairs, 172 based on Foata normal form. 33/1027 useless extension candidates. Maximal degree in co-relation 4105. Up to 664 conditions per place. [2021-03-25 14:33:48,643 INFO L142 LiptonReduction]: Number of co-enabled transitions 1148 [2021-03-25 14:33:48,761 INFO L154 LiptonReduction]: Checked pairs total: 673 [2021-03-25 14:33:48,761 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:48,761 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 261 [2021-03-25 14:33:48,762 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 71 transitions, 514 flow [2021-03-25 14:33:48,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 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 14:33:48,762 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:48,762 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:48,763 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:33:48,763 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 14:33:48,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:48,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1227077792, now seen corresponding path program 1 times [2021-03-25 14:33:48,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:48,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724727718] [2021-03-25 14:33:48,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:48,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:48,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:48,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:48,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:48,848 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:33:48,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:33:48,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:48,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:48,857 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 14:33:48,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724727718] [2021-03-25 14:33:48,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:48,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:33:48,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833302786] [2021-03-25 14:33:48,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:33:48,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:48,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:33:48,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:33:48,859 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-25 14:33:48,860 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 71 transitions, 514 flow. Second operand has 5 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 14:33:48,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:48,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-25 14:33:48,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:49,060 INFO L129 PetriNetUnfolder]: 635/1140 cut-off events. [2021-03-25 14:33:49,061 INFO L130 PetriNetUnfolder]: For 4197/7638 co-relation queries the response was YES. [2021-03-25 14:33:49,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4737 conditions, 1140 events. 635/1140 cut-off events. For 4197/7638 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 7183 event pairs, 53 based on Foata normal form. 363/1334 useless extension candidates. Maximal degree in co-relation 4707. Up to 770 conditions per place. [2021-03-25 14:33:49,076 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 17 selfloop transitions, 19 changer transitions 0/86 dead transitions. [2021-03-25 14:33:49,076 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 86 transitions, 666 flow [2021-03-25 14:33:49,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:33:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:33:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1231 transitions. [2021-03-25 14:33:49,080 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8536754507628294 [2021-03-25 14:33:49,080 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1231 transitions. [2021-03-25 14:33:49,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1231 transitions. [2021-03-25 14:33:49,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:49,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1231 transitions. [2021-03-25 14:33:49,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 175.85714285714286) internal successors, (1231), 7 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:49,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 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 14:33:49,086 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 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 14:33:49,086 INFO L185 Difference]: Start difference. First operand has 70 places, 71 transitions, 514 flow. Second operand 7 states and 1231 transitions. [2021-03-25 14:33:49,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 86 transitions, 666 flow [2021-03-25 14:33:49,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 86 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:33:49,093 INFO L241 Difference]: Finished difference. Result has 78 places, 80 transitions, 659 flow [2021-03-25 14:33:49,093 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=659, PETRI_PLACES=78, PETRI_TRANSITIONS=80} [2021-03-25 14:33:49,094 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 18 predicate places. [2021-03-25 14:33:49,094 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:49,094 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 80 transitions, 659 flow [2021-03-25 14:33:49,094 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 80 transitions, 659 flow [2021-03-25 14:33:49,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 80 transitions, 659 flow [2021-03-25 14:33:49,190 INFO L129 PetriNetUnfolder]: 395/833 cut-off events. [2021-03-25 14:33:49,190 INFO L130 PetriNetUnfolder]: For 3937/4640 co-relation queries the response was YES. [2021-03-25 14:33:49,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4110 conditions, 833 events. 395/833 cut-off events. For 3937/4640 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 5777 event pairs, 40 based on Foata normal form. 40/825 useless extension candidates. Maximal degree in co-relation 4078. Up to 536 conditions per place. [2021-03-25 14:33:49,208 INFO L142 LiptonReduction]: Number of co-enabled transitions 1322 [2021-03-25 14:33:49,273 INFO L154 LiptonReduction]: Checked pairs total: 920 [2021-03-25 14:33:49,273 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:49,273 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 179 [2021-03-25 14:33:49,274 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 659 flow [2021-03-25 14:33:49,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 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 14:33:49,275 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:49,275 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 14:33:49,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:33:49,275 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 14:33:49,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:49,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1050381240, now seen corresponding path program 1 times [2021-03-25 14:33:49,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:49,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215861027] [2021-03-25 14:33:49,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:49,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:49,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:49,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:49,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:49,364 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-25 14:33:49,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 14:33:49,381 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-25 14:33:49,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 14:33:49,395 INFO L142 QuantifierPusher]: treesize reduction 14, result has 39.1 percent of original size [2021-03-25 14:33:49,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:33:49,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:49,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:33:49,408 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 14:33:49,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215861027] [2021-03-25 14:33:49,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:49,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:33:49,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107630214] [2021-03-25 14:33:49,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:33:49,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:49,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:33:49,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:33:49,410 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 206 [2021-03-25 14:33:49,411 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 659 flow. Second operand has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 0 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 14:33:49,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:49,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 206 [2021-03-25 14:33:49,412 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:49,810 INFO L129 PetriNetUnfolder]: 1217/2323 cut-off events. [2021-03-25 14:33:49,810 INFO L130 PetriNetUnfolder]: For 15619/19248 co-relation queries the response was YES. [2021-03-25 14:33:49,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11869 conditions, 2323 events. 1217/2323 cut-off events. For 15619/19248 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 18073 event pairs, 105 based on Foata normal form. 210/2321 useless extension candidates. Maximal degree in co-relation 11835. Up to 1544 conditions per place. [2021-03-25 14:33:49,842 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 59 selfloop transitions, 25 changer transitions 11/141 dead transitions. [2021-03-25 14:33:49,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 141 transitions, 1433 flow [2021-03-25 14:33:49,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:33:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:33:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1177 transitions. [2021-03-25 14:33:49,846 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8162274618585298 [2021-03-25 14:33:49,846 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1177 transitions. [2021-03-25 14:33:49,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1177 transitions. [2021-03-25 14:33:49,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:49,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1177 transitions. [2021-03-25 14:33:49,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 168.14285714285714) internal successors, (1177), 7 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:49,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 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 14:33:49,852 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 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 14:33:49,853 INFO L185 Difference]: Start difference. First operand has 78 places, 80 transitions, 659 flow. Second operand 7 states and 1177 transitions. [2021-03-25 14:33:49,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 141 transitions, 1433 flow [2021-03-25 14:33:49,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 141 transitions, 1383 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-25 14:33:49,953 INFO L241 Difference]: Finished difference. Result has 86 places, 100 transitions, 951 flow [2021-03-25 14:33:49,954 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=951, PETRI_PLACES=86, PETRI_TRANSITIONS=100} [2021-03-25 14:33:49,954 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 26 predicate places. [2021-03-25 14:33:49,954 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:49,954 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 100 transitions, 951 flow [2021-03-25 14:33:49,955 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 100 transitions, 951 flow [2021-03-25 14:33:49,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 100 transitions, 951 flow [2021-03-25 14:33:50,196 INFO L129 PetriNetUnfolder]: 1170/2242 cut-off events. [2021-03-25 14:33:50,196 INFO L130 PetriNetUnfolder]: For 15048/16137 co-relation queries the response was YES. [2021-03-25 14:33:50,213 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10316 conditions, 2242 events. 1170/2242 cut-off events. For 15048/16137 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 17917 event pairs, 83 based on Foata normal form. 137/2190 useless extension candidates. Maximal degree in co-relation 10280. Up to 1283 conditions per place. [2021-03-25 14:33:50,290 INFO L142 LiptonReduction]: Number of co-enabled transitions 1840 [2021-03-25 14:33:50,689 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:33:51,160 WARN L205 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-25 14:33:51,318 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 14:33:51,572 INFO L154 LiptonReduction]: Checked pairs total: 623 [2021-03-25 14:33:51,572 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:33:51,572 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1618 [2021-03-25 14:33:51,576 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 100 transitions, 959 flow [2021-03-25 14:33:51,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 0 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 14:33:51,576 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:51,576 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 14:33:51,577 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:33:51,577 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 14:33:51,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:51,577 INFO L82 PathProgramCache]: Analyzing trace with hash 624760454, now seen corresponding path program 1 times [2021-03-25 14:33:51,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:51,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815498098] [2021-03-25 14:33:51,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:51,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:51,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:51,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:51,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:51,644 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 14:33:51,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815498098] [2021-03-25 14:33:51,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:51,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:33:51,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079778064] [2021-03-25 14:33:51,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:33:51,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:51,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:33:51,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:33:51,645 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 209 [2021-03-25 14:33:51,646 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 100 transitions, 959 flow. Second operand has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:51,646 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:51,646 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 209 [2021-03-25 14:33:51,647 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:52,023 INFO L129 PetriNetUnfolder]: 1761/3262 cut-off events. [2021-03-25 14:33:52,023 INFO L130 PetriNetUnfolder]: For 24559/26509 co-relation queries the response was YES. [2021-03-25 14:33:52,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15288 conditions, 3262 events. 1761/3262 cut-off events. For 24559/26509 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 25994 event pairs, 161 based on Foata normal form. 211/3093 useless extension candidates. Maximal degree in co-relation 15250. Up to 2008 conditions per place. [2021-03-25 14:33:52,062 INFO L132 encePairwiseOnDemand]: 204/209 looper letters, 4 selfloop transitions, 8 changer transitions 3/100 dead transitions. [2021-03-25 14:33:52,062 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 100 transitions, 985 flow [2021-03-25 14:33:52,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:33:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:33:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 566 transitions. [2021-03-25 14:33:52,064 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9027113237639554 [2021-03-25 14:33:52,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 566 transitions. [2021-03-25 14:33:52,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 566 transitions. [2021-03-25 14:33:52,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:52,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 566 transitions. [2021-03-25 14:33:52,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:52,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 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 14:33:52,067 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 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 14:33:52,067 INFO L185 Difference]: Start difference. First operand has 86 places, 100 transitions, 959 flow. Second operand 3 states and 566 transitions. [2021-03-25 14:33:52,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 100 transitions, 985 flow [2021-03-25 14:33:52,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 100 transitions, 981 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-03-25 14:33:52,140 INFO L241 Difference]: Finished difference. Result has 89 places, 97 transitions, 938 flow [2021-03-25 14:33:52,141 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=938, PETRI_PLACES=89, PETRI_TRANSITIONS=97} [2021-03-25 14:33:52,141 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 29 predicate places. [2021-03-25 14:33:52,141 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:52,141 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 97 transitions, 938 flow [2021-03-25 14:33:52,141 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 97 transitions, 938 flow [2021-03-25 14:33:52,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 97 transitions, 938 flow [2021-03-25 14:33:52,505 INFO L129 PetriNetUnfolder]: 1848/3324 cut-off events. [2021-03-25 14:33:52,505 INFO L130 PetriNetUnfolder]: For 22336/24073 co-relation queries the response was YES. [2021-03-25 14:33:52,529 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15375 conditions, 3324 events. 1848/3324 cut-off events. For 22336/24073 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 26205 event pairs, 142 based on Foata normal form. 150/3094 useless extension candidates. Maximal degree in co-relation 15337. Up to 2088 conditions per place. [2021-03-25 14:33:52,568 INFO L142 LiptonReduction]: Number of co-enabled transitions 1784 [2021-03-25 14:33:53,036 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:33:53,516 WARN L205 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-25 14:33:53,657 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 14:33:53,818 INFO L154 LiptonReduction]: Checked pairs total: 650 [2021-03-25 14:33:53,818 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:33:53,818 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1677 [2021-03-25 14:33:53,819 INFO L480 AbstractCegarLoop]: Abstraction has has 89 places, 97 transitions, 940 flow [2021-03-25 14:33:53,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:53,819 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:53,819 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 14:33:53,819 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:33:53,819 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 14:33:53,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:53,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1545108976, now seen corresponding path program 1 times [2021-03-25 14:33:53,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:53,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638132578] [2021-03-25 14:33:53,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:53,902 INFO L142 QuantifierPusher]: treesize reduction 31, result has 57.5 percent of original size [2021-03-25 14:33:53,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 14:33:53,934 INFO L142 QuantifierPusher]: treesize reduction 31, result has 59.2 percent of original size [2021-03-25 14:33:53,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 14:33:53,969 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-25 14:33:53,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:33:53,981 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-25 14:33:53,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:33:53,993 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.6 percent of original size [2021-03-25 14:33:53,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 14:33:54,026 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 14:33:54,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638132578] [2021-03-25 14:33:54,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:54,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:33:54,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203654510] [2021-03-25 14:33:54,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:33:54,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:54,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:33:54,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:33:54,030 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 210 [2021-03-25 14:33:54,031 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 97 transitions, 940 flow. Second operand has 7 states, 7 states have (on average 164.85714285714286) internal successors, (1154), 7 states have internal predecessors, (1154), 0 states have call successors, (0), 0 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 14:33:54,031 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:54,032 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 210 [2021-03-25 14:33:54,032 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:54,654 INFO L129 PetriNetUnfolder]: 1936/3530 cut-off events. [2021-03-25 14:33:54,654 INFO L130 PetriNetUnfolder]: For 28558/31118 co-relation queries the response was YES. [2021-03-25 14:33:54,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17126 conditions, 3530 events. 1936/3530 cut-off events. For 28558/31118 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 28210 event pairs, 171 based on Foata normal form. 256/3356 useless extension candidates. Maximal degree in co-relation 17086. Up to 2172 conditions per place. [2021-03-25 14:33:54,698 INFO L132 encePairwiseOnDemand]: 201/210 looper letters, 18 selfloop transitions, 41 changer transitions 6/111 dead transitions. [2021-03-25 14:33:54,699 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 111 transitions, 1259 flow [2021-03-25 14:33:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:33:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:33:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1008 transitions. [2021-03-25 14:33:54,701 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8 [2021-03-25 14:33:54,701 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1008 transitions. [2021-03-25 14:33:54,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1008 transitions. [2021-03-25 14:33:54,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:54,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1008 transitions. [2021-03-25 14:33:54,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 0 states have call successors, (0), 0 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 14:33:54,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 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 14:33:54,706 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 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 14:33:54,706 INFO L185 Difference]: Start difference. First operand has 89 places, 97 transitions, 940 flow. Second operand 6 states and 1008 transitions. [2021-03-25 14:33:54,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 111 transitions, 1259 flow [2021-03-25 14:33:54,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 111 transitions, 1245 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-25 14:33:54,778 INFO L241 Difference]: Finished difference. Result has 96 places, 102 transitions, 1141 flow [2021-03-25 14:33:54,778 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1141, PETRI_PLACES=96, PETRI_TRANSITIONS=102} [2021-03-25 14:33:54,778 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 36 predicate places. [2021-03-25 14:33:54,778 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:54,778 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 102 transitions, 1141 flow [2021-03-25 14:33:54,779 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 102 transitions, 1141 flow [2021-03-25 14:33:54,779 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 102 transitions, 1141 flow [2021-03-25 14:33:55,131 INFO L129 PetriNetUnfolder]: 1833/3413 cut-off events. [2021-03-25 14:33:55,132 INFO L130 PetriNetUnfolder]: For 30141/32194 co-relation queries the response was YES. [2021-03-25 14:33:55,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16671 conditions, 3413 events. 1833/3413 cut-off events. For 30141/32194 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 28311 event pairs, 160 based on Foata normal form. 193/3216 useless extension candidates. Maximal degree in co-relation 16629. Up to 2125 conditions per place. [2021-03-25 14:33:55,200 INFO L142 LiptonReduction]: Number of co-enabled transitions 1908 [2021-03-25 14:33:55,784 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:33:56,151 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:33:56,272 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:33:56,447 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:33:56,832 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 14:33:56,964 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:33:57,190 INFO L154 LiptonReduction]: Checked pairs total: 858 [2021-03-25 14:33:57,190 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:33:57,190 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2412 [2021-03-25 14:33:57,191 INFO L480 AbstractCegarLoop]: Abstraction has has 96 places, 102 transitions, 1145 flow [2021-03-25 14:33:57,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 164.85714285714286) internal successors, (1154), 7 states have internal predecessors, (1154), 0 states have call successors, (0), 0 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 14:33:57,191 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:57,192 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 14:33:57,192 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:33:57,192 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 14:33:57,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:57,192 INFO L82 PathProgramCache]: Analyzing trace with hash -388417510, now seen corresponding path program 1 times [2021-03-25 14:33:57,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:57,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422344179] [2021-03-25 14:33:57,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:57,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:57,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:57,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:57,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:57,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:57,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:57,245 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:33:57,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:33:57,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:57,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:33:57,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422344179] [2021-03-25 14:33:57,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:57,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:33:57,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989834080] [2021-03-25 14:33:57,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:33:57,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:57,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:33:57,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:33:57,256 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 212 [2021-03-25 14:33:57,257 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 102 transitions, 1145 flow. Second operand has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 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 14:33:57,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:57,257 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 212 [2021-03-25 14:33:57,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:57,846 INFO L129 PetriNetUnfolder]: 2103/3744 cut-off events. [2021-03-25 14:33:57,846 INFO L130 PetriNetUnfolder]: For 37227/50992 co-relation queries the response was YES. [2021-03-25 14:33:57,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17797 conditions, 3744 events. 2103/3744 cut-off events. For 37227/50992 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 29595 event pairs, 19 based on Foata normal form. 1827/4996 useless extension candidates. Maximal degree in co-relation 17753. Up to 2243 conditions per place. [2021-03-25 14:33:57,888 INFO L132 encePairwiseOnDemand]: 205/212 looper letters, 12 selfloop transitions, 28 changer transitions 6/106 dead transitions. [2021-03-25 14:33:57,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 106 transitions, 1180 flow [2021-03-25 14:33:57,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:33:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:33:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1637 transitions. [2021-03-25 14:33:57,893 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8579664570230608 [2021-03-25 14:33:57,894 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1637 transitions. [2021-03-25 14:33:57,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1637 transitions. [2021-03-25 14:33:57,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:57,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1637 transitions. [2021-03-25 14:33:57,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 181.88888888888889) internal successors, (1637), 9 states have internal predecessors, (1637), 0 states have call successors, (0), 0 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 14:33:57,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 states have internal predecessors, (2120), 0 states have call successors, (0), 0 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 14:33:57,913 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 states have internal predecessors, (2120), 0 states have call successors, (0), 0 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 14:33:57,913 INFO L185 Difference]: Start difference. First operand has 96 places, 102 transitions, 1145 flow. Second operand 9 states and 1637 transitions. [2021-03-25 14:33:57,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 106 transitions, 1180 flow [2021-03-25 14:33:57,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 106 transitions, 1113 flow, removed 14 selfloop flow, removed 6 redundant places. [2021-03-25 14:33:57,985 INFO L241 Difference]: Finished difference. Result has 101 places, 97 transitions, 1054 flow [2021-03-25 14:33:57,985 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1054, PETRI_PLACES=101, PETRI_TRANSITIONS=97} [2021-03-25 14:33:57,985 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 41 predicate places. [2021-03-25 14:33:57,985 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:57,985 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 97 transitions, 1054 flow [2021-03-25 14:33:57,986 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 97 transitions, 1054 flow [2021-03-25 14:33:57,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 97 transitions, 1054 flow [2021-03-25 14:33:58,241 INFO L129 PetriNetUnfolder]: 1206/2530 cut-off events. [2021-03-25 14:33:58,241 INFO L130 PetriNetUnfolder]: For 22684/24366 co-relation queries the response was YES. [2021-03-25 14:33:58,262 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13790 conditions, 2530 events. 1206/2530 cut-off events. For 22684/24366 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 22153 event pairs, 23 based on Foata normal form. 68/2348 useless extension candidates. Maximal degree in co-relation 13747. Up to 1512 conditions per place. [2021-03-25 14:33:58,298 INFO L142 LiptonReduction]: Number of co-enabled transitions 1958 [2021-03-25 14:33:58,567 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:33:58,982 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-25 14:33:59,119 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 14:33:59,210 INFO L154 LiptonReduction]: Checked pairs total: 818 [2021-03-25 14:33:59,210 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:33:59,210 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1225 [2021-03-25 14:33:59,210 INFO L480 AbstractCegarLoop]: Abstraction has has 101 places, 97 transitions, 1056 flow [2021-03-25 14:33:59,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 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 14:33:59,211 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:59,211 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 14:33:59,211 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:33:59,211 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 14:33:59,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:59,212 INFO L82 PathProgramCache]: Analyzing trace with hash -315770536, now seen corresponding path program 1 times [2021-03-25 14:33:59,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:59,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950049357] [2021-03-25 14:33:59,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:59,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:59,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:59,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:59,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:59,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:59,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:59,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:59,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:59,271 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:33:59,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:33:59,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:59,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:59,279 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 14:33:59,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950049357] [2021-03-25 14:33:59,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:59,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:33:59,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979772668] [2021-03-25 14:33:59,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:33:59,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:59,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:33:59,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:33:59,282 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 213 [2021-03-25 14:33:59,282 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 97 transitions, 1056 flow. Second operand has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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 14:33:59,283 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:59,283 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 213 [2021-03-25 14:33:59,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:59,837 INFO L129 PetriNetUnfolder]: 2011/3553 cut-off events. [2021-03-25 14:33:59,837 INFO L130 PetriNetUnfolder]: For 38354/51458 co-relation queries the response was YES. [2021-03-25 14:33:59,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20273 conditions, 3553 events. 2011/3553 cut-off events. For 38354/51458 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 27839 event pairs, 2 based on Foata normal form. 1447/4363 useless extension candidates. Maximal degree in co-relation 20228. Up to 2138 conditions per place. [2021-03-25 14:33:59,874 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 6 selfloop transitions, 33 changer transitions 9/102 dead transitions. [2021-03-25 14:33:59,874 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 102 transitions, 1137 flow [2021-03-25 14:33:59,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 14:33:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 14:33:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2004 transitions. [2021-03-25 14:33:59,879 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8553137003841229 [2021-03-25 14:33:59,879 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2004 transitions. [2021-03-25 14:33:59,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2004 transitions. [2021-03-25 14:33:59,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:59,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2004 transitions. [2021-03-25 14:33:59,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 182.1818181818182) internal successors, (2004), 11 states have internal predecessors, (2004), 0 states have call successors, (0), 0 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 14:33:59,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 213.0) internal successors, (2556), 12 states have internal predecessors, (2556), 0 states have call successors, (0), 0 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 14:33:59,887 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 213.0) internal successors, (2556), 12 states have internal predecessors, (2556), 0 states have call successors, (0), 0 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 14:33:59,887 INFO L185 Difference]: Start difference. First operand has 101 places, 97 transitions, 1056 flow. Second operand 11 states and 2004 transitions. [2021-03-25 14:33:59,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 102 transitions, 1137 flow [2021-03-25 14:34:00,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 102 transitions, 992 flow, removed 44 selfloop flow, removed 6 redundant places. [2021-03-25 14:34:00,224 INFO L241 Difference]: Finished difference. Result has 108 places, 90 transitions, 890 flow [2021-03-25 14:34:00,225 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=890, PETRI_PLACES=108, PETRI_TRANSITIONS=90} [2021-03-25 14:34:00,225 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 48 predicate places. [2021-03-25 14:34:00,225 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:00,225 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 90 transitions, 890 flow [2021-03-25 14:34:00,225 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 90 transitions, 890 flow [2021-03-25 14:34:00,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 90 transitions, 890 flow [2021-03-25 14:34:00,276 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([966] L771-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75) (= |v_P1Thread1of1ForFork1_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base][36], [P0Thread1of1ForFork0InUse, 258#(<= ~__unbuffered_cnt~0 2), P2Thread1of1ForFork2InUse, Black: 194#(= ~__unbuffered_cnt~0 0), 8#P1EXITtrue, Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 259#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 265#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 138#(= ~x~0 0), 274#(<= ~__unbuffered_cnt~0 2), 82#L853-1true, 147#true, Black: 208#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 205#(<= ~__unbuffered_cnt~0 1), Black: 206#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 217#(= ~b~0 1), Black: 150#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= 0 ~z$r_buff0_thd0~0)), 157#true, 29#L819true, Black: 275#(<= ~__unbuffered_cnt~0 3), Black: 276#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 284#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), Black: 162#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)), Black: 225#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 227#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0_used~0 1))), 167#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0)), Black: 218#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1)), Black: 223#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 168#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 236#(= ~x~0 1), 239#true, 177#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), 50#P2EXITtrue, 121#L756true, Black: 244#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 245#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (= ~z~0 0) (= ~z~0 1))), Black: 178#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), Black: 182#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 249#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff1_thd3~0 256) 1)) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256)))), P3Thread1of1ForFork3InUse, Black: 184#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 186#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= 2 ~x~0)) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), P1Thread1of1ForFork1InUse]) [2021-03-25 14:34:00,276 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 14:34:00,276 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 14:34:00,276 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 14:34:00,276 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 14:34:00,301 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([966] L771-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75) (= |v_P1Thread1of1ForFork1_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base][57], [P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 8#P1EXITtrue, 73#L3true, Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 265#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 258#(<= ~__unbuffered_cnt~0 2), Black: 259#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 138#(= ~x~0 0), 206#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 147#true, Black: 208#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 205#(<= ~__unbuffered_cnt~0 1), 217#(= ~b~0 1), 282#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 150#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= 0 ~z$r_buff0_thd0~0)), 157#true, 29#L819true, Black: 275#(<= ~__unbuffered_cnt~0 3), Black: 276#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 284#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), Black: 162#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)), Black: 225#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 227#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0_used~0 1))), 167#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0)), Black: 218#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1)), Black: 223#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 168#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 236#(= ~x~0 1), 239#true, 177#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), 50#P2EXITtrue, 121#L756true, Black: 244#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 245#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (= ~z~0 0) (= ~z~0 1))), Black: 178#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), Black: 182#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 249#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff1_thd3~0 256) 1)) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256)))), P3Thread1of1ForFork3InUse, Black: 184#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 186#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= 2 ~x~0)) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), P1Thread1of1ForFork1InUse]) [2021-03-25 14:34:00,302 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 14:34:00,302 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:34:00,302 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:34:00,302 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:34:00,302 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([966] L771-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75) (= |v_P1Thread1of1ForFork1_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base][57], [P0Thread1of1ForFork0InUse, 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), P2Thread1of1ForFork2InUse, Black: 194#(= ~__unbuffered_cnt~0 0), 8#P1EXITtrue, 73#L3true, 265#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 258#(<= ~__unbuffered_cnt~0 2), Black: 259#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 138#(= ~x~0 0), 206#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 147#true, Black: 208#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 205#(<= ~__unbuffered_cnt~0 1), 217#(= ~b~0 1), 282#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 150#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= 0 ~z$r_buff0_thd0~0)), 157#true, 29#L819true, Black: 275#(<= ~__unbuffered_cnt~0 3), Black: 276#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 284#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), Black: 162#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)), Black: 225#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 227#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0_used~0 1))), 167#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0)), Black: 218#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1)), Black: 223#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 168#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 236#(= ~x~0 1), 239#true, 177#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), 50#P2EXITtrue, 121#L756true, Black: 244#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 245#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (= ~z~0 0) (= ~z~0 1))), Black: 178#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), Black: 182#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 249#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff1_thd3~0 256) 1)) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256)))), P3Thread1of1ForFork3InUse, Black: 184#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 186#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= 2 ~x~0)) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), P1Thread1of1ForFork1InUse]) [2021-03-25 14:34:00,302 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 14:34:00,302 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:34:00,302 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:34:00,303 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:34:00,319 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([962] L793-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset][85], [P0Thread1of1ForFork0InUse, 258#(<= ~__unbuffered_cnt~0 2), P2Thread1of1ForFork2InUse, Black: 194#(= ~__unbuffered_cnt~0 0), 8#P1EXITtrue, Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 259#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 138#(= ~x~0 0), Black: 265#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 82#L853-1true, 274#(<= ~__unbuffered_cnt~0 2), 147#true, Black: 208#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 205#(<= ~__unbuffered_cnt~0 1), Black: 206#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 217#(= ~b~0 1), Black: 150#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= 0 ~z$r_buff0_thd0~0)), 157#true, 29#L819true, Black: 275#(<= ~__unbuffered_cnt~0 3), Black: 276#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 284#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), Black: 162#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)), Black: 225#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 227#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0_used~0 1))), 167#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0)), Black: 218#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1)), Black: 223#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 168#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 236#(= ~x~0 1), 239#true, 177#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), 50#P2EXITtrue, 121#L756true, Black: 244#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 178#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), Black: 245#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (= ~z~0 0) (= ~z~0 1))), Black: 182#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 249#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff1_thd3~0 256) 1)) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256)))), P3Thread1of1ForFork3InUse, Black: 184#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), P1Thread1of1ForFork1InUse, Black: 186#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= 2 ~x~0)) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2))]) [2021-03-25 14:34:00,320 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2021-03-25 14:34:00,320 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 14:34:00,320 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 14:34:00,320 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 14:34:00,320 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([962] L793-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset][10], [P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, Black: 194#(= ~__unbuffered_cnt~0 0), 8#P1EXITtrue, Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 258#(<= ~__unbuffered_cnt~0 2), Black: 259#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 138#(= ~x~0 0), Black: 265#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 82#L853-1true, 275#(<= ~__unbuffered_cnt~0 3), 147#true, Black: 208#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 205#(<= ~__unbuffered_cnt~0 1), Black: 206#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 217#(= ~b~0 1), Black: 150#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= 0 ~z$r_buff0_thd0~0)), 157#true, 29#L819true, Black: 276#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 284#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), Black: 162#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)), Black: 225#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 227#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0_used~0 1))), 167#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0)), Black: 218#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1)), Black: 223#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 168#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 236#(= ~x~0 1), 239#true, 177#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), 50#P2EXITtrue, Black: 244#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), 59#P0EXITtrue, Black: 178#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), Black: 245#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (= ~z~0 0) (= ~z~0 1))), Black: 182#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 249#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff1_thd3~0 256) 1)) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256)))), P3Thread1of1ForFork3InUse, Black: 184#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), 254#true, P1Thread1of1ForFork1InUse, Black: 186#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= 2 ~x~0)) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2))]) [2021-03-25 14:34:00,320 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 14:34:00,320 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:34:00,320 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:34:00,320 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:34:00,350 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([962] L793-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset][8], [P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, Black: 194#(= ~__unbuffered_cnt~0 0), 8#P1EXITtrue, Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 265#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 73#L3true, Black: 258#(<= ~__unbuffered_cnt~0 2), Black: 259#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 138#(= ~x~0 0), 206#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 147#true, Black: 208#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 205#(<= ~__unbuffered_cnt~0 1), 217#(= ~b~0 1), 282#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 150#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= 0 ~z$r_buff0_thd0~0)), 157#true, 29#L819true, Black: 275#(<= ~__unbuffered_cnt~0 3), Black: 276#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 284#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), Black: 162#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)), Black: 225#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 227#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0_used~0 1))), 167#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0)), Black: 218#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1)), Black: 223#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 168#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 236#(= ~x~0 1), 239#true, 177#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), 50#P2EXITtrue, 121#L756true, Black: 244#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 178#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), Black: 245#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (= ~z~0 0) (= ~z~0 1))), Black: 182#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 249#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff1_thd3~0 256) 1)) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256)))), P3Thread1of1ForFork3InUse, Black: 184#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), P1Thread1of1ForFork1InUse, Black: 186#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= 2 ~x~0)) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2))]) [2021-03-25 14:34:00,350 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-03-25 14:34:00,350 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-25 14:34:00,350 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-25 14:34:00,350 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-25 14:34:00,355 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([962] L793-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset][8], [P0Thread1of1ForFork0InUse, 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), P2Thread1of1ForFork2InUse, Black: 194#(= ~__unbuffered_cnt~0 0), 8#P1EXITtrue, 265#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 73#L3true, Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 258#(<= ~__unbuffered_cnt~0 2), Black: 259#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 138#(= ~x~0 0), 206#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 147#true, Black: 208#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 205#(<= ~__unbuffered_cnt~0 1), 217#(= ~b~0 1), 282#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 150#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= 0 ~z$r_buff0_thd0~0)), 157#true, 29#L819true, Black: 275#(<= ~__unbuffered_cnt~0 3), Black: 276#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 284#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), Black: 162#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)), Black: 225#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 227#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0_used~0 1))), 167#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0)), Black: 218#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1)), Black: 223#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 168#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 236#(= ~x~0 1), 239#true, 177#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), 50#P2EXITtrue, 121#L756true, Black: 244#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 178#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), Black: 245#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (= ~z~0 0) (= ~z~0 1))), Black: 182#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 249#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff1_thd3~0 256) 1)) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256)))), P3Thread1of1ForFork3InUse, Black: 184#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), P1Thread1of1ForFork1InUse, Black: 186#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= 2 ~x~0)) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2))]) [2021-03-25 14:34:00,355 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-03-25 14:34:00,355 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-25 14:34:00,355 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-25 14:34:00,355 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-25 14:34:00,365 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([962] L793-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset][86], [P0Thread1of1ForFork0InUse, 259#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), P2Thread1of1ForFork2InUse, Black: 194#(= ~__unbuffered_cnt~0 0), 8#P1EXITtrue, Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 73#L3true, Black: 258#(<= ~__unbuffered_cnt~0 2), Black: 265#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 138#(= ~x~0 0), 206#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 147#true, Black: 208#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 205#(<= ~__unbuffered_cnt~0 1), 217#(= ~b~0 1), Black: 150#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= 0 ~z$r_buff0_thd0~0)), 284#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), 157#true, 29#L819true, Black: 275#(<= ~__unbuffered_cnt~0 3), Black: 276#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 162#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)), Black: 225#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 227#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0_used~0 1))), 167#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0)), Black: 218#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1)), Black: 223#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 168#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 236#(= ~x~0 1), 239#true, 177#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), 50#P2EXITtrue, Black: 244#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), 59#P0EXITtrue, Black: 178#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), Black: 245#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (= ~z~0 0) (= ~z~0 1))), Black: 182#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 249#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff1_thd3~0 256) 1)) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256)))), P3Thread1of1ForFork3InUse, Black: 184#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), P1Thread1of1ForFork1InUse, Black: 186#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= 2 ~x~0)) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2))]) [2021-03-25 14:34:00,365 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 14:34:00,365 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 14:34:00,365 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 14:34:00,365 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 14:34:00,366 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([962] L793-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset][86], [P0Thread1of1ForFork0InUse, 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 259#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), P2Thread1of1ForFork2InUse, Black: 194#(= ~__unbuffered_cnt~0 0), 8#P1EXITtrue, 73#L3true, Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 258#(<= ~__unbuffered_cnt~0 2), Black: 138#(= ~x~0 0), Black: 265#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 206#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 147#true, Black: 208#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 205#(<= ~__unbuffered_cnt~0 1), 217#(= ~b~0 1), Black: 150#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= 0 ~z$r_buff0_thd0~0)), 284#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), 157#true, 29#L819true, Black: 275#(<= ~__unbuffered_cnt~0 3), Black: 276#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 162#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)), Black: 225#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 227#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0_used~0 1))), 167#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0)), Black: 218#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1)), Black: 223#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 168#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 236#(= ~x~0 1), 239#true, 177#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), 50#P2EXITtrue, Black: 244#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), 59#P0EXITtrue, Black: 178#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), Black: 245#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (= ~z~0 0) (= ~z~0 1))), Black: 182#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 249#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff1_thd3~0 256) 1)) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256)))), P3Thread1of1ForFork3InUse, Black: 184#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), P1Thread1of1ForFork1InUse, Black: 186#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= 2 ~x~0)) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2))]) [2021-03-25 14:34:00,366 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 14:34:00,366 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 14:34:00,366 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 14:34:00,366 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 14:34:00,374 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([962] L793-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset][86], [P0Thread1of1ForFork0InUse, 259#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), P2Thread1of1ForFork2InUse, Black: 194#(= ~__unbuffered_cnt~0 0), 8#P1EXITtrue, Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 73#L3true, Black: 258#(<= ~__unbuffered_cnt~0 2), Black: 265#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 138#(= ~x~0 0), 147#true, Black: 208#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 205#(<= ~__unbuffered_cnt~0 1), Black: 206#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 217#(= ~b~0 1), Black: 150#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= 0 ~z$r_buff0_thd0~0)), 284#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), 157#true, 29#L819true, Black: 275#(<= ~__unbuffered_cnt~0 3), Black: 276#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 162#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)), Black: 225#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 227#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0_used~0 1))), 167#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0)), Black: 218#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1)), Black: 223#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 168#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 236#(= ~x~0 1), 239#true, 177#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), 50#P2EXITtrue, Black: 244#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), 59#P0EXITtrue, Black: 178#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), Black: 245#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (= ~z~0 0) (= ~z~0 1))), Black: 182#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 249#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff1_thd3~0 256) 1)) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256)))), P3Thread1of1ForFork3InUse, Black: 184#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), P1Thread1of1ForFork1InUse, Black: 186#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= 2 ~x~0)) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2))]) [2021-03-25 14:34:00,374 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 14:34:00,374 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 14:34:00,374 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 14:34:00,374 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 14:34:00,389 INFO L129 PetriNetUnfolder]: 1348/2573 cut-off events. [2021-03-25 14:34:00,389 INFO L130 PetriNetUnfolder]: For 10842/11739 co-relation queries the response was YES. [2021-03-25 14:34:00,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11670 conditions, 2573 events. 1348/2573 cut-off events. For 10842/11739 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 20927 event pairs, 4 based on Foata normal form. 50/2281 useless extension candidates. Maximal degree in co-relation 11624. Up to 777 conditions per place. [2021-03-25 14:34:00,429 INFO L142 LiptonReduction]: Number of co-enabled transitions 1880 [2021-03-25 14:34:01,007 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 14:34:01,155 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 14:34:01,335 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 14:34:01,746 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 14:34:01,863 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 14:34:02,712 WARN L205 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 196 [2021-03-25 14:34:02,938 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 14:34:04,366 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 350 DAG size of output: 274 [2021-03-25 14:34:04,963 WARN L205 SmtUtils]: Spent 593.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-25 14:34:05,158 INFO L154 LiptonReduction]: Checked pairs total: 1700 [2021-03-25 14:34:05,158 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-25 14:34:05,158 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4933 [2021-03-25 14:34:05,159 INFO L480 AbstractCegarLoop]: Abstraction has has 104 places, 84 transitions, 857 flow [2021-03-25 14:34:05,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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 14:34:05,159 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:05,159 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:05,159 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:34:05,159 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 14:34:05,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:05,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1250498963, now seen corresponding path program 1 times [2021-03-25 14:34:05,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:05,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706267859] [2021-03-25 14:34:05,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:05,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:05,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:05,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:05,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:05,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:05,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:05,225 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 14:34:05,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706267859] [2021-03-25 14:34:05,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:05,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:34:05,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266140135] [2021-03-25 14:34:05,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:34:05,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:05,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:34:05,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:34:05,228 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 216 [2021-03-25 14:34:05,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 84 transitions, 857 flow. Second operand 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 14:34:05,228 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:05,229 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 216 [2021-03-25 14:34:05,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:05,308 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([966] L771-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75) (= |v_P1Thread1of1ForFork1_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base][21], [P0Thread1of1ForFork0InUse, 258#(<= ~__unbuffered_cnt~0 2), P2Thread1of1ForFork2InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 8#P1EXITtrue, Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 259#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 265#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 138#(= ~x~0 0), 82#L853-1true, 274#(<= ~__unbuffered_cnt~0 2), 147#true, Black: 208#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 205#(<= ~__unbuffered_cnt~0 1), Black: 206#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 217#(= ~b~0 1), Black: 150#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= 0 ~z$r_buff0_thd0~0)), 157#true, 29#L819true, Black: 275#(<= ~__unbuffered_cnt~0 3), Black: 276#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 284#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), Black: 162#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)), Black: 225#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 227#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0_used~0 1))), 294#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), 167#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0)), Black: 218#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1)), Black: 223#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 168#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 236#(= ~x~0 1), 239#true, 177#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), 50#P2EXITtrue, 121#L756true, Black: 244#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 245#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (= ~z~0 0) (= ~z~0 1))), Black: 178#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), P3Thread1of1ForFork3InUse, Black: 182#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 249#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff1_thd3~0 256) 1)) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256)))), Black: 184#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), P1Thread1of1ForFork1InUse, Black: 186#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= 2 ~x~0)) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2))]) [2021-03-25 14:34:05,308 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 14:34:05,308 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 14:34:05,308 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 14:34:05,308 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 14:34:05,337 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([962] L793-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset][35], [P0Thread1of1ForFork0InUse, 258#(<= ~__unbuffered_cnt~0 2), P2Thread1of1ForFork2InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 8#P1EXITtrue, Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 259#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 265#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 138#(= ~x~0 0), 82#L853-1true, 274#(<= ~__unbuffered_cnt~0 2), 147#true, Black: 208#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 205#(<= ~__unbuffered_cnt~0 1), Black: 206#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 217#(= ~b~0 1), Black: 150#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= 0 ~z$r_buff0_thd0~0)), 157#true, 29#L819true, Black: 275#(<= ~__unbuffered_cnt~0 3), Black: 276#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 284#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), Black: 162#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)), Black: 225#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 227#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0_used~0 1))), 294#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), 167#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0)), Black: 218#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1)), Black: 223#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 168#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 236#(= ~x~0 1), 239#true, 177#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), 50#P2EXITtrue, 121#L756true, Black: 244#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 245#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (= ~z~0 0) (= ~z~0 1))), Black: 178#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), P3Thread1of1ForFork3InUse, Black: 249#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff1_thd3~0 256) 1)) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256)))), Black: 182#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), Black: 184#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), P1Thread1of1ForFork1InUse, Black: 186#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= 2 ~x~0)) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2))]) [2021-03-25 14:34:05,337 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2021-03-25 14:34:05,337 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 14:34:05,337 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 14:34:05,338 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 14:34:05,349 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([962] L793-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset][46], [P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, Black: 194#(= ~__unbuffered_cnt~0 0), Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 8#P1EXITtrue, Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), Black: 258#(<= ~__unbuffered_cnt~0 2), Black: 259#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 265#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 138#(= ~x~0 0), 82#L853-1true, 275#(<= ~__unbuffered_cnt~0 3), 147#true, Black: 208#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 205#(<= ~__unbuffered_cnt~0 1), Black: 206#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 217#(= ~b~0 1), Black: 150#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 0) (<= 0 ~z$r_buff0_thd0~0)), 157#true, 29#L819true, Black: 276#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 284#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), Black: 162#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)), Black: 225#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_p3_EBX~0 1)), Black: 227#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0_used~0 1))), 294#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), 167#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0)), Black: 218#(and (= ~z$w_buff0_used~0 1) (= ~b~0 1) (= ~z$r_buff0_thd4~0 1)), Black: 223#(and (= ~b~0 1) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 168#(and (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), Black: 236#(= ~x~0 1), 239#true, 177#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), 50#P2EXITtrue, Black: 244#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1)), 59#P0EXITtrue, Black: 245#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (or (= ~z~0 0) (= ~z~0 1))), Black: 178#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2)), P3Thread1of1ForFork3InUse, Black: 249#(and (= ~z$w_buff1~0 0) (<= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 0 ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff1_thd3~0 256) 1)) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256)))), Black: 182#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), 254#true, Black: 184#(and (not (= ~z$w_buff0~0 ~z~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~x~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), P1Thread1of1ForFork1InUse, Black: 186#(and (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z~0 1) (not (= 2 ~x~0)) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$w_buff0~0 2))]) [2021-03-25 14:34:05,350 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-03-25 14:34:05,350 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-25 14:34:05,350 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-25 14:34:05,350 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-25 14:34:05,380 INFO L129 PetriNetUnfolder]: 755/1468 cut-off events. [2021-03-25 14:34:05,380 INFO L130 PetriNetUnfolder]: For 14311/14895 co-relation queries the response was YES. [2021-03-25 14:34:05,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6731 conditions, 1468 events. 755/1468 cut-off events. For 14311/14895 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 10604 event pairs, 6 based on Foata normal form. 78/1343 useless extension candidates. Maximal degree in co-relation 6683. Up to 591 conditions per place. [2021-03-25 14:34:05,392 INFO L132 encePairwiseOnDemand]: 213/216 looper letters, 3 selfloop transitions, 2 changer transitions 31/73 dead transitions. [2021-03-25 14:34:05,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 73 transitions, 753 flow [2021-03-25 14:34:05,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:34:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:34:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 766 transitions. [2021-03-25 14:34:05,395 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8865740740740741 [2021-03-25 14:34:05,395 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 766 transitions. [2021-03-25 14:34:05,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 766 transitions. [2021-03-25 14:34:05,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:05,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 766 transitions. [2021-03-25 14:34:05,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 191.5) internal successors, (766), 4 states have internal predecessors, (766), 0 states have call successors, (0), 0 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 14:34:05,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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 14:34:05,399 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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 14:34:05,399 INFO L185 Difference]: Start difference. First operand has 104 places, 84 transitions, 857 flow. Second operand 4 states and 766 transitions. [2021-03-25 14:34:05,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 73 transitions, 753 flow [2021-03-25 14:34:05,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 73 transitions, 651 flow, removed 33 selfloop flow, removed 15 redundant places. [2021-03-25 14:34:05,449 INFO L241 Difference]: Finished difference. Result has 84 places, 42 transitions, 291 flow [2021-03-25 14:34:05,449 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=291, PETRI_PLACES=84, PETRI_TRANSITIONS=42} [2021-03-25 14:34:05,449 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 24 predicate places. [2021-03-25 14:34:05,449 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:05,450 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 42 transitions, 291 flow [2021-03-25 14:34:05,450 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 42 transitions, 291 flow [2021-03-25 14:34:05,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 42 transitions, 291 flow [2021-03-25 14:34:05,465 INFO L129 PetriNetUnfolder]: 71/187 cut-off events. [2021-03-25 14:34:05,465 INFO L130 PetriNetUnfolder]: For 878/900 co-relation queries the response was YES. [2021-03-25 14:34:05,466 INFO L84 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 187 events. 71/187 cut-off events. For 878/900 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 873 event pairs, 3 based on Foata normal form. 9/185 useless extension candidates. Maximal degree in co-relation 629. Up to 58 conditions per place. [2021-03-25 14:34:05,468 INFO L142 LiptonReduction]: Number of co-enabled transitions 404 [2021-03-25 14:34:05,886 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 74 [2021-03-25 14:34:06,201 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 93 [2021-03-25 14:34:06,274 INFO L154 LiptonReduction]: Checked pairs total: 146 [2021-03-25 14:34:06,274 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:34:06,274 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 825 [2021-03-25 14:34:06,274 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 39 transitions, 296 flow [2021-03-25 14:34:06,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 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 14:34:06,275 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:06,275 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:06,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 14:34:06,275 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 14:34:06,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:06,275 INFO L82 PathProgramCache]: Analyzing trace with hash 895454857, now seen corresponding path program 1 times [2021-03-25 14:34:06,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:06,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782808372] [2021-03-25 14:34:06,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:34:06,301 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:34:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:34:06,326 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:34:06,351 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:34:06,351 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:34:06,351 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 14:34:06,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:34:06 BasicIcfg [2021-03-25 14:34:06,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:34:06,468 INFO L168 Benchmark]: Toolchain (without parser) took 37681.92 ms. Allocated memory was 348.1 MB in the beginning and 880.8 MB in the end (delta: 532.7 MB). Free memory was 311.2 MB in the beginning and 457.9 MB in the end (delta: -146.7 MB). Peak memory consumption was 388.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:06,468 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 348.1 MB. Free memory was 329.2 MB in the beginning and 329.1 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:34:06,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 575.14 ms. Allocated memory is still 348.1 MB. Free memory was 311.0 MB in the beginning and 308.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 8.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:06,469 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.67 ms. Allocated memory is still 348.1 MB. Free memory was 308.0 MB in the beginning and 303.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:06,469 INFO L168 Benchmark]: Boogie Preprocessor took 57.04 ms. Allocated memory is still 348.1 MB. Free memory was 303.8 MB in the beginning and 301.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:06,469 INFO L168 Benchmark]: RCFGBuilder took 1808.69 ms. Allocated memory is still 348.1 MB. Free memory was 301.7 MB in the beginning and 258.2 MB in the end (delta: 43.5 MB). Peak memory consumption was 140.0 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:06,469 INFO L168 Benchmark]: TraceAbstraction took 35157.92 ms. Allocated memory was 348.1 MB in the beginning and 880.8 MB in the end (delta: 532.7 MB). Free memory was 257.1 MB in the beginning and 457.9 MB in the end (delta: -200.8 MB). Peak memory consumption was 331.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:06,471 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.12 ms. Allocated memory is still 348.1 MB. Free memory was 329.2 MB in the beginning and 329.1 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 575.14 ms. Allocated memory is still 348.1 MB. Free memory was 311.0 MB in the beginning and 308.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 8.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 76.67 ms. Allocated memory is still 348.1 MB. Free memory was 308.0 MB in the beginning and 303.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 57.04 ms. Allocated memory is still 348.1 MB. Free memory was 303.8 MB in the beginning and 301.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1808.69 ms. Allocated memory is still 348.1 MB. Free memory was 301.7 MB in the beginning and 258.2 MB in the end (delta: 43.5 MB). Peak memory consumption was 140.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 35157.92 ms. Allocated memory was 348.1 MB in the beginning and 880.8 MB in the end (delta: 532.7 MB). Free memory was 257.1 MB in the beginning and 457.9 MB in the end (delta: -200.8 MB). Peak memory consumption was 331.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8788.1ms, 124 PlacesBefore, 60 PlacesAfterwards, 113 TransitionsBefore, 48 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 5 FixpointIterations, 28 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 4166 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2227, positive: 2135, positive conditional: 0, positive unconditional: 2135, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1645, positive: 1604, positive conditional: 0, positive unconditional: 1604, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1645, positive: 1604, positive conditional: 0, positive unconditional: 1604, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1645, positive: 1595, positive conditional: 0, positive unconditional: 1595, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 695, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 662, negative conditional: 0, negative unconditional: 662, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2227, positive: 531, positive conditional: 0, positive unconditional: 531, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 1645, unknown conditional: 0, unknown unconditional: 1645] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 157, Positive conditional cache size: 0, Positive unconditional cache size: 157, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3859.9ms, 56 PlacesBefore, 40 PlacesAfterwards, 41 TransitionsBefore, 29 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 3 FixpointIterations, 10 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1274 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 467, positive: 395, positive conditional: 0, positive unconditional: 395, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 84, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 84, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 316, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 252, negative conditional: 0, negative unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 467, positive: 327, positive conditional: 0, positive unconditional: 327, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 84, unknown conditional: 0, unknown unconditional: 84] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1501.1ms, 41 PlacesBefore, 38 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1047 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 358, positive: 298, positive conditional: 0, positive unconditional: 298, negative: 60, negative conditional: 0, negative unconditional: 60, 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: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 358, positive: 297, positive conditional: 0, positive unconditional: 297, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 172, Positive conditional cache size: 0, Positive unconditional cache size: 172, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0ms, 40 PlacesBefore, 40 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 386 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 333 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 126, positive: 107, positive conditional: 0, positive unconditional: 107, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 126, positive: 107, positive conditional: 0, positive unconditional: 107, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 172, Positive conditional cache size: 0, Positive unconditional cache size: 172, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.5ms, 43 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 349 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 150, positive: 132, positive conditional: 0, positive unconditional: 132, negative: 18, negative conditional: 0, negative unconditional: 18, 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: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, positive: 131, positive conditional: 0, positive unconditional: 131, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.9ms, 48 PlacesBefore, 48 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 566 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 426 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 206, positive: 185, positive conditional: 0, positive unconditional: 185, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 206, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 191, Positive conditional cache size: 0, Positive unconditional cache size: 191, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.8ms, 54 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 651 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 321, positive: 294, positive conditional: 0, positive unconditional: 294, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 321, positive: 294, positive conditional: 0, positive unconditional: 294, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 191, Positive conditional cache size: 0, Positive unconditional cache size: 191, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 117.5ms, 64 PlacesBefore, 64 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 858 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1178 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 499, positive: 460, positive conditional: 0, positive unconditional: 460, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 499, positive: 456, positive conditional: 0, positive unconditional: 456, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 195, Positive conditional cache size: 0, Positive unconditional cache size: 195, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 260.2ms, 70 PlacesBefore, 70 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1148 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 673 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 248, positive: 230, positive conditional: 0, positive unconditional: 230, negative: 18, negative conditional: 0, negative unconditional: 18, 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 248, positive: 228, positive conditional: 0, positive unconditional: 228, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 197, Positive conditional cache size: 0, Positive unconditional cache size: 197, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 179.3ms, 78 PlacesBefore, 78 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1322 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 920 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 326, positive: 303, positive conditional: 0, positive unconditional: 303, 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 326, positive: 302, positive conditional: 0, positive unconditional: 302, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 198, Positive conditional cache size: 0, Positive unconditional cache size: 198, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1617.7ms, 86 PlacesBefore, 86 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 1840 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 623 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 293, positive: 283, positive conditional: 0, positive unconditional: 283, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 293, positive: 278, positive conditional: 0, positive unconditional: 278, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 204, Positive conditional cache size: 0, Positive unconditional cache size: 204, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1676.8ms, 89 PlacesBefore, 89 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 1784 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 650 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 248, positive: 236, positive conditional: 0, positive unconditional: 236, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 248, positive: 230, positive conditional: 0, positive unconditional: 230, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 210, Positive conditional cache size: 0, Positive unconditional cache size: 210, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2411.5ms, 96 PlacesBefore, 96 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 1908 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 858 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 394, positive: 378, positive conditional: 0, positive unconditional: 378, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 394, positive: 374, positive conditional: 0, positive unconditional: 374, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 217, Positive conditional cache size: 0, Positive unconditional cache size: 217, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1224.2ms, 101 PlacesBefore, 101 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 1958 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 818 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 378, positive: 364, positive conditional: 0, positive unconditional: 364, 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: 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 378, positive: 361, positive conditional: 0, positive unconditional: 361, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 244, Positive cache size: 220, Positive conditional cache size: 0, Positive unconditional cache size: 220, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4933.0ms, 108 PlacesBefore, 104 PlacesAfterwards, 90 TransitionsBefore, 84 TransitionsAfterwards, 1880 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 1700 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 719, positive: 690, positive conditional: 0, positive unconditional: 690, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 719, positive: 673, positive conditional: 0, positive unconditional: 673, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 183, Positive conditional cache size: 0, Positive unconditional cache size: 183, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 824.0ms, 84 PlacesBefore, 72 PlacesAfterwards, 42 TransitionsBefore, 39 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 92, positive: 88, positive conditional: 0, positive unconditional: 88, 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: 18, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 92, positive: 71, positive conditional: 0, positive unconditional: 71, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 105, Positive conditional cache size: 0, Positive unconditional cache size: 105, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1173; [L847] FCALL, FORK 0 pthread_create(&t1173, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L848] 0 pthread_t t1174; [L849] FCALL, FORK 0 pthread_create(&t1174, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L850] 0 pthread_t t1175; [L851] FCALL, FORK 0 pthread_create(&t1175, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L852] 0 pthread_t t1176; [L853] FCALL, FORK 0 pthread_create(&t1176, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=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] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, z=1, 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] [L824] 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) [L824] 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) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 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 [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 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 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L788] 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) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] 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) [L788] 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) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 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 [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 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 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] 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) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] 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) [L859] 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) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 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 [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 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 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 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) [L870] 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) [L871] 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)) [L871] EXPR 0 !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) [L871] 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)) [L871] 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)) [L872] 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)) [L872] EXPR 0 !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) [L872] 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)) [L872] 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)) [L873] 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)) [L873] EXPR 0 !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) [L873] 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)) [L873] 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)) [L874] 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)) [L874] EXPR 0 !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) [L874] 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)) [L874] 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)) [L875] 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)) [L875] EXPR 0 !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) [L875] 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)) [L875] 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)) [L876] 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)) [L876] EXPR 0 !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) [L876] 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)) [L876] 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)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 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_p1_EAX=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=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 15.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 34919.1ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 5020.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8899.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 73 SDtfs, 61 SDslu, 56 SDs, 0 SdLazy, 498 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 557.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 772.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1145occurred in iteration=12, InterpolantAutomatonStates: 83, 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: 44.8ms SsaConstructionTime, 564.9ms SatisfiabilityAnalysisTime, 1395.9ms InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 1856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...