/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/mix043_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:32:54,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:32:54,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:32:54,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:32:54,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:32:54,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:32:54,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:32:54,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:32:54,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:32:54,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:32:54,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:32:54,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:32:54,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:32:54,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:32:54,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:32:54,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:32:54,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:32:54,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:32:54,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:32:54,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:32:54,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:32:54,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:32:54,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:32:54,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:32:54,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:32:54,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:32:54,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:32:54,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:32:54,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:32:54,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:32:54,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:32:54,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:32:54,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:32:54,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:32:54,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:32:54,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:32:54,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:32:54,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:32:54,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:32:54,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:32:54,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:32:54,633 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:32:54,670 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:32:54,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:32:54,674 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:32:54,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:32:54,674 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:32:54,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:32:54,675 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:32:54,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:32:54,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:32:54,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:32:54,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:32:54,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:32:54,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:32:54,677 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:32:54,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:32:54,677 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:32:54,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:32:54,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:32:54,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:32:54,677 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:32:54,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:32:54,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:32:54,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:32:54,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:32:54,678 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:32:54,678 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:32:54,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:32:54,679 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:32:54,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:32:54,679 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:32:54,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:32:55,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:32:55,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:32:55,019 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:32:55,020 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:32:55,021 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i [2021-03-25 14:32:55,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/312e939e5/f0032792d47d4fecadd39484f34a264a/FLAGe76115f75 [2021-03-25 14:32:55,652 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:32:55,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i [2021-03-25 14:32:55,671 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/312e939e5/f0032792d47d4fecadd39484f34a264a/FLAGe76115f75 [2021-03-25 14:32:56,081 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/312e939e5/f0032792d47d4fecadd39484f34a264a [2021-03-25 14:32:56,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:32:56,085 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:32:56,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:32:56,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:32:56,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:32:56,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:32:56" (1/1) ... [2021-03-25 14:32:56,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa9b83a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:56, skipping insertion in model container [2021-03-25 14:32:56,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:32:56" (1/1) ... [2021-03-25 14:32:56,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:32:56,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:32:56,245 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/mix043_pso.opt.i[948,961] [2021-03-25 14:32:56,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:32:56,460 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:32:56,472 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/mix043_pso.opt.i[948,961] [2021-03-25 14:32:56,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:32:56,598 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:32:56,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:56 WrapperNode [2021-03-25 14:32:56,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:32:56,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:32:56,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:32:56,600 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:32:56,606 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:32:56" (1/1) ... [2021-03-25 14:32:56,621 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:32:56" (1/1) ... [2021-03-25 14:32:56,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:32:56,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:32:56,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:32:56,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:32:56,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:56" (1/1) ... [2021-03-25 14:32:56,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:56" (1/1) ... [2021-03-25 14:32:56,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:56" (1/1) ... [2021-03-25 14:32:56,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:56" (1/1) ... [2021-03-25 14:32:56,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:56" (1/1) ... [2021-03-25 14:32:56,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:56" (1/1) ... [2021-03-25 14:32:56,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:56" (1/1) ... [2021-03-25 14:32:56,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:32:56,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:32:56,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:32:56,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:32:56,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:56" (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:32:56,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:32:56,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:32:56,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:32:56,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:32:56,770 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:32:56,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:32:56,770 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:32:56,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:32:56,770 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:32:56,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:32:56,770 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:32:56,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:32:56,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:32:56,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:32:56,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:32:56,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:32:56,773 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:32:58,490 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:32:58,491 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:32:58,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:32:58 BoogieIcfgContainer [2021-03-25 14:32:58,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:32:58,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:32:58,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:32:58,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:32:58,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:32:56" (1/3) ... [2021-03-25 14:32:58,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3175b55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:32:58, skipping insertion in model container [2021-03-25 14:32:58,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:56" (2/3) ... [2021-03-25 14:32:58,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3175b55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:32:58, skipping insertion in model container [2021-03-25 14:32:58,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:32:58" (3/3) ... [2021-03-25 14:32:58,499 INFO L111 eAbstractionObserver]: Analyzing ICFG mix043_pso.opt.i [2021-03-25 14:32:58,505 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:32:58,509 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:32:58,510 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:32:58,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,540 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,540 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,540 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,540 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,543 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,543 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,543 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,543 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,546 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,547 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,547 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,547 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,547 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,547 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,547 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,547 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,547 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,548 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,548 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,548 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,548 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,548 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,548 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,549 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,549 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,549 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,549 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,549 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,549 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,549 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,554 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,554 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,556 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,556 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,558 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,558 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,560 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,561 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,561 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,561 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,561 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,561 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,561 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,562 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:58,563 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:32:58,580 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:32:58,598 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:32:58,599 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:32:58,599 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:32:58,599 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:32:58,599 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:32:58,599 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:32:58,599 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:32:58,599 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:32:58,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 118 transitions, 256 flow [2021-03-25 14:32:58,677 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-25 14:32:58,677 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:32:58,681 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 14:32:58,681 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 118 transitions, 256 flow [2021-03-25 14:32:58,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 114 transitions, 240 flow [2021-03-25 14:32:58,687 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:58,698 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 114 transitions, 240 flow [2021-03-25 14:32:58,701 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 114 transitions, 240 flow [2021-03-25 14:32:58,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 240 flow [2021-03-25 14:32:58,723 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-25 14:32:58,723 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:32:58,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 14:32:58,727 INFO L142 LiptonReduction]: Number of co-enabled transitions 2598 [2021-03-25 14:33:00,130 WARN L205 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2021-03-25 14:33:00,411 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 14:33:01,748 WARN L205 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-25 14:33:02,369 WARN L205 SmtUtils]: Spent 618.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 14:33:03,048 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:33:03,434 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:33:03,539 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:33:04,967 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 14:33:05,282 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 14:33:05,900 WARN L205 SmtUtils]: Spent 615.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 14:33:06,524 WARN L205 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 14:33:06,806 INFO L154 LiptonReduction]: Checked pairs total: 4482 [2021-03-25 14:33:06,807 INFO L156 LiptonReduction]: Total number of compositions: 78 [2021-03-25 14:33:06,809 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8123 [2021-03-25 14:33:06,819 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-25 14:33:06,819 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:33:06,820 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:06,820 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:06,821 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:06,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:06,825 INFO L82 PathProgramCache]: Analyzing trace with hash 778215304, now seen corresponding path program 1 times [2021-03-25 14:33:06,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:06,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975605875] [2021-03-25 14:33:06,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:07,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:07,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:07,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:07,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:07,147 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:07,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975605875] [2021-03-25 14:33:07,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:07,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:33:07,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047734840] [2021-03-25 14:33:07,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:33:07,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:07,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:33:07,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:33:07,170 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 196 [2021-03-25 14:33:07,175 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:07,175 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:07,175 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 196 [2021-03-25 14:33:07,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:07,255 INFO L129 PetriNetUnfolder]: 23/107 cut-off events. [2021-03-25 14:33:07,255 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:33:07,256 INFO L84 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 107 events. 23/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 353 event pairs, 9 based on Foata normal form. 5/102 useless extension candidates. Maximal degree in co-relation 146. Up to 37 conditions per place. [2021-03-25 14:33:07,257 INFO L132 encePairwiseOnDemand]: 192/196 looper letters, 7 selfloop transitions, 2 changer transitions 5/47 dead transitions. [2021-03-25 14:33:07,258 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 128 flow [2021-03-25 14:33:07,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:33:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:33:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2021-03-25 14:33:07,276 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9064625850340136 [2021-03-25 14:33:07,276 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 533 transitions. [2021-03-25 14:33:07,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 533 transitions. [2021-03-25 14:33:07,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:07,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 533 transitions. [2021-03-25 14:33:07,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:07,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states 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:07,300 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states 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:07,301 INFO L185 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 533 transitions. [2021-03-25 14:33:07,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 128 flow [2021-03-25 14:33:07,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 47 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:33:07,307 INFO L241 Difference]: Finished difference. Result has 54 places, 39 transitions, 90 flow [2021-03-25 14:33:07,309 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2021-03-25 14:33:07,309 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2021-03-25 14:33:07,309 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:07,309 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 39 transitions, 90 flow [2021-03-25 14:33:07,311 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 39 transitions, 90 flow [2021-03-25 14:33:07,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 90 flow [2021-03-25 14:33:07,321 INFO L129 PetriNetUnfolder]: 0/39 cut-off events. [2021-03-25 14:33:07,321 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:33:07,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:33:07,322 INFO L142 LiptonReduction]: Number of co-enabled transitions 392 [2021-03-25 14:33:07,806 WARN L205 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 14:33:08,118 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 14:33:08,714 WARN L205 SmtUtils]: Spent 594.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-25 14:33:09,315 WARN L205 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-25 14:33:10,140 INFO L154 LiptonReduction]: Checked pairs total: 1672 [2021-03-25 14:33:10,140 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-25 14:33:10,140 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2831 [2021-03-25 14:33:10,141 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2021-03-25 14:33:10,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:10,142 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:10,142 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:33:10,142 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:33:10,142 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:10,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:10,143 INFO L82 PathProgramCache]: Analyzing trace with hash -418335220, now seen corresponding path program 1 times [2021-03-25 14:33:10,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:10,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585362452] [2021-03-25 14:33:10,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:10,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:10,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:10,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:10,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:33:10,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:10,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:33:10,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:10,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:33:10,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:10,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:33:10,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:10,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:10,344 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:10,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585362452] [2021-03-25 14:33:10,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:10,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:33:10,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549414457] [2021-03-25 14:33:10,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:33:10,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:10,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:33:10,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:33:10,357 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 207 [2021-03-25 14:33:10,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states 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:10,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:10,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 207 [2021-03-25 14:33:10,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:10,425 INFO L129 PetriNetUnfolder]: 24/79 cut-off events. [2021-03-25 14:33:10,425 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-25 14:33:10,426 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 79 events. 24/79 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 225 event pairs, 16 based on Foata normal form. 2/79 useless extension candidates. Maximal degree in co-relation 137. Up to 45 conditions per place. [2021-03-25 14:33:10,427 INFO L132 encePairwiseOnDemand]: 201/207 looper letters, 8 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2021-03-25 14:33:10,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 110 flow [2021-03-25 14:33:10,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:33:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:33:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2021-03-25 14:33:10,430 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7932367149758454 [2021-03-25 14:33:10,430 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 821 transitions. [2021-03-25 14:33:10,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 821 transitions. [2021-03-25 14:33:10,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:10,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 821 transitions. [2021-03-25 14:33:10,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.2) internal successors, (821), 5 states have internal predecessors, (821), 0 states have call successors, (0), 0 states 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:10,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states 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:10,436 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states 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:10,437 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 5 states and 821 transitions. [2021-03-25 14:33:10,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 110 flow [2021-03-25 14:33:10,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:33:10,438 INFO L241 Difference]: Finished difference. Result has 43 places, 32 transitions, 100 flow [2021-03-25 14:33:10,439 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2021-03-25 14:33:10,442 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -15 predicate places. [2021-03-25 14:33:10,442 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:10,443 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 100 flow [2021-03-25 14:33:10,443 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 32 transitions, 100 flow [2021-03-25 14:33:10,443 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 100 flow [2021-03-25 14:33:10,452 INFO L129 PetriNetUnfolder]: 4/41 cut-off events. [2021-03-25 14:33:10,453 INFO L130 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2021-03-25 14:33:10,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 41 events. 4/41 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 2 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 64. Up to 9 conditions per place. [2021-03-25 14:33:10,454 INFO L142 LiptonReduction]: Number of co-enabled transitions 398 [2021-03-25 14:33:10,761 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-25 14:33:11,257 WARN L205 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 14:33:11,424 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 14:33:11,756 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 14:33:11,911 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 14:33:11,915 INFO L154 LiptonReduction]: Checked pairs total: 1164 [2021-03-25 14:33:11,916 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:33:11,916 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1474 [2021-03-25 14:33:11,917 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 94 flow [2021-03-25 14:33:11,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states 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:11,917 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:11,918 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:11,918 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:33:11,918 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:11,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:11,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1445267844, now seen corresponding path program 1 times [2021-03-25 14:33:11,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:11,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785324688] [2021-03-25 14:33:11,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:12,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:12,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:12,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:12,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:12,045 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:12,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785324688] [2021-03-25 14:33:12,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:12,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:33:12,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52616969] [2021-03-25 14:33:12,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:33:12,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:12,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:33:12,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:33:12,048 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 209 [2021-03-25 14:33:12,049 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states 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:12,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:12,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 209 [2021-03-25 14:33:12,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:12,067 INFO L129 PetriNetUnfolder]: 3/36 cut-off events. [2021-03-25 14:33:12,068 INFO L130 PetriNetUnfolder]: For 15/18 co-relation queries the response was YES. [2021-03-25 14:33:12,069 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 36 events. 3/36 cut-off events. For 15/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 1 based on Foata normal form. 2/37 useless extension candidates. Maximal degree in co-relation 63. Up to 8 conditions per place. [2021-03-25 14:33:12,069 INFO L132 encePairwiseOnDemand]: 206/209 looper letters, 1 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-03-25 14:33:12,070 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 102 flow [2021-03-25 14:33:12,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:33:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:33:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2021-03-25 14:33:12,073 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9011164274322169 [2021-03-25 14:33:12,073 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 565 transitions. [2021-03-25 14:33:12,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 565 transitions. [2021-03-25 14:33:12,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:12,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 565 transitions. [2021-03-25 14:33:12,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states 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:12,076 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:12,076 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:12,076 INFO L185 Difference]: Start difference. First operand has 40 places, 30 transitions, 94 flow. Second operand 3 states and 565 transitions. [2021-03-25 14:33:12,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 102 flow [2021-03-25 14:33:12,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 30 transitions, 102 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 14:33:12,078 INFO L241 Difference]: Finished difference. Result has 43 places, 30 transitions, 105 flow [2021-03-25 14:33:12,078 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2021-03-25 14:33:12,078 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -15 predicate places. [2021-03-25 14:33:12,078 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:12,079 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 30 transitions, 105 flow [2021-03-25 14:33:12,079 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 30 transitions, 105 flow [2021-03-25 14:33:12,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 30 transitions, 105 flow [2021-03-25 14:33:12,085 INFO L129 PetriNetUnfolder]: 2/37 cut-off events. [2021-03-25 14:33:12,085 INFO L130 PetriNetUnfolder]: For 11/13 co-relation queries the response was YES. [2021-03-25 14:33:12,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 37 events. 2/37 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 63. Up to 7 conditions per place. [2021-03-25 14:33:12,087 INFO L142 LiptonReduction]: Number of co-enabled transitions 398 [2021-03-25 14:33:12,118 INFO L154 LiptonReduction]: Checked pairs total: 394 [2021-03-25 14:33:12,119 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:12,119 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 41 [2021-03-25 14:33:12,121 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 105 flow [2021-03-25 14:33:12,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states 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:12,125 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:12,125 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:12,126 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:33:12,126 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:12,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:12,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1244826898, now seen corresponding path program 1 times [2021-03-25 14:33:12,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:12,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558504409] [2021-03-25 14:33:12,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:12,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:12,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:33:12,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:12,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:33:12,273 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-25 14:33:12,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 14:33:12,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:12,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:33:12,305 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:12,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558504409] [2021-03-25 14:33:12,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:12,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:33:12,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439332020] [2021-03-25 14:33:12,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:33:12,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:12,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:33:12,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:33:12,307 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 209 [2021-03-25 14:33:12,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:12,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:12,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 209 [2021-03-25 14:33:12,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:12,390 INFO L129 PetriNetUnfolder]: 25/77 cut-off events. [2021-03-25 14:33:12,390 INFO L130 PetriNetUnfolder]: For 52/54 co-relation queries the response was YES. [2021-03-25 14:33:12,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 77 events. 25/77 cut-off events. For 52/54 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 227 event pairs, 5 based on Foata normal form. 3/78 useless extension candidates. Maximal degree in co-relation 192. Up to 40 conditions per place. [2021-03-25 14:33:12,391 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 10 selfloop transitions, 9 changer transitions 0/38 dead transitions. [2021-03-25 14:33:12,391 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 38 transitions, 166 flow [2021-03-25 14:33:12,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:33:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:33:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 832 transitions. [2021-03-25 14:33:12,395 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7961722488038278 [2021-03-25 14:33:12,395 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 832 transitions. [2021-03-25 14:33:12,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 832 transitions. [2021-03-25 14:33:12,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:12,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 832 transitions. [2021-03-25 14:33:12,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.4) internal successors, (832), 5 states have internal predecessors, (832), 0 states have call successors, (0), 0 states 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:12,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states 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:12,400 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states 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:12,400 INFO L185 Difference]: Start difference. First operand has 43 places, 30 transitions, 105 flow. Second operand 5 states and 832 transitions. [2021-03-25 14:33:12,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 38 transitions, 166 flow [2021-03-25 14:33:12,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 38 transitions, 156 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:33:12,402 INFO L241 Difference]: Finished difference. Result has 47 places, 35 transitions, 147 flow [2021-03-25 14:33:12,403 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2021-03-25 14:33:12,403 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -11 predicate places. [2021-03-25 14:33:12,403 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:12,403 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 147 flow [2021-03-25 14:33:12,403 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 35 transitions, 147 flow [2021-03-25 14:33:12,404 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 35 transitions, 147 flow [2021-03-25 14:33:12,414 INFO L129 PetriNetUnfolder]: 20/73 cut-off events. [2021-03-25 14:33:12,414 INFO L130 PetriNetUnfolder]: For 48/49 co-relation queries the response was YES. [2021-03-25 14:33:12,414 INFO L84 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 73 events. 20/73 cut-off events. For 48/49 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 248 event pairs, 3 based on Foata normal form. 1/70 useless extension candidates. Maximal degree in co-relation 179. Up to 28 conditions per place. [2021-03-25 14:33:12,415 INFO L142 LiptonReduction]: Number of co-enabled transitions 472 [2021-03-25 14:33:12,584 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 14:33:12,948 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 14:33:13,055 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 14:33:13,060 INFO L154 LiptonReduction]: Checked pairs total: 860 [2021-03-25 14:33:13,060 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:33:13,060 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 657 [2021-03-25 14:33:13,061 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 151 flow [2021-03-25 14:33:13,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:13,062 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:13,062 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:13,062 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:33:13,062 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:13,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:13,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1630264524, now seen corresponding path program 2 times [2021-03-25 14:33:13,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:13,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796428899] [2021-03-25 14:33:13,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:13,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:13,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:33:13,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:13,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:33:13,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:13,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 14:33:13,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:13,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:33:13,199 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:13,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796428899] [2021-03-25 14:33:13,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:13,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:33:13,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173692015] [2021-03-25 14:33:13,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:33:13,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:13,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:33:13,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:33:13,202 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 210 [2021-03-25 14:33:13,203 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states 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:13,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:13,203 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 210 [2021-03-25 14:33:13,203 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:13,310 INFO L129 PetriNetUnfolder]: 24/81 cut-off events. [2021-03-25 14:33:13,310 INFO L130 PetriNetUnfolder]: For 90/111 co-relation queries the response was YES. [2021-03-25 14:33:13,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 81 events. 24/81 cut-off events. For 90/111 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 251 event pairs, 2 based on Foata normal form. 8/85 useless extension candidates. Maximal degree in co-relation 245. Up to 30 conditions per place. [2021-03-25 14:33:13,311 INFO L132 encePairwiseOnDemand]: 204/210 looper letters, 10 selfloop transitions, 12 changer transitions 0/41 dead transitions. [2021-03-25 14:33:13,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 228 flow [2021-03-25 14:33:13,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:33:13,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:33:13,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 838 transitions. [2021-03-25 14:33:13,314 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7980952380952381 [2021-03-25 14:33:13,314 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 838 transitions. [2021-03-25 14:33:13,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 838 transitions. [2021-03-25 14:33:13,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:13,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 838 transitions. [2021-03-25 14:33:13,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.6) internal successors, (838), 5 states have internal predecessors, (838), 0 states have call successors, (0), 0 states 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:13,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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:13,319 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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:13,319 INFO L185 Difference]: Start difference. First operand has 47 places, 35 transitions, 151 flow. Second operand 5 states and 838 transitions. [2021-03-25 14:33:13,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 228 flow [2021-03-25 14:33:13,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 41 transitions, 216 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-25 14:33:13,321 INFO L241 Difference]: Finished difference. Result has 51 places, 39 transitions, 203 flow [2021-03-25 14:33:13,321 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2021-03-25 14:33:13,321 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2021-03-25 14:33:13,321 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:13,321 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 39 transitions, 203 flow [2021-03-25 14:33:13,322 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 39 transitions, 203 flow [2021-03-25 14:33:13,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 39 transitions, 203 flow [2021-03-25 14:33:13,331 INFO L129 PetriNetUnfolder]: 17/71 cut-off events. [2021-03-25 14:33:13,331 INFO L130 PetriNetUnfolder]: For 113/116 co-relation queries the response was YES. [2021-03-25 14:33:13,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 71 events. 17/71 cut-off events. For 113/116 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 215 event pairs, 3 based on Foata normal form. 3/70 useless extension candidates. Maximal degree in co-relation 203. Up to 24 conditions per place. [2021-03-25 14:33:13,333 INFO L142 LiptonReduction]: Number of co-enabled transitions 530 [2021-03-25 14:33:13,336 INFO L154 LiptonReduction]: Checked pairs total: 491 [2021-03-25 14:33:13,337 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:13,337 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-25 14:33:13,337 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 203 flow [2021-03-25 14:33:13,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states 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:13,338 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:13,338 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:13,338 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:33:13,338 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:13,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:13,339 INFO L82 PathProgramCache]: Analyzing trace with hash -332720495, now seen corresponding path program 1 times [2021-03-25 14:33:13,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:13,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483031011] [2021-03-25 14:33:13,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:13,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:13,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:13,399 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:33:13,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:33:13,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:13,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:13,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:13,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483031011] [2021-03-25 14:33:13,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:13,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:33:13,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549465719] [2021-03-25 14:33:13,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:33:13,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:13,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:33:13,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:33:13,410 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 210 [2021-03-25 14:33:13,411 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 203 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:13,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:13,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 210 [2021-03-25 14:33:13,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:13,518 INFO L129 PetriNetUnfolder]: 255/480 cut-off events. [2021-03-25 14:33:13,519 INFO L130 PetriNetUnfolder]: For 367/391 co-relation queries the response was YES. [2021-03-25 14:33:13,521 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 480 events. 255/480 cut-off events. For 367/391 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 2772 event pairs, 112 based on Foata normal form. 40/439 useless extension candidates. Maximal degree in co-relation 1216. Up to 303 conditions per place. [2021-03-25 14:33:13,524 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 13 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2021-03-25 14:33:13,524 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 277 flow [2021-03-25 14:33:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:33:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:33:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 899 transitions. [2021-03-25 14:33:13,527 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8561904761904762 [2021-03-25 14:33:13,527 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 899 transitions. [2021-03-25 14:33:13,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 899 transitions. [2021-03-25 14:33:13,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:13,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 899 transitions. [2021-03-25 14:33:13,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:13,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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:13,532 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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:13,532 INFO L185 Difference]: Start difference. First operand has 51 places, 39 transitions, 203 flow. Second operand 5 states and 899 transitions. [2021-03-25 14:33:13,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 277 flow [2021-03-25 14:33:13,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 269 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-03-25 14:33:13,538 INFO L241 Difference]: Finished difference. Result has 58 places, 48 transitions, 274 flow [2021-03-25 14:33:13,538 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2021-03-25 14:33:13,538 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 0 predicate places. [2021-03-25 14:33:13,538 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:13,538 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 48 transitions, 274 flow [2021-03-25 14:33:13,539 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 48 transitions, 274 flow [2021-03-25 14:33:13,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 48 transitions, 274 flow [2021-03-25 14:33:13,586 INFO L129 PetriNetUnfolder]: 192/378 cut-off events. [2021-03-25 14:33:13,587 INFO L130 PetriNetUnfolder]: For 537/632 co-relation queries the response was YES. [2021-03-25 14:33:13,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 378 events. 192/378 cut-off events. For 537/632 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2127 event pairs, 78 based on Foata normal form. 3/347 useless extension candidates. Maximal degree in co-relation 1214. Up to 219 conditions per place. [2021-03-25 14:33:13,592 INFO L142 LiptonReduction]: Number of co-enabled transitions 770 [2021-03-25 14:33:13,604 INFO L154 LiptonReduction]: Checked pairs total: 476 [2021-03-25 14:33:13,604 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:13,604 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 66 [2021-03-25 14:33:13,609 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 274 flow [2021-03-25 14:33:13,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:13,609 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:13,610 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:13,610 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:33:13,610 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:13,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:13,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1802133341, now seen corresponding path program 1 times [2021-03-25 14:33:13,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:13,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152623632] [2021-03-25 14:33:13,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:13,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:13,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:13,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:13,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:13,704 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:33:13,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:33:13,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:13,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:13,712 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:13,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152623632] [2021-03-25 14:33:13,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:13,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:33:13,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931823790] [2021-03-25 14:33:13,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:33:13,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:13,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:33:13,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:33:13,714 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 210 [2021-03-25 14:33:13,715 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:13,715 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:13,715 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 210 [2021-03-25 14:33:13,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:13,831 INFO L129 PetriNetUnfolder]: 214/420 cut-off events. [2021-03-25 14:33:13,831 INFO L130 PetriNetUnfolder]: For 655/1353 co-relation queries the response was YES. [2021-03-25 14:33:13,834 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1594 conditions, 420 events. 214/420 cut-off events. For 655/1353 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2298 event pairs, 24 based on Foata normal form. 80/453 useless extension candidates. Maximal degree in co-relation 1571. Up to 289 conditions per place. [2021-03-25 14:33:13,836 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 14 selfloop transitions, 19 changer transitions 0/63 dead transitions. [2021-03-25 14:33:13,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 63 transitions, 420 flow [2021-03-25 14:33:13,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:33:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:33:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1259 transitions. [2021-03-25 14:33:13,840 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8564625850340136 [2021-03-25 14:33:13,840 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1259 transitions. [2021-03-25 14:33:13,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1259 transitions. [2021-03-25 14:33:13,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:13,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1259 transitions. [2021-03-25 14:33:13,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 179.85714285714286) internal successors, (1259), 7 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states 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:13,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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:13,846 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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:13,846 INFO L185 Difference]: Start difference. First operand has 58 places, 48 transitions, 274 flow. Second operand 7 states and 1259 transitions. [2021-03-25 14:33:13,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 63 transitions, 420 flow [2021-03-25 14:33:13,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 415 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:33:13,852 INFO L241 Difference]: Finished difference. Result has 66 places, 57 transitions, 407 flow [2021-03-25 14:33:13,852 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=407, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2021-03-25 14:33:13,852 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2021-03-25 14:33:13,852 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:13,852 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 57 transitions, 407 flow [2021-03-25 14:33:13,853 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 57 transitions, 407 flow [2021-03-25 14:33:13,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 57 transitions, 407 flow [2021-03-25 14:33:13,886 INFO L129 PetriNetUnfolder]: 145/306 cut-off events. [2021-03-25 14:33:13,887 INFO L130 PetriNetUnfolder]: For 836/1145 co-relation queries the response was YES. [2021-03-25 14:33:13,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 306 events. 145/306 cut-off events. For 836/1145 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1730 event pairs, 22 based on Foata normal form. 6/286 useless extension candidates. Maximal degree in co-relation 1362. Up to 202 conditions per place. [2021-03-25 14:33:13,892 INFO L142 LiptonReduction]: Number of co-enabled transitions 966 [2021-03-25 14:33:13,924 INFO L154 LiptonReduction]: Checked pairs total: 557 [2021-03-25 14:33:13,925 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:13,925 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 73 [2021-03-25 14:33:13,925 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 407 flow [2021-03-25 14:33:13,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:13,926 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:13,926 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:13,926 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:33:13,926 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:13,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:13,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1120681770, now seen corresponding path program 1 times [2021-03-25 14:33:13,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:13,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670452835] [2021-03-25 14:33:13,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:13,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:13,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:13,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:13,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:13,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:13,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:13,993 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:33:13,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:33:14,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:14,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:14,002 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:14,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670452835] [2021-03-25 14:33:14,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:14,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:33:14,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064403914] [2021-03-25 14:33:14,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:33:14,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:14,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:33:14,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:33:14,005 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 210 [2021-03-25 14:33:14,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 407 flow. Second operand has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:14,006 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:14,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 210 [2021-03-25 14:33:14,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:14,146 INFO L129 PetriNetUnfolder]: 176/356 cut-off events. [2021-03-25 14:33:14,146 INFO L130 PetriNetUnfolder]: For 1298/2922 co-relation queries the response was YES. [2021-03-25 14:33:14,148 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1850 conditions, 356 events. 176/356 cut-off events. For 1298/2922 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 1776 event pairs, 2 based on Foata normal form. 110/422 useless extension candidates. Maximal degree in co-relation 1823. Up to 272 conditions per place. [2021-03-25 14:33:14,150 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 10 selfloop transitions, 28 changer transitions 4/70 dead transitions. [2021-03-25 14:33:14,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 597 flow [2021-03-25 14:33:14,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:33:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:33:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1619 transitions. [2021-03-25 14:33:14,154 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8566137566137566 [2021-03-25 14:33:14,155 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1619 transitions. [2021-03-25 14:33:14,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1619 transitions. [2021-03-25 14:33:14,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:14,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1619 transitions. [2021-03-25 14:33:14,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 179.88888888888889) internal successors, (1619), 9 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states 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:14,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 210.0) internal successors, (2100), 10 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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:14,162 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 210.0) internal successors, (2100), 10 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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:14,163 INFO L185 Difference]: Start difference. First operand has 66 places, 57 transitions, 407 flow. Second operand 9 states and 1619 transitions. [2021-03-25 14:33:14,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 597 flow [2021-03-25 14:33:14,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 539 flow, removed 18 selfloop flow, removed 5 redundant places. [2021-03-25 14:33:14,169 INFO L241 Difference]: Finished difference. Result has 72 places, 63 transitions, 501 flow [2021-03-25 14:33:14,169 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=501, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2021-03-25 14:33:14,170 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2021-03-25 14:33:14,170 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:14,170 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 63 transitions, 501 flow [2021-03-25 14:33:14,170 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 63 transitions, 501 flow [2021-03-25 14:33:14,171 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 63 transitions, 501 flow [2021-03-25 14:33:14,196 INFO L129 PetriNetUnfolder]: 97/229 cut-off events. [2021-03-25 14:33:14,196 INFO L130 PetriNetUnfolder]: For 1121/1223 co-relation queries the response was YES. [2021-03-25 14:33:14,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 229 events. 97/229 cut-off events. For 1121/1223 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1162 event pairs, 2 based on Foata normal form. 3/209 useless extension candidates. Maximal degree in co-relation 1133. Up to 132 conditions per place. [2021-03-25 14:33:14,200 INFO L142 LiptonReduction]: Number of co-enabled transitions 1052 [2021-03-25 14:33:14,214 INFO L154 LiptonReduction]: Checked pairs total: 1563 [2021-03-25 14:33:14,215 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:33:14,215 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 45 [2021-03-25 14:33:14,215 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 475 flow [2021-03-25 14:33:14,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:14,216 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:14,216 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:14,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:33:14,217 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:14,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:14,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1823766229, now seen corresponding path program 1 times [2021-03-25 14:33:14,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:14,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542949241] [2021-03-25 14:33:14,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:14,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:14,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:14,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:14,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:14,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:14,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:14,275 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:14,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542949241] [2021-03-25 14:33:14,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:14,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:33:14,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341971686] [2021-03-25 14:33:14,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:33:14,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:14,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:33:14,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:33:14,277 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 210 [2021-03-25 14:33:14,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 475 flow. Second operand has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states 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:14,278 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:14,278 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 210 [2021-03-25 14:33:14,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:14,342 INFO L129 PetriNetUnfolder]: 88/225 cut-off events. [2021-03-25 14:33:14,342 INFO L130 PetriNetUnfolder]: For 1017/1081 co-relation queries the response was YES. [2021-03-25 14:33:14,343 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 225 events. 88/225 cut-off events. For 1017/1081 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1065 event pairs, 4 based on Foata normal form. 11/223 useless extension candidates. Maximal degree in co-relation 1033. Up to 132 conditions per place. [2021-03-25 14:33:14,344 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 4 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2021-03-25 14:33:14,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 50 transitions, 365 flow [2021-03-25 14:33:14,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:33:14,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:33:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 751 transitions. [2021-03-25 14:33:14,347 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8940476190476191 [2021-03-25 14:33:14,347 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 751 transitions. [2021-03-25 14:33:14,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 751 transitions. [2021-03-25 14:33:14,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:14,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 751 transitions. [2021-03-25 14:33:14,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states 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:14,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states 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:14,352 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states 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:14,352 INFO L185 Difference]: Start difference. First operand has 72 places, 60 transitions, 475 flow. Second operand 4 states and 751 transitions. [2021-03-25 14:33:14,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 50 transitions, 365 flow [2021-03-25 14:33:14,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 50 transitions, 302 flow, removed 25 selfloop flow, removed 7 redundant places. [2021-03-25 14:33:14,357 INFO L241 Difference]: Finished difference. Result has 62 places, 49 transitions, 293 flow [2021-03-25 14:33:14,357 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2021-03-25 14:33:14,357 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2021-03-25 14:33:14,357 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:14,357 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 49 transitions, 293 flow [2021-03-25 14:33:14,358 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 49 transitions, 293 flow [2021-03-25 14:33:14,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 49 transitions, 293 flow [2021-03-25 14:33:14,380 INFO L129 PetriNetUnfolder]: 79/202 cut-off events. [2021-03-25 14:33:14,380 INFO L130 PetriNetUnfolder]: For 344/358 co-relation queries the response was YES. [2021-03-25 14:33:14,381 INFO L84 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 202 events. 79/202 cut-off events. For 344/358 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 921 event pairs, 4 based on Foata normal form. 2/190 useless extension candidates. Maximal degree in co-relation 677. Up to 80 conditions per place. [2021-03-25 14:33:14,384 INFO L142 LiptonReduction]: Number of co-enabled transitions 680 [2021-03-25 14:33:14,388 INFO L154 LiptonReduction]: Checked pairs total: 359 [2021-03-25 14:33:14,388 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:14,389 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-03-25 14:33:14,389 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 293 flow [2021-03-25 14:33:14,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states 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:14,389 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:14,390 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:14,390 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:33:14,390 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:14,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:14,390 INFO L82 PathProgramCache]: Analyzing trace with hash -389645263, now seen corresponding path program 2 times [2021-03-25 14:33:14,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:14,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547064449] [2021-03-25 14:33:14,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:14,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:14,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:14,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:14,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:14,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:14,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:33:14,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547064449] [2021-03-25 14:33:14,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:14,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:33:14,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804926283] [2021-03-25 14:33:14,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:33:14,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:14,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:33:14,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:33:14,444 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 210 [2021-03-25 14:33:14,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:14,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:14,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 210 [2021-03-25 14:33:14,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:14,508 INFO L129 PetriNetUnfolder]: 164/396 cut-off events. [2021-03-25 14:33:14,508 INFO L130 PetriNetUnfolder]: For 785/814 co-relation queries the response was YES. [2021-03-25 14:33:14,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 396 events. 164/396 cut-off events. For 785/814 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2256 event pairs, 8 based on Foata normal form. 13/358 useless extension candidates. Maximal degree in co-relation 1333. Up to 179 conditions per place. [2021-03-25 14:33:14,512 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 4 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2021-03-25 14:33:14,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 51 transitions, 317 flow [2021-03-25 14:33:14,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:33:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:33:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 735 transitions. [2021-03-25 14:33:14,515 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.875 [2021-03-25 14:33:14,515 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 735 transitions. [2021-03-25 14:33:14,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 735 transitions. [2021-03-25 14:33:14,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:14,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 735 transitions. [2021-03-25 14:33:14,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 183.75) internal successors, (735), 4 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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:14,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states 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:14,519 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states 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:14,519 INFO L185 Difference]: Start difference. First operand has 62 places, 49 transitions, 293 flow. Second operand 4 states and 735 transitions. [2021-03-25 14:33:14,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 51 transitions, 317 flow [2021-03-25 14:33:14,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 51 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:33:14,523 INFO L241 Difference]: Finished difference. Result has 66 places, 50 transitions, 305 flow [2021-03-25 14:33:14,524 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=305, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2021-03-25 14:33:14,524 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2021-03-25 14:33:14,525 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:14,525 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 50 transitions, 305 flow [2021-03-25 14:33:14,525 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 50 transitions, 305 flow [2021-03-25 14:33:14,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 50 transitions, 305 flow [2021-03-25 14:33:14,562 INFO L129 PetriNetUnfolder]: 147/355 cut-off events. [2021-03-25 14:33:14,562 INFO L130 PetriNetUnfolder]: For 624/646 co-relation queries the response was YES. [2021-03-25 14:33:14,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1232 conditions, 355 events. 147/355 cut-off events. For 624/646 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2007 event pairs, 8 based on Foata normal form. 2/312 useless extension candidates. Maximal degree in co-relation 1206. Up to 159 conditions per place. [2021-03-25 14:33:14,568 INFO L142 LiptonReduction]: Number of co-enabled transitions 726 [2021-03-25 14:33:14,576 INFO L154 LiptonReduction]: Checked pairs total: 252 [2021-03-25 14:33:14,576 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:14,577 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 52 [2021-03-25 14:33:14,577 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 305 flow [2021-03-25 14:33:14,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:14,577 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:14,578 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:14,578 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:33:14,578 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:14,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:14,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1384282063, now seen corresponding path program 3 times [2021-03-25 14:33:14,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:14,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200018953] [2021-03-25 14:33:14,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:14,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:14,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:14,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:14,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:14,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:14,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:14,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:14,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:14,661 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:33:14,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:33:14,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:14,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:14,670 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:14,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200018953] [2021-03-25 14:33:14,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:14,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:33:14,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321087939] [2021-03-25 14:33:14,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:33:14,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:14,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:33:14,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:33:14,673 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 210 [2021-03-25 14:33:14,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 175.85714285714286) internal successors, (1231), 7 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:14,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:14,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 210 [2021-03-25 14:33:14,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:14,821 INFO L129 PetriNetUnfolder]: 354/648 cut-off events. [2021-03-25 14:33:14,821 INFO L130 PetriNetUnfolder]: For 903/1765 co-relation queries the response was YES. [2021-03-25 14:33:14,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2470 conditions, 648 events. 354/648 cut-off events. For 903/1765 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 3608 event pairs, 0 based on Foata normal form. 97/620 useless extension candidates. Maximal degree in co-relation 2442. Up to 273 conditions per place. [2021-03-25 14:33:14,829 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 6 selfloop transitions, 18 changer transitions 5/59 dead transitions. [2021-03-25 14:33:14,829 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 59 transitions, 419 flow [2021-03-25 14:33:14,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:33:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:33:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1431 transitions. [2021-03-25 14:33:14,833 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8517857142857143 [2021-03-25 14:33:14,833 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1431 transitions. [2021-03-25 14:33:14,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1431 transitions. [2021-03-25 14:33:14,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:14,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1431 transitions. [2021-03-25 14:33:14,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 178.875) internal successors, (1431), 8 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states 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:14,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states 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:14,839 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states 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:14,840 INFO L185 Difference]: Start difference. First operand has 66 places, 50 transitions, 305 flow. Second operand 8 states and 1431 transitions. [2021-03-25 14:33:14,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 59 transitions, 419 flow [2021-03-25 14:33:14,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 59 transitions, 390 flow, removed 12 selfloop flow, removed 2 redundant places. [2021-03-25 14:33:14,850 INFO L241 Difference]: Finished difference. Result has 74 places, 51 transitions, 344 flow [2021-03-25 14:33:14,851 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=344, PETRI_PLACES=74, PETRI_TRANSITIONS=51} [2021-03-25 14:33:14,851 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places. [2021-03-25 14:33:14,851 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:14,851 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 51 transitions, 344 flow [2021-03-25 14:33:14,851 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 51 transitions, 344 flow [2021-03-25 14:33:14,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 51 transitions, 344 flow [2021-03-25 14:33:14,877 INFO L129 PetriNetUnfolder]: 109/280 cut-off events. [2021-03-25 14:33:14,877 INFO L130 PetriNetUnfolder]: For 621/751 co-relation queries the response was YES. [2021-03-25 14:33:14,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 280 events. 109/280 cut-off events. For 621/751 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1547 event pairs, 0 based on Foata normal form. 1/236 useless extension candidates. Maximal degree in co-relation 1124. Up to 125 conditions per place. [2021-03-25 14:33:14,883 INFO L142 LiptonReduction]: Number of co-enabled transitions 688 [2021-03-25 14:33:15,602 WARN L205 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-25 14:33:15,847 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-25 14:33:17,891 WARN L205 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 339 DAG size of output: 264 [2021-03-25 14:33:18,428 WARN L205 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-25 14:33:18,728 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 14:33:18,987 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 14:33:19,568 WARN L205 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-25 14:33:20,112 WARN L205 SmtUtils]: Spent 543.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-25 14:33:20,123 INFO L154 LiptonReduction]: Checked pairs total: 610 [2021-03-25 14:33:20,123 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:33:20,123 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5272 [2021-03-25 14:33:20,124 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 48 transitions, 328 flow [2021-03-25 14:33:20,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 175.85714285714286) internal successors, (1231), 7 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:20,124 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:20,124 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:20,125 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:33:20,125 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:20,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:20,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1979284126, now seen corresponding path program 1 times [2021-03-25 14:33:20,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:20,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293760135] [2021-03-25 14:33:20,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:20,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:20,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:20,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:20,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:20,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:20,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:20,175 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:20,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293760135] [2021-03-25 14:33:20,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:20,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:33:20,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648787590] [2021-03-25 14:33:20,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:33:20,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:20,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:33:20,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:33:20,177 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 212 [2021-03-25 14:33:20,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 48 transitions, 328 flow. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:20,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:20,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 212 [2021-03-25 14:33:20,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:20,250 INFO L129 PetriNetUnfolder]: 249/531 cut-off events. [2021-03-25 14:33:20,250 INFO L130 PetriNetUnfolder]: For 2337/2647 co-relation queries the response was YES. [2021-03-25 14:33:20,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2112 conditions, 531 events. 249/531 cut-off events. For 2337/2647 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 3312 event pairs, 0 based on Foata normal form. 19/459 useless extension candidates. Maximal degree in co-relation 2081. Up to 214 conditions per place. [2021-03-25 14:33:20,255 INFO L132 encePairwiseOnDemand]: 209/212 looper letters, 3 selfloop transitions, 2 changer transitions 8/49 dead transitions. [2021-03-25 14:33:20,255 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 49 transitions, 340 flow [2021-03-25 14:33:20,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:33:20,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:33:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 734 transitions. [2021-03-25 14:33:20,258 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8655660377358491 [2021-03-25 14:33:20,258 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 734 transitions. [2021-03-25 14:33:20,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 734 transitions. [2021-03-25 14:33:20,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:20,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 734 transitions. [2021-03-25 14:33:20,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 0 states have call successors, (0), 0 states 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:20,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:20,261 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:20,261 INFO L185 Difference]: Start difference. First operand has 70 places, 48 transitions, 328 flow. Second operand 4 states and 734 transitions. [2021-03-25 14:33:20,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 49 transitions, 340 flow [2021-03-25 14:33:20,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 49 transitions, 279 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-03-25 14:33:20,272 INFO L241 Difference]: Finished difference. Result has 67 places, 41 transitions, 226 flow [2021-03-25 14:33:20,272 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=67, PETRI_TRANSITIONS=41} [2021-03-25 14:33:20,273 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2021-03-25 14:33:20,273 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:20,273 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 41 transitions, 226 flow [2021-03-25 14:33:20,273 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 41 transitions, 226 flow [2021-03-25 14:33:20,273 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 41 transitions, 226 flow [2021-03-25 14:33:20,289 INFO L129 PetriNetUnfolder]: 68/172 cut-off events. [2021-03-25 14:33:20,289 INFO L130 PetriNetUnfolder]: For 222/229 co-relation queries the response was YES. [2021-03-25 14:33:20,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 172 events. 68/172 cut-off events. For 222/229 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 766 event pairs, 0 based on Foata normal form. 1/151 useless extension candidates. Maximal degree in co-relation 498. Up to 58 conditions per place. [2021-03-25 14:33:20,292 INFO L142 LiptonReduction]: Number of co-enabled transitions 432 [2021-03-25 14:33:20,377 INFO L154 LiptonReduction]: Checked pairs total: 123 [2021-03-25 14:33:20,377 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:33:20,377 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 104 [2021-03-25 14:33:20,379 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 224 flow [2021-03-25 14:33:20,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:20,380 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:20,380 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:33:20,380 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:33:20,380 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:20,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:20,380 INFO L82 PathProgramCache]: Analyzing trace with hash -2120521475, now seen corresponding path program 1 times [2021-03-25 14:33:20,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:20,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260928982] [2021-03-25 14:33:20,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:33:20,417 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:33:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:33:20,454 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:33:20,495 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:33:20,495 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:33:20,495 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:33:20,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:33:20 BasicIcfg [2021-03-25 14:33:20,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:33:20,594 INFO L168 Benchmark]: Toolchain (without parser) took 24509.27 ms. Allocated memory was 255.9 MB in the beginning and 698.4 MB in the end (delta: 442.5 MB). Free memory was 232.7 MB in the beginning and 357.9 MB in the end (delta: -125.2 MB). Peak memory consumption was 317.4 MB. Max. memory is 16.0 GB. [2021-03-25 14:33:20,594 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:33:20,595 INFO L168 Benchmark]: CACSL2BoogieTranslator took 512.86 ms. Allocated memory was 255.9 MB in the beginning and 377.5 MB in the end (delta: 121.6 MB). Free memory was 232.7 MB in the beginning and 337.9 MB in the end (delta: -105.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:33:20,595 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.05 ms. Allocated memory is still 377.5 MB. Free memory was 337.9 MB in the beginning and 334.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:33:20,595 INFO L168 Benchmark]: Boogie Preprocessor took 30.48 ms. Allocated memory is still 377.5 MB. Free memory was 334.8 MB in the beginning and 332.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:33:20,595 INFO L168 Benchmark]: RCFGBuilder took 1806.64 ms. Allocated memory is still 377.5 MB. Free memory was 332.4 MB in the beginning and 287.5 MB in the end (delta: 44.9 MB). Peak memory consumption was 49.4 MB. Max. memory is 16.0 GB. [2021-03-25 14:33:20,596 INFO L168 Benchmark]: TraceAbstraction took 22099.23 ms. Allocated memory was 377.5 MB in the beginning and 698.4 MB in the end (delta: 320.9 MB). Free memory was 286.4 MB in the beginning and 357.9 MB in the end (delta: -71.5 MB). Peak memory consumption was 249.4 MB. Max. memory is 16.0 GB. [2021-03-25 14:33:20,597 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.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 512.86 ms. Allocated memory was 255.9 MB in the beginning and 377.5 MB in the end (delta: 121.6 MB). Free memory was 232.7 MB in the beginning and 337.9 MB in the end (delta: -105.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 55.05 ms. Allocated memory is still 377.5 MB. Free memory was 337.9 MB in the beginning and 334.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.48 ms. Allocated memory is still 377.5 MB. Free memory was 334.8 MB in the beginning and 332.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1806.64 ms. Allocated memory is still 377.5 MB. Free memory was 332.4 MB in the beginning and 287.5 MB in the end (delta: 44.9 MB). Peak memory consumption was 49.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 22099.23 ms. Allocated memory was 377.5 MB in the beginning and 698.4 MB in the end (delta: 320.9 MB). Free memory was 286.4 MB in the beginning and 357.9 MB in the end (delta: -71.5 MB). Peak memory consumption was 249.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8106.1ms, 125 PlacesBefore, 58 PlacesAfterwards, 114 TransitionsBefore, 46 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 4482 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2378, positive: 2278, positive conditional: 0, positive unconditional: 2278, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1632, positive: 1587, positive conditional: 0, positive unconditional: 1587, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1632, positive: 1587, positive conditional: 0, positive unconditional: 1587, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1632, positive: 1582, positive conditional: 0, positive unconditional: 1582, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 646, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 634, negative conditional: 0, negative unconditional: 634, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2378, positive: 691, positive conditional: 0, positive unconditional: 691, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 1632, unknown conditional: 0, unknown unconditional: 1632] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 205, Positive conditional cache size: 0, Positive unconditional cache size: 205, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2829.4ms, 54 PlacesBefore, 39 PlacesAfterwards, 39 TransitionsBefore, 28 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1672 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 556, positive: 460, positive conditional: 0, positive unconditional: 460, negative: 96, negative conditional: 0, negative unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 67, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 67, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 206, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 168, negative conditional: 0, negative unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 556, positive: 403, positive conditional: 0, positive unconditional: 403, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 67, unknown conditional: 0, unknown unconditional: 67] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 209, Positive conditional cache size: 0, Positive unconditional cache size: 209, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1472.8ms, 43 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 30 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1164 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 418, positive: 358, positive conditional: 0, positive unconditional: 358, 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: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, 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: 418, positive: 350, positive conditional: 0, positive unconditional: 350, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 244, Positive cache size: 217, Positive conditional cache size: 0, Positive unconditional cache size: 217, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.4ms, 43 PlacesBefore, 43 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 394 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 149, positive: 128, positive conditional: 0, positive unconditional: 128, 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: 5, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 149, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 656.8ms, 47 PlacesBefore, 47 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 860 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 371, positive: 331, positive conditional: 0, positive unconditional: 331, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 0, positive unconditional: 19, 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: 19, positive: 19, positive conditional: 0, positive unconditional: 19, 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: 19, positive: 19, positive conditional: 0, positive unconditional: 19, 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: 371, positive: 312, positive conditional: 0, positive unconditional: 312, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 238, Positive conditional cache size: 0, Positive unconditional cache size: 238, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.8ms, 51 PlacesBefore, 51 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 491 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 187, positive: 165, positive conditional: 0, positive unconditional: 165, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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: 187, positive: 165, positive conditional: 0, positive unconditional: 165, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 238, Positive conditional cache size: 0, Positive unconditional cache size: 238, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 65.7ms, 58 PlacesBefore, 58 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 770 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 476 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 197, positive: 182, positive conditional: 0, positive unconditional: 182, negative: 15, negative conditional: 0, negative unconditional: 15, 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: 197, positive: 176, positive conditional: 0, positive unconditional: 176, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 268, Positive cache size: 244, Positive conditional cache size: 0, Positive unconditional cache size: 244, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.9ms, 66 PlacesBefore, 66 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 966 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 557 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 240, positive: 225, positive conditional: 0, positive unconditional: 225, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 240, positive: 222, positive conditional: 0, positive unconditional: 222, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 247, Positive conditional cache size: 0, Positive unconditional cache size: 247, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44.5ms, 72 PlacesBefore, 72 PlacesAfterwards, 63 TransitionsBefore, 60 TransitionsAfterwards, 1052 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1563 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 613, positive: 575, positive conditional: 0, positive unconditional: 575, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 613, positive: 570, positive conditional: 0, positive unconditional: 570, 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): 251, Positive cache size: 230, Positive conditional cache size: 0, Positive unconditional cache size: 230, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30.8ms, 62 PlacesBefore, 62 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 680 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 359 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 175, positive: 164, positive conditional: 0, positive unconditional: 164, negative: 11, negative conditional: 0, negative unconditional: 11, 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: 175, positive: 164, positive conditional: 0, positive unconditional: 164, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 230, Positive conditional cache size: 0, Positive unconditional cache size: 230, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.5ms, 66 PlacesBefore, 66 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 252 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 132, positive: 124, positive conditional: 0, positive unconditional: 124, negative: 8, negative conditional: 0, negative unconditional: 8, 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: 132, positive: 124, positive conditional: 0, positive unconditional: 124, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 230, Positive conditional cache size: 0, Positive unconditional cache size: 230, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5271.8ms, 74 PlacesBefore, 70 PlacesAfterwards, 51 TransitionsBefore, 48 TransitionsAfterwards, 688 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 610 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 370, positive: 349, positive conditional: 0, positive unconditional: 349, 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: 11, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 11, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 11, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 370, positive: 338, positive conditional: 0, positive unconditional: 338, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 209, Positive conditional cache size: 0, Positive unconditional cache size: 209, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 104.2ms, 67 PlacesBefore, 61 PlacesAfterwards, 41 TransitionsBefore, 39 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 123 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 94, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1141; [L849] FCALL, FORK 0 pthread_create(&t1141, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L850] 0 pthread_t t1142; [L851] FCALL, FORK 0 pthread_create(&t1142, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L852] 0 pthread_t t1143; [L853] FCALL, FORK 0 pthread_create(&t1143, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L854] 0 pthread_t t1144; [L855] FCALL, FORK 0 pthread_create(&t1144, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 [L817] 4 a = 1 [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=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] [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=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] [L784] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, 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] [L787] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, 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] [L826] 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) [L826] 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) [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L828] 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 [L829] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L830] 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 [L790] 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) [L790] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L790] 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) [L790] 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) [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L792] 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 [L793] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L794] 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 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L861] 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) [L861] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L861] 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) [L861] 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) [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L863] 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 [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L865] 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 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] 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) [L872] 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) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 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)) [L875] 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)) [L876] 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)) [L876] 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)) [L877] 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)) [L877] 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)) [L878] 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)) [L878] 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)) [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 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_p0_EAX=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=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, 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, 117 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 21901.2ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1354.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8214.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 45 SDtfs, 38 SDslu, 30 SDs, 0 SdLazy, 296 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 336.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 279.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=501occurred in iteration=8, InterpolantAutomatonStates: 62, 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: 45.8ms SsaConstructionTime, 447.5ms SatisfiabilityAnalysisTime, 858.8ms InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 896 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...