/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix002_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-6f4246e9f5583d222ebb38ff8175c901f3a528f0-6f4246e [2021-04-28 16:36:01,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-28 16:36:01,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-28 16:36:02,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-28 16:36:02,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-28 16:36:02,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-28 16:36:02,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-28 16:36:02,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-28 16:36:02,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-28 16:36:02,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-28 16:36:02,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-28 16:36:02,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-28 16:36:02,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-28 16:36:02,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-28 16:36:02,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-28 16:36:02,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-28 16:36:02,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-28 16:36:02,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-28 16:36:02,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-28 16:36:02,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-28 16:36:02,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-28 16:36:02,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-28 16:36:02,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-28 16:36:02,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-28 16:36:02,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-28 16:36:02,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-28 16:36:02,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-28 16:36:02,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-28 16:36:02,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-28 16:36:02,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-28 16:36:02,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-28 16:36:02,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-28 16:36:02,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-28 16:36:02,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-28 16:36:02,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-28 16:36:02,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-28 16:36:02,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-28 16:36:02,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-28 16:36:02,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-28 16:36:02,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-28 16:36:02,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-28 16:36:02,056 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-04-28 16:36:02,087 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-28 16:36:02,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-28 16:36:02,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-28 16:36:02,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-28 16:36:02,090 INFO L138 SettingsManager]: * Use SBE=true [2021-04-28 16:36:02,090 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-28 16:36:02,090 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-28 16:36:02,090 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-28 16:36:02,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-28 16:36:02,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-28 16:36:02,091 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-28 16:36:02,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-28 16:36:02,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-28 16:36:02,092 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-28 16:36:02,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-28 16:36:02,092 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-28 16:36:02,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-28 16:36:02,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-28 16:36:02,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-28 16:36:02,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-28 16:36:02,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-28 16:36:02,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-28 16:36:02,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-28 16:36:02,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-28 16:36:02,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-28 16:36:02,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-28 16:36:02,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-28 16:36:02,095 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-04-28 16:36:02,095 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-04-28 16:36:02,095 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-04-28 16:36:02,096 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-04-28 16:36:02,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-28 16:36:02,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-28 16:36:02,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-28 16:36:02,510 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-28 16:36:02,511 INFO L275 PluginConnector]: CDTParser initialized [2021-04-28 16:36:02,512 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_power.oepc.i [2021-04-28 16:36:02,584 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a866d9d/21e4b13e67ce4d0c837a76230a9a911c/FLAGd03856d79 [2021-04-28 16:36:03,286 INFO L306 CDTParser]: Found 1 translation units. [2021-04-28 16:36:03,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_power.oepc.i [2021-04-28 16:36:03,310 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a866d9d/21e4b13e67ce4d0c837a76230a9a911c/FLAGd03856d79 [2021-04-28 16:36:03,540 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a866d9d/21e4b13e67ce4d0c837a76230a9a911c [2021-04-28 16:36:03,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-28 16:36:03,592 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-28 16:36:03,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-28 16:36:03,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-28 16:36:03,600 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-28 16:36:03,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:36:03" (1/1) ... [2021-04-28 16:36:03,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@561acdf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:36:03, skipping insertion in model container [2021-04-28 16:36:03,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:36:03" (1/1) ... [2021-04-28 16:36:03,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-28 16:36:03,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-28 16:36:03,881 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/mix002_power.oepc.i[951,964] [2021-04-28 16:36:04,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-28 16:36:04,185 INFO L203 MainTranslator]: Completed pre-run [2021-04-28 16:36:04,199 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/mix002_power.oepc.i[951,964] [2021-04-28 16:36:04,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-28 16:36:04,357 INFO L208 MainTranslator]: Completed translation [2021-04-28 16:36:04,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:36:04 WrapperNode [2021-04-28 16:36:04,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-28 16:36:04,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-28 16:36:04,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-28 16:36:04,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-28 16:36:04,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:36:04" (1/1) ... [2021-04-28 16:36:04,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:36:04" (1/1) ... [2021-04-28 16:36:04,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-28 16:36:04,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-28 16:36:04,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-28 16:36:04,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-28 16:36:04,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:36:04" (1/1) ... [2021-04-28 16:36:04,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:36:04" (1/1) ... [2021-04-28 16:36:04,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:36:04" (1/1) ... [2021-04-28 16:36:04,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:36:04" (1/1) ... [2021-04-28 16:36:04,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:36:04" (1/1) ... [2021-04-28 16:36:04,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:36:04" (1/1) ... [2021-04-28 16:36:04,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:36:04" (1/1) ... [2021-04-28 16:36:04,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-28 16:36:04,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-28 16:36:04,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-28 16:36:04,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-28 16:36:04,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:36:04" (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-04-28 16:36:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-28 16:36:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-28 16:36:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-28 16:36:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-28 16:36:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-28 16:36:04,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-28 16:36:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-28 16:36:04,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-28 16:36:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-04-28 16:36:04,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-04-28 16:36:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-28 16:36:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-28 16:36:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-28 16:36:04,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-28 16:36:04,589 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-28 16:36:06,817 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-28 16:36:06,818 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-28 16:36:06,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:36:06 BoogieIcfgContainer [2021-04-28 16:36:06,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-28 16:36:06,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-28 16:36:06,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-28 16:36:06,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-28 16:36:06,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:36:03" (1/3) ... [2021-04-28 16:36:06,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc3c4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:36:06, skipping insertion in model container [2021-04-28 16:36:06,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:36:04" (2/3) ... [2021-04-28 16:36:06,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc3c4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:36:06, skipping insertion in model container [2021-04-28 16:36:06,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:36:06" (3/3) ... [2021-04-28 16:36:06,829 INFO L111 eAbstractionObserver]: Analyzing ICFG mix002_power.oepc.i [2021-04-28 16:36:06,836 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-28 16:36:06,841 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-28 16:36:06,842 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-28 16:36:06,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,883 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,883 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,884 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,884 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,884 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,885 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,885 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,885 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,891 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,891 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,891 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,891 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,896 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,896 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,897 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,897 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,916 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,916 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,916 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,916 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,920 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,921 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,921 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,923 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,924 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,928 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,930 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 16:36:06,933 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-28 16:36:06,956 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-04-28 16:36:06,981 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-28 16:36:06,981 INFO L377 AbstractCegarLoop]: Hoare is false [2021-04-28 16:36:06,981 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-28 16:36:06,982 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-28 16:36:06,982 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-28 16:36:06,982 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-28 16:36:06,982 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-28 16:36:06,982 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-28 16:36:06,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2021-04-28 16:36:07,048 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2021-04-28 16:36:07,048 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 16:36:07,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2021-04-28 16:36:07,054 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2021-04-28 16:36:07,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2021-04-28 16:36:07,065 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 16:36:07,084 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2021-04-28 16:36:07,088 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2021-04-28 16:36:07,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2021-04-28 16:36:07,117 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2021-04-28 16:36:07,117 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 16:36:07,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2021-04-28 16:36:07,123 INFO L146 LiptonReduction]: Number of co-enabled transitions 2076 [2021-04-28 16:36:10,795 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-04-28 16:36:11,451 WARN L205 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-04-28 16:36:11,655 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-04-28 16:36:22,023 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-04-28 16:36:22,149 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-04-28 16:36:22,273 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-04-28 16:36:22,397 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-04-28 16:36:26,218 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-04-28 16:36:26,331 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-04-28 16:36:26,448 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-04-28 16:36:26,563 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-04-28 16:36:26,856 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-28 16:36:26,970 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-28 16:36:27,084 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-28 16:36:27,196 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-28 16:36:27,693 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-28 16:36:27,796 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-28 16:36:27,901 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-28 16:36:28,021 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-28 16:36:28,141 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-28 16:36:28,261 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-28 16:36:28,381 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-28 16:36:28,813 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-28 16:36:28,945 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-28 16:36:29,048 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-28 16:36:29,248 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-28 16:36:29,354 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-28 16:36:29,461 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-28 16:36:29,567 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-28 16:36:31,459 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-28 16:36:31,578 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-28 16:36:31,736 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-28 16:36:31,870 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-28 16:36:32,454 WARN L205 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 119 [2021-04-28 16:36:32,716 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-04-28 16:36:33,252 WARN L205 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 119 [2021-04-28 16:36:33,496 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-04-28 16:36:33,650 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 16:36:33,802 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 16:36:33,951 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 16:36:34,099 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 16:36:34,303 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:34,508 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:34,753 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:34,963 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:35,173 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:35,387 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:35,613 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:35,818 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:35,951 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-28 16:36:36,089 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-28 16:36:36,212 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-28 16:36:36,346 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-28 16:36:36,529 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 16:36:36,713 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 16:36:36,889 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 16:36:37,076 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 16:36:37,288 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:37,492 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:37,742 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:37,959 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:38,119 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 16:36:38,281 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 16:36:38,439 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 16:36:38,599 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 16:36:38,818 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:39,032 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:39,246 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:39,457 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:39,634 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 16:36:39,809 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 16:36:39,989 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 16:36:40,169 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 16:36:40,309 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 16:36:40,454 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 16:36:40,590 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 16:36:40,757 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 16:36:40,939 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 16:36:41,122 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 16:36:41,299 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 16:36:41,470 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 16:36:41,674 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 16:36:41,879 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 16:36:42,077 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 16:36:42,278 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 16:36:42,495 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:42,711 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:42,922 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:43,140 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 16:36:43,336 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-04-28 16:36:43,531 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-04-28 16:36:43,732 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-04-28 16:36:43,967 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-04-28 16:36:44,554 WARN L205 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-04-28 16:36:44,836 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-04-28 16:36:45,374 WARN L205 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-04-28 16:36:45,637 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-04-28 16:36:45,800 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 16:36:45,961 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 16:36:46,127 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 16:36:46,290 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 16:36:46,454 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 16:36:46,621 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 16:36:46,800 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 16:36:46,980 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 16:36:47,112 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-28 16:36:47,237 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-28 16:36:47,363 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-28 16:36:47,494 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-28 16:36:47,725 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-04-28 16:36:47,929 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-04-28 16:36:48,138 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-04-28 16:36:48,353 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-04-28 16:36:48,505 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 16:36:48,667 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 16:36:48,823 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 16:36:48,980 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 16:36:49,031 INFO L158 LiptonReduction]: Checked pairs total: 19494 [2021-04-28 16:36:49,031 INFO L160 LiptonReduction]: Total number of compositions: 256 [2021-04-28 16:36:49,037 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 41973 [2021-04-28 16:36:49,060 INFO L129 PetriNetUnfolder]: 0/61 cut-off events. [2021-04-28 16:36:49,060 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 16:36:49,060 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 16:36:49,061 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-04-28 16:36:49,061 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 16:36:49,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 16:36:49,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1245016, now seen corresponding path program 1 times [2021-04-28 16:36:49,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 16:36:49,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809558378] [2021-04-28 16:36:49,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 16:36:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 16:36:49,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:36:49,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 16:36:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 16:36:49,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809558378] [2021-04-28 16:36:49,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 16:36:49,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-28 16:36:49,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544605523] [2021-04-28 16:36:49,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-28 16:36:49,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 16:36:49,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-28 16:36:49,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-28 16:36:49,376 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 363 [2021-04-28 16:36:49,382 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 128 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:49,382 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 16:36:49,382 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 363 [2021-04-28 16:36:49,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 16:36:49,604 INFO L129 PetriNetUnfolder]: 89/584 cut-off events. [2021-04-28 16:36:49,604 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 16:36:49,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 584 events. 89/584 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 5029 event pairs, 56 based on Foata normal form. 58/241 useless extension candidates. Maximal degree in co-relation 682. Up to 129 conditions per place. [2021-04-28 16:36:49,614 INFO L132 encePairwiseOnDemand]: 341/363 looper letters, 9 selfloop transitions, 4 changer transitions 54/128 dead transitions. [2021-04-28 16:36:49,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 128 transitions, 321 flow [2021-04-28 16:36:49,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 16:36:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 16:36:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 877 transitions. [2021-04-28 16:36:49,635 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8053259871441689 [2021-04-28 16:36:49,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 877 transitions. [2021-04-28 16:36:49,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 877 transitions. [2021-04-28 16:36:49,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 16:36:49,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 877 transitions. [2021-04-28 16:36:49,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:49,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:49,666 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:49,669 INFO L185 Difference]: Start difference. First operand has 137 places, 128 transitions, 265 flow. Second operand 3 states and 877 transitions. [2021-04-28 16:36:49,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 128 transitions, 321 flow [2021-04-28 16:36:49,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 128 transitions, 318 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-04-28 16:36:49,678 INFO L241 Difference]: Finished difference. Result has 133 places, 70 transitions, 154 flow [2021-04-28 16:36:49,680 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=133, PETRI_TRANSITIONS=70} [2021-04-28 16:36:49,681 INFO L343 CegarLoopForPetriNet]: 137 programPoint places, -4 predicate places. [2021-04-28 16:36:49,681 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 16:36:49,682 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 70 transitions, 154 flow [2021-04-28 16:36:49,682 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 70 transitions, 154 flow [2021-04-28 16:36:49,683 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 70 transitions, 154 flow [2021-04-28 16:36:49,693 INFO L129 PetriNetUnfolder]: 0/70 cut-off events. [2021-04-28 16:36:49,694 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 16:36:49,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 70 events. 0/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 345 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-04-28 16:36:49,696 INFO L146 LiptonReduction]: Number of co-enabled transitions 2504 [2021-04-28 16:36:50,108 INFO L158 LiptonReduction]: Checked pairs total: 3276 [2021-04-28 16:36:50,109 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 16:36:50,109 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 428 [2021-04-28 16:36:50,112 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 154 flow [2021-04-28 16:36:50,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:50,114 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 16:36:50,114 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 16:36:50,114 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-28 16:36:50,114 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 16:36:50,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 16:36:50,118 INFO L82 PathProgramCache]: Analyzing trace with hash -373243957, now seen corresponding path program 1 times [2021-04-28 16:36:50,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 16:36:50,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801586716] [2021-04-28 16:36:50,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 16:36:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 16:36:50,289 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-04-28 16:36:50,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-04-28 16:36:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 16:36:50,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801586716] [2021-04-28 16:36:50,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 16:36:50,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-28 16:36:50,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904926137] [2021-04-28 16:36:50,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-28 16:36:50,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 16:36:50,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-28 16:36:50,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-28 16:36:50,312 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 363 [2021-04-28 16:36:50,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:50,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 16:36:50,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 363 [2021-04-28 16:36:50,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 16:36:51,098 INFO L129 PetriNetUnfolder]: 1669/4114 cut-off events. [2021-04-28 16:36:51,099 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 16:36:51,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6807 conditions, 4114 events. 1669/4114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 42581 event pairs, 657 based on Foata normal form. 0/2743 useless extension candidates. Maximal degree in co-relation 6798. Up to 2346 conditions per place. [2021-04-28 16:36:51,116 INFO L132 encePairwiseOnDemand]: 341/363 looper letters, 7 selfloop transitions, 4 changer transitions 49/98 dead transitions. [2021-04-28 16:36:51,117 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 98 transitions, 330 flow [2021-04-28 16:36:51,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 16:36:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 16:36:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2021-04-28 16:36:51,123 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7456382001836547 [2021-04-28 16:36:51,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 812 transitions. [2021-04-28 16:36:51,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 812 transitions. [2021-04-28 16:36:51,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 16:36:51,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 812 transitions. [2021-04-28 16:36:51,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,132 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,132 INFO L185 Difference]: Start difference. First operand has 79 places, 70 transitions, 154 flow. Second operand 3 states and 812 transitions. [2021-04-28 16:36:51,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 98 transitions, 330 flow [2021-04-28 16:36:51,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 98 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-28 16:36:51,137 INFO L241 Difference]: Finished difference. Result has 80 places, 49 transitions, 130 flow [2021-04-28 16:36:51,137 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=80, PETRI_TRANSITIONS=49} [2021-04-28 16:36:51,138 INFO L343 CegarLoopForPetriNet]: 137 programPoint places, -57 predicate places. [2021-04-28 16:36:51,138 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 16:36:51,138 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 49 transitions, 130 flow [2021-04-28 16:36:51,139 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 49 transitions, 130 flow [2021-04-28 16:36:51,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 49 transitions, 130 flow [2021-04-28 16:36:51,178 INFO L129 PetriNetUnfolder]: 79/290 cut-off events. [2021-04-28 16:36:51,178 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 16:36:51,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 290 events. 79/290 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1807 event pairs, 59 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 426. Up to 132 conditions per place. [2021-04-28 16:36:51,185 INFO L146 LiptonReduction]: Number of co-enabled transitions 1334 [2021-04-28 16:36:51,274 INFO L158 LiptonReduction]: Checked pairs total: 883 [2021-04-28 16:36:51,274 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 16:36:51,275 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 137 [2021-04-28 16:36:51,277 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 130 flow [2021-04-28 16:36:51,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,278 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 16:36:51,278 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 16:36:51,278 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-28 16:36:51,278 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 16:36:51,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 16:36:51,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2089713286, now seen corresponding path program 1 times [2021-04-28 16:36:51,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 16:36:51,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527688947] [2021-04-28 16:36:51,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 16:36:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 16:36:51,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:36:51,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 16:36:51,358 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-04-28 16:36:51,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-04-28 16:36:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 16:36:51,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527688947] [2021-04-28 16:36:51,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 16:36:51,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-28 16:36:51,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248395748] [2021-04-28 16:36:51,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-28 16:36:51,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 16:36:51,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-28 16:36:51,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-04-28 16:36:51,381 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 363 [2021-04-28 16:36:51,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 251.75) internal successors, (1007), 4 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 16:36:51,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 363 [2021-04-28 16:36:51,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 16:36:51,450 INFO L129 PetriNetUnfolder]: 61/236 cut-off events. [2021-04-28 16:36:51,450 INFO L130 PetriNetUnfolder]: For 13/63 co-relation queries the response was YES. [2021-04-28 16:36:51,451 INFO L84 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 236 events. 61/236 cut-off events. For 13/63 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1368 event pairs, 29 based on Foata normal form. 7/172 useless extension candidates. Maximal degree in co-relation 451. Up to 106 conditions per place. [2021-04-28 16:36:51,453 INFO L132 encePairwiseOnDemand]: 360/363 looper letters, 12 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2021-04-28 16:36:51,453 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 176 flow [2021-04-28 16:36:51,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 16:36:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 16:36:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 766 transitions. [2021-04-28 16:36:51,457 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7033976124885216 [2021-04-28 16:36:51,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 766 transitions. [2021-04-28 16:36:51,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 766 transitions. [2021-04-28 16:36:51,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 16:36:51,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 766 transitions. [2021-04-28 16:36:51,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,465 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,465 INFO L185 Difference]: Start difference. First operand has 56 places, 49 transitions, 130 flow. Second operand 3 states and 766 transitions. [2021-04-28 16:36:51,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 176 flow [2021-04-28 16:36:51,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-28 16:36:51,469 INFO L241 Difference]: Finished difference. Result has 58 places, 49 transitions, 137 flow [2021-04-28 16:36:51,469 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2021-04-28 16:36:51,469 INFO L343 CegarLoopForPetriNet]: 137 programPoint places, -79 predicate places. [2021-04-28 16:36:51,470 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 16:36:51,470 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 49 transitions, 137 flow [2021-04-28 16:36:51,470 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 49 transitions, 137 flow [2021-04-28 16:36:51,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 137 flow [2021-04-28 16:36:51,511 INFO L129 PetriNetUnfolder]: 61/256 cut-off events. [2021-04-28 16:36:51,512 INFO L130 PetriNetUnfolder]: For 27/29 co-relation queries the response was YES. [2021-04-28 16:36:51,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 256 events. 61/256 cut-off events. For 27/29 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1596 event pairs, 51 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 399. Up to 106 conditions per place. [2021-04-28 16:36:51,518 INFO L146 LiptonReduction]: Number of co-enabled transitions 1330 [2021-04-28 16:36:51,526 INFO L158 LiptonReduction]: Checked pairs total: 881 [2021-04-28 16:36:51,526 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 16:36:51,526 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 56 [2021-04-28 16:36:51,528 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 137 flow [2021-04-28 16:36:51,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 251.75) internal successors, (1007), 4 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,529 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 16:36:51,529 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 16:36:51,530 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-28 16:36:51,530 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 16:36:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 16:36:51,530 INFO L82 PathProgramCache]: Analyzing trace with hash -521496135, now seen corresponding path program 1 times [2021-04-28 16:36:51,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 16:36:51,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077636782] [2021-04-28 16:36:51,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 16:36:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 16:36:51,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:36:51,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 16:36:51,623 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-04-28 16:36:51,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-04-28 16:36:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 16:36:51,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077636782] [2021-04-28 16:36:51,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 16:36:51,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-28 16:36:51,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54771840] [2021-04-28 16:36:51,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-28 16:36:51,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 16:36:51,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-28 16:36:51,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-04-28 16:36:51,647 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 363 [2021-04-28 16:36:51,649 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 251.75) internal successors, (1007), 4 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,649 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 16:36:51,650 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 363 [2021-04-28 16:36:51,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 16:36:51,712 INFO L129 PetriNetUnfolder]: 48/213 cut-off events. [2021-04-28 16:36:51,713 INFO L130 PetriNetUnfolder]: For 42/82 co-relation queries the response was YES. [2021-04-28 16:36:51,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 213 events. 48/213 cut-off events. For 42/82 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1217 event pairs, 38 based on Foata normal form. 8/154 useless extension candidates. Maximal degree in co-relation 417. Up to 87 conditions per place. [2021-04-28 16:36:51,716 INFO L132 encePairwiseOnDemand]: 360/363 looper letters, 12 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2021-04-28 16:36:51,716 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 186 flow [2021-04-28 16:36:51,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 16:36:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 16:36:51,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 766 transitions. [2021-04-28 16:36:51,720 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7033976124885216 [2021-04-28 16:36:51,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 766 transitions. [2021-04-28 16:36:51,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 766 transitions. [2021-04-28 16:36:51,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 16:36:51,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 766 transitions. [2021-04-28 16:36:51,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,728 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,728 INFO L185 Difference]: Start difference. First operand has 58 places, 49 transitions, 137 flow. Second operand 3 states and 766 transitions. [2021-04-28 16:36:51,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 186 flow [2021-04-28 16:36:51,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-28 16:36:51,732 INFO L241 Difference]: Finished difference. Result has 59 places, 49 transitions, 142 flow [2021-04-28 16:36:51,732 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2021-04-28 16:36:51,732 INFO L343 CegarLoopForPetriNet]: 137 programPoint places, -78 predicate places. [2021-04-28 16:36:51,732 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 16:36:51,733 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 49 transitions, 142 flow [2021-04-28 16:36:51,733 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 49 transitions, 142 flow [2021-04-28 16:36:51,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 49 transitions, 142 flow [2021-04-28 16:36:51,772 INFO L129 PetriNetUnfolder]: 48/217 cut-off events. [2021-04-28 16:36:51,772 INFO L130 PetriNetUnfolder]: For 43/48 co-relation queries the response was YES. [2021-04-28 16:36:51,773 INFO L84 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 217 events. 48/217 cut-off events. For 43/48 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1268 event pairs, 38 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 356. Up to 87 conditions per place. [2021-04-28 16:36:51,779 INFO L146 LiptonReduction]: Number of co-enabled transitions 1322 [2021-04-28 16:36:51,784 INFO L158 LiptonReduction]: Checked pairs total: 879 [2021-04-28 16:36:51,784 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 16:36:51,784 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 52 [2021-04-28 16:36:51,786 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 142 flow [2021-04-28 16:36:51,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 251.75) internal successors, (1007), 4 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,788 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 16:36:51,788 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 16:36:51,788 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-28 16:36:51,788 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 16:36:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 16:36:51,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1830304332, now seen corresponding path program 1 times [2021-04-28 16:36:51,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 16:36:51,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308067777] [2021-04-28 16:36:51,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 16:36:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 16:36:51,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:36:51,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 16:36:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 16:36:51,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308067777] [2021-04-28 16:36:51,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 16:36:51,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-28 16:36:51,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216265473] [2021-04-28 16:36:51,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-28 16:36:51,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 16:36:51,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-28 16:36:51,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-28 16:36:51,858 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 363 [2021-04-28 16:36:51,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 277.6666666666667) internal successors, (833), 3 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 16:36:51,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 363 [2021-04-28 16:36:51,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 16:36:51,899 INFO L129 PetriNetUnfolder]: 40/173 cut-off events. [2021-04-28 16:36:51,899 INFO L130 PetriNetUnfolder]: For 91/98 co-relation queries the response was YES. [2021-04-28 16:36:51,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 173 events. 40/173 cut-off events. For 91/98 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 929 event pairs, 30 based on Foata normal form. 5/124 useless extension candidates. Maximal degree in co-relation 309. Up to 75 conditions per place. [2021-04-28 16:36:51,902 INFO L132 encePairwiseOnDemand]: 360/363 looper letters, 1 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2021-04-28 16:36:51,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 150 flow [2021-04-28 16:36:51,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 16:36:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 16:36:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 835 transitions. [2021-04-28 16:36:51,906 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7667584940312213 [2021-04-28 16:36:51,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 835 transitions. [2021-04-28 16:36:51,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 835 transitions. [2021-04-28 16:36:51,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 16:36:51,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 835 transitions. [2021-04-28 16:36:51,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,915 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,915 INFO L185 Difference]: Start difference. First operand has 59 places, 49 transitions, 142 flow. Second operand 3 states and 835 transitions. [2021-04-28 16:36:51,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 150 flow [2021-04-28 16:36:51,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 49 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-28 16:36:51,922 INFO L241 Difference]: Finished difference. Result has 60 places, 49 transitions, 147 flow [2021-04-28 16:36:51,922 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2021-04-28 16:36:51,922 INFO L343 CegarLoopForPetriNet]: 137 programPoint places, -77 predicate places. [2021-04-28 16:36:51,922 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 16:36:51,923 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 49 transitions, 147 flow [2021-04-28 16:36:51,923 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 49 transitions, 147 flow [2021-04-28 16:36:51,923 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 49 transitions, 147 flow [2021-04-28 16:36:51,953 INFO L129 PetriNetUnfolder]: 40/173 cut-off events. [2021-04-28 16:36:51,953 INFO L130 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2021-04-28 16:36:51,954 INFO L84 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 173 events. 40/173 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 853 event pairs, 30 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 309. Up to 75 conditions per place. [2021-04-28 16:36:51,959 INFO L146 LiptonReduction]: Number of co-enabled transitions 1318 [2021-04-28 16:36:51,966 INFO L158 LiptonReduction]: Checked pairs total: 877 [2021-04-28 16:36:51,967 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 16:36:51,967 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 45 [2021-04-28 16:36:51,970 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 147 flow [2021-04-28 16:36:51,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 277.6666666666667) internal successors, (833), 3 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:51,971 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 16:36:51,971 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 16:36:51,971 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-28 16:36:51,972 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 16:36:51,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 16:36:51,972 INFO L82 PathProgramCache]: Analyzing trace with hash 468933512, now seen corresponding path program 1 times [2021-04-28 16:36:51,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 16:36:51,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812657401] [2021-04-28 16:36:51,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 16:36:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 16:36:52,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:36:52,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 16:36:52,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:36:52,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-28 16:36:52,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:36:52,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 16:36:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 16:36:52,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812657401] [2021-04-28 16:36:52,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 16:36:52,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-28 16:36:52,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252205470] [2021-04-28 16:36:52,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-28 16:36:52,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 16:36:52,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-28 16:36:52,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-28 16:36:52,102 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 363 [2021-04-28 16:36:52,104 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 268.75) internal successors, (1075), 4 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:52,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 16:36:52,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 363 [2021-04-28 16:36:52,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 16:36:52,781 INFO L129 PetriNetUnfolder]: 3061/5557 cut-off events. [2021-04-28 16:36:52,782 INFO L130 PetriNetUnfolder]: For 537/543 co-relation queries the response was YES. [2021-04-28 16:36:52,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11412 conditions, 5557 events. 3061/5557 cut-off events. For 537/543 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 47375 event pairs, 1233 based on Foata normal form. 154/1730 useless extension candidates. Maximal degree in co-relation 11398. Up to 3484 conditions per place. [2021-04-28 16:36:52,838 INFO L132 encePairwiseOnDemand]: 346/363 looper letters, 27 selfloop transitions, 26 changer transitions 0/83 dead transitions. [2021-04-28 16:36:52,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 83 transitions, 321 flow [2021-04-28 16:36:52,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-28 16:36:52,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-28 16:36:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1394 transitions. [2021-04-28 16:36:52,843 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7680440771349862 [2021-04-28 16:36:52,843 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1394 transitions. [2021-04-28 16:36:52,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1394 transitions. [2021-04-28 16:36:52,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 16:36:52,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1394 transitions. [2021-04-28 16:36:52,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 278.8) internal successors, (1394), 5 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:52,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 363.0) internal successors, (2178), 6 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:52,855 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 363.0) internal successors, (2178), 6 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:52,855 INFO L185 Difference]: Start difference. First operand has 60 places, 49 transitions, 147 flow. Second operand 5 states and 1394 transitions. [2021-04-28 16:36:52,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 83 transitions, 321 flow [2021-04-28 16:36:52,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 83 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-28 16:36:52,861 INFO L241 Difference]: Finished difference. Result has 65 places, 73 transitions, 334 flow [2021-04-28 16:36:52,862 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=334, PETRI_PLACES=65, PETRI_TRANSITIONS=73} [2021-04-28 16:36:52,862 INFO L343 CegarLoopForPetriNet]: 137 programPoint places, -72 predicate places. [2021-04-28 16:36:52,862 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 16:36:52,862 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 73 transitions, 334 flow [2021-04-28 16:36:52,862 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 73 transitions, 334 flow [2021-04-28 16:36:52,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 73 transitions, 334 flow [2021-04-28 16:36:53,363 INFO L129 PetriNetUnfolder]: 2360/4358 cut-off events. [2021-04-28 16:36:53,364 INFO L130 PetriNetUnfolder]: For 1518/3992 co-relation queries the response was YES. [2021-04-28 16:36:53,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12256 conditions, 4358 events. 2360/4358 cut-off events. For 1518/3992 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 39704 event pairs, 1103 based on Foata normal form. 8/1362 useless extension candidates. Maximal degree in co-relation 12241. Up to 3652 conditions per place. [2021-04-28 16:36:53,447 INFO L146 LiptonReduction]: Number of co-enabled transitions 1840 [2021-04-28 16:36:54,863 INFO L158 LiptonReduction]: Checked pairs total: 1678 [2021-04-28 16:36:54,864 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 16:36:54,864 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2002 [2021-04-28 16:36:54,866 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 73 transitions, 334 flow [2021-04-28 16:36:54,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 268.75) internal successors, (1075), 4 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:54,867 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 16:36:54,867 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 16:36:54,867 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-28 16:36:54,867 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 16:36:54,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 16:36:54,868 INFO L82 PathProgramCache]: Analyzing trace with hash -979932502, now seen corresponding path program 1 times [2021-04-28 16:36:54,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 16:36:54,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484133824] [2021-04-28 16:36:54,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 16:36:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 16:36:54,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:36:54,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 16:36:54,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:36:54,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 16:36:54,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:36:54,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-28 16:36:54,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:36:54,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 16:36:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 16:36:54,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484133824] [2021-04-28 16:36:54,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 16:36:54,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-28 16:36:54,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920522226] [2021-04-28 16:36:54,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-28 16:36:54,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 16:36:54,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-28 16:36:54,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-28 16:36:54,960 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 363 [2021-04-28 16:36:54,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 73 transitions, 334 flow. Second operand has 5 states, 5 states have (on average 268.8) internal successors, (1344), 5 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:54,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 16:36:54,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 363 [2021-04-28 16:36:54,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 16:36:55,832 INFO L129 PetriNetUnfolder]: 2566/5407 cut-off events. [2021-04-28 16:36:55,832 INFO L130 PetriNetUnfolder]: For 2569/11305 co-relation queries the response was YES. [2021-04-28 16:36:55,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20106 conditions, 5407 events. 2566/5407 cut-off events. For 2569/11305 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 50983 event pairs, 234 based on Foata normal form. 241/2055 useless extension candidates. Maximal degree in co-relation 20089. Up to 4498 conditions per place. [2021-04-28 16:36:55,891 INFO L132 encePairwiseOnDemand]: 346/363 looper letters, 19 selfloop transitions, 50 changer transitions 9/108 dead transitions. [2021-04-28 16:36:55,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 108 transitions, 681 flow [2021-04-28 16:36:55,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-28 16:36:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-28 16:36:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1954 transitions. [2021-04-28 16:36:55,898 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7689885871704053 [2021-04-28 16:36:55,898 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1954 transitions. [2021-04-28 16:36:55,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1954 transitions. [2021-04-28 16:36:55,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 16:36:55,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1954 transitions. [2021-04-28 16:36:55,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 279.14285714285717) internal successors, (1954), 7 states have internal predecessors, (1954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:55,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 363.0) internal successors, (2904), 8 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:55,912 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 363.0) internal successors, (2904), 8 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:55,913 INFO L185 Difference]: Start difference. First operand has 65 places, 73 transitions, 334 flow. Second operand 7 states and 1954 transitions. [2021-04-28 16:36:55,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 108 transitions, 681 flow [2021-04-28 16:36:55,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 108 transitions, 681 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-04-28 16:36:55,938 INFO L241 Difference]: Finished difference. Result has 74 places, 97 transitions, 659 flow [2021-04-28 16:36:55,939 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=659, PETRI_PLACES=74, PETRI_TRANSITIONS=97} [2021-04-28 16:36:55,939 INFO L343 CegarLoopForPetriNet]: 137 programPoint places, -63 predicate places. [2021-04-28 16:36:55,939 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 16:36:55,939 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 97 transitions, 659 flow [2021-04-28 16:36:55,939 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 97 transitions, 659 flow [2021-04-28 16:36:55,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 97 transitions, 659 flow [2021-04-28 16:36:56,426 INFO L129 PetriNetUnfolder]: 1693/4111 cut-off events. [2021-04-28 16:36:56,426 INFO L130 PetriNetUnfolder]: For 5715/10794 co-relation queries the response was YES. [2021-04-28 16:36:56,461 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17408 conditions, 4111 events. 1693/4111 cut-off events. For 5715/10794 co-relation queries the response was YES. Maximal size of possible extension queue 1032. Compared 43501 event pairs, 243 based on Foata normal form. 0/1325 useless extension candidates. Maximal degree in co-relation 17388. Up to 3328 conditions per place. [2021-04-28 16:36:56,523 INFO L146 LiptonReduction]: Number of co-enabled transitions 2284 [2021-04-28 16:36:58,302 INFO L158 LiptonReduction]: Checked pairs total: 3202 [2021-04-28 16:36:58,303 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 16:36:58,303 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2364 [2021-04-28 16:36:58,304 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 97 transitions, 659 flow [2021-04-28 16:36:58,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 268.8) internal successors, (1344), 5 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:58,305 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 16:36:58,306 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-04-28 16:36:58,306 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-28 16:36:58,306 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 16:36:58,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 16:36:58,306 INFO L82 PathProgramCache]: Analyzing trace with hash -350455185, now seen corresponding path program 1 times [2021-04-28 16:36:58,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 16:36:58,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33843717] [2021-04-28 16:36:58,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 16:36:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 16:36:58,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:36:58,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 16:36:58,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:36:58,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 16:36:58,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:36:58,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 16:36:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 16:36:58,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33843717] [2021-04-28 16:36:58,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 16:36:58,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-28 16:36:58,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122395963] [2021-04-28 16:36:58,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-28 16:36:58,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 16:36:58,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-28 16:36:58,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-28 16:36:58,373 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 363 [2021-04-28 16:36:58,374 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 97 transitions, 659 flow. Second operand has 4 states, 4 states have (on average 245.25) internal successors, (981), 4 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:58,374 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 16:36:58,375 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 363 [2021-04-28 16:36:58,375 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 16:36:59,331 INFO L129 PetriNetUnfolder]: 2914/6709 cut-off events. [2021-04-28 16:36:59,331 INFO L130 PetriNetUnfolder]: For 10122/26368 co-relation queries the response was YES. [2021-04-28 16:36:59,379 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28490 conditions, 6709 events. 2914/6709 cut-off events. For 10122/26368 co-relation queries the response was YES. Maximal size of possible extension queue 1821. Compared 72552 event pairs, 441 based on Foata normal form. 74/2134 useless extension candidates. Maximal degree in co-relation 28468. Up to 5623 conditions per place. [2021-04-28 16:36:59,416 INFO L132 encePairwiseOnDemand]: 360/363 looper letters, 6 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2021-04-28 16:36:59,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 99 transitions, 684 flow [2021-04-28 16:36:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-28 16:36:59,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-28 16:36:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 984 transitions. [2021-04-28 16:36:59,420 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6776859504132231 [2021-04-28 16:36:59,421 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 984 transitions. [2021-04-28 16:36:59,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 984 transitions. [2021-04-28 16:36:59,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 16:36:59,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 984 transitions. [2021-04-28 16:36:59,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:59,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 363.0) internal successors, (1815), 5 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:59,429 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 363.0) internal successors, (1815), 5 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:36:59,429 INFO L185 Difference]: Start difference. First operand has 74 places, 97 transitions, 659 flow. Second operand 4 states and 984 transitions. [2021-04-28 16:36:59,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 99 transitions, 684 flow [2021-04-28 16:37:00,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 99 transitions, 559 flow, removed 41 selfloop flow, removed 3 redundant places. [2021-04-28 16:37:00,146 INFO L241 Difference]: Finished difference. Result has 76 places, 98 transitions, 549 flow [2021-04-28 16:37:00,147 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=549, PETRI_PLACES=76, PETRI_TRANSITIONS=98} [2021-04-28 16:37:00,147 INFO L343 CegarLoopForPetriNet]: 137 programPoint places, -61 predicate places. [2021-04-28 16:37:00,147 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 16:37:00,147 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 98 transitions, 549 flow [2021-04-28 16:37:00,147 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 98 transitions, 549 flow [2021-04-28 16:37:00,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 98 transitions, 549 flow [2021-04-28 16:37:00,847 INFO L129 PetriNetUnfolder]: 2909/6667 cut-off events. [2021-04-28 16:37:00,848 INFO L130 PetriNetUnfolder]: For 5437/5986 co-relation queries the response was YES. [2021-04-28 16:37:00,894 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22290 conditions, 6667 events. 2909/6667 cut-off events. For 5437/5986 co-relation queries the response was YES. Maximal size of possible extension queue 1698. Compared 75340 event pairs, 439 based on Foata normal form. 0/2017 useless extension candidates. Maximal degree in co-relation 22269. Up to 2746 conditions per place. [2021-04-28 16:37:00,974 INFO L146 LiptonReduction]: Number of co-enabled transitions 2334 [2021-04-28 16:37:04,858 INFO L158 LiptonReduction]: Checked pairs total: 6318 [2021-04-28 16:37:04,858 INFO L160 LiptonReduction]: Total number of compositions: 1 [2021-04-28 16:37:04,858 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4711 [2021-04-28 16:37:04,860 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 99 transitions, 557 flow [2021-04-28 16:37:04,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 245.25) internal successors, (981), 4 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:37:04,861 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 16:37:04,861 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-04-28 16:37:04,861 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-28 16:37:04,862 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 16:37:04,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 16:37:04,862 INFO L82 PathProgramCache]: Analyzing trace with hash -419933391, now seen corresponding path program 1 times [2021-04-28 16:37:04,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 16:37:04,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473368819] [2021-04-28 16:37:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 16:37:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 16:37:04,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:37:04,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 16:37:04,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:37:04,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 16:37:04,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:37:04,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 16:37:04,939 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-04-28 16:37:04,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-04-28 16:37:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 16:37:04,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473368819] [2021-04-28 16:37:04,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 16:37:04,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-28 16:37:04,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748605864] [2021-04-28 16:37:04,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-28 16:37:04,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 16:37:04,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-28 16:37:04,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-28 16:37:04,959 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 364 [2021-04-28 16:37:04,961 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 99 transitions, 557 flow. Second operand has 5 states, 5 states have (on average 221.6) internal successors, (1108), 5 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:37:04,961 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 16:37:04,961 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 364 [2021-04-28 16:37:04,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 16:37:06,459 INFO L129 PetriNetUnfolder]: 5496/12286 cut-off events. [2021-04-28 16:37:06,459 INFO L130 PetriNetUnfolder]: For 11192/11944 co-relation queries the response was YES. [2021-04-28 16:37:06,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41267 conditions, 12286 events. 5496/12286 cut-off events. For 11192/11944 co-relation queries the response was YES. Maximal size of possible extension queue 3009. Compared 146780 event pairs, 803 based on Foata normal form. 90/3823 useless extension candidates. Maximal degree in co-relation 41244. Up to 5077 conditions per place. [2021-04-28 16:37:06,555 INFO L132 encePairwiseOnDemand]: 357/364 looper letters, 16 selfloop transitions, 8 changer transitions 1/111 dead transitions. [2021-04-28 16:37:06,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 111 transitions, 668 flow [2021-04-28 16:37:06,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-28 16:37:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-28 16:37:06,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1344 transitions. [2021-04-28 16:37:06,561 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2021-04-28 16:37:06,561 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1344 transitions. [2021-04-28 16:37:06,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1344 transitions. [2021-04-28 16:37:06,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 16:37:06,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1344 transitions. [2021-04-28 16:37:06,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:37:06,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 364.0) internal successors, (2548), 7 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:37:06,572 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 364.0) internal successors, (2548), 7 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:37:06,572 INFO L185 Difference]: Start difference. First operand has 77 places, 99 transitions, 557 flow. Second operand 6 states and 1344 transitions. [2021-04-28 16:37:06,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 111 transitions, 668 flow [2021-04-28 16:37:09,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 111 transitions, 664 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-28 16:37:09,075 INFO L241 Difference]: Finished difference. Result has 83 places, 102 transitions, 590 flow [2021-04-28 16:37:09,075 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=590, PETRI_PLACES=83, PETRI_TRANSITIONS=102} [2021-04-28 16:37:09,076 INFO L343 CegarLoopForPetriNet]: 137 programPoint places, -54 predicate places. [2021-04-28 16:37:09,076 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 16:37:09,076 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 102 transitions, 590 flow [2021-04-28 16:37:09,076 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 102 transitions, 590 flow [2021-04-28 16:37:09,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 102 transitions, 590 flow [2021-04-28 16:37:10,035 INFO L129 PetriNetUnfolder]: 5477/12153 cut-off events. [2021-04-28 16:37:10,035 INFO L130 PetriNetUnfolder]: For 9886/10993 co-relation queries the response was YES. [2021-04-28 16:37:10,084 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40731 conditions, 12153 events. 5477/12153 cut-off events. For 9886/10993 co-relation queries the response was YES. Maximal size of possible extension queue 2892. Compared 146751 event pairs, 809 based on Foata normal form. 0/3584 useless extension candidates. Maximal degree in co-relation 40707. Up to 5077 conditions per place. [2021-04-28 16:37:10,218 INFO L146 LiptonReduction]: Number of co-enabled transitions 2578 [2021-04-28 16:37:14,103 INFO L158 LiptonReduction]: Checked pairs total: 9341 [2021-04-28 16:37:14,104 INFO L160 LiptonReduction]: Total number of compositions: 2 [2021-04-28 16:37:14,104 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5028 [2021-04-28 16:37:14,105 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 104 transitions, 601 flow [2021-04-28 16:37:14,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 221.6) internal successors, (1108), 5 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:37:14,106 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 16:37:14,106 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-04-28 16:37:14,106 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-28 16:37:14,106 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 16:37:14,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 16:37:14,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1671898927, now seen corresponding path program 1 times [2021-04-28 16:37:14,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 16:37:14,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967638832] [2021-04-28 16:37:14,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 16:37:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 16:37:14,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:37:14,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 16:37:14,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:37:14,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 16:37:14,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:37:14,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 16:37:14,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:37:14,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-28 16:37:14,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 16:37:14,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 16:37:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 16:37:14,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967638832] [2021-04-28 16:37:14,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 16:37:14,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-28 16:37:14,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426841476] [2021-04-28 16:37:14,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-28 16:37:14,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 16:37:14,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-28 16:37:14,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-04-28 16:37:14,240 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 366 [2021-04-28 16:37:14,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 104 transitions, 601 flow. Second operand has 6 states, 6 states have (on average 271.8333333333333) internal successors, (1631), 6 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:37:14,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 16:37:14,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 366 [2021-04-28 16:37:14,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 16:37:15,812 INFO L129 PetriNetUnfolder]: 5101/12042 cut-off events. [2021-04-28 16:37:15,812 INFO L130 PetriNetUnfolder]: For 11800/57920 co-relation queries the response was YES. [2021-04-28 16:37:15,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50359 conditions, 12042 events. 5101/12042 cut-off events. For 11800/57920 co-relation queries the response was YES. Maximal size of possible extension queue 3183. Compared 144865 event pairs, 29 based on Foata normal form. 566/4151 useless extension candidates. Maximal degree in co-relation 50333. Up to 6048 conditions per place. [2021-04-28 16:37:15,907 INFO L132 encePairwiseOnDemand]: 349/366 looper letters, 2 selfloop transitions, 28 changer transitions 67/121 dead transitions. [2021-04-28 16:37:15,908 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 121 transitions, 879 flow [2021-04-28 16:37:15,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-28 16:37:15,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-04-28 16:37:15,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2523 transitions. [2021-04-28 16:37:15,916 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7659380692167578 [2021-04-28 16:37:15,916 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2523 transitions. [2021-04-28 16:37:15,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2523 transitions. [2021-04-28 16:37:15,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 16:37:15,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2523 transitions. [2021-04-28 16:37:15,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 280.3333333333333) internal successors, (2523), 9 states have internal predecessors, (2523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:37:15,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 366.0) internal successors, (3660), 10 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:37:15,934 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 366.0) internal successors, (3660), 10 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:37:15,934 INFO L185 Difference]: Start difference. First operand has 85 places, 104 transitions, 601 flow. Second operand 9 states and 2523 transitions. [2021-04-28 16:37:15,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 121 transitions, 879 flow [2021-04-28 16:37:18,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 121 transitions, 856 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-04-28 16:37:18,303 INFO L241 Difference]: Finished difference. Result has 92 places, 54 transitions, 357 flow [2021-04-28 16:37:18,304 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=357, PETRI_PLACES=92, PETRI_TRANSITIONS=54} [2021-04-28 16:37:18,304 INFO L343 CegarLoopForPetriNet]: 137 programPoint places, -45 predicate places. [2021-04-28 16:37:18,304 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 16:37:18,304 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 54 transitions, 357 flow [2021-04-28 16:37:18,305 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 54 transitions, 357 flow [2021-04-28 16:37:18,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 54 transitions, 357 flow [2021-04-28 16:37:18,334 INFO L129 PetriNetUnfolder]: 105/334 cut-off events. [2021-04-28 16:37:18,334 INFO L130 PetriNetUnfolder]: For 708/876 co-relation queries the response was YES. [2021-04-28 16:37:18,335 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1454 conditions, 334 events. 105/334 cut-off events. For 708/876 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2046 event pairs, 6 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 1429. Up to 172 conditions per place. [2021-04-28 16:37:18,338 INFO L146 LiptonReduction]: Number of co-enabled transitions 678 [2021-04-28 16:37:18,666 INFO L158 LiptonReduction]: Checked pairs total: 1389 [2021-04-28 16:37:18,667 INFO L160 LiptonReduction]: Total number of compositions: 3 [2021-04-28 16:37:18,667 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 363 [2021-04-28 16:37:18,668 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 362 flow [2021-04-28 16:37:18,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 271.8333333333333) internal successors, (1631), 6 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 16:37:18,669 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 16:37:18,670 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-04-28 16:37:18,670 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-28 16:37:18,670 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 16:37:18,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 16:37:18,670 INFO L82 PathProgramCache]: Analyzing trace with hash -64736388, now seen corresponding path program 1 times [2021-04-28 16:37:18,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 16:37:18,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860375056] [2021-04-28 16:37:18,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 16:37:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-28 16:37:18,737 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-28 16:37:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-28 16:37:18,811 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-28 16:37:18,877 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-28 16:37:18,878 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-04-28 16:37:18,878 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-28 16:37:19,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 04:37:19 BasicIcfg [2021-04-28 16:37:19,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-28 16:37:19,062 INFO L168 Benchmark]: Toolchain (without parser) took 75514.45 ms. Allocated memory was 302.0 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 276.5 MB in the beginning and 559.2 MB in the end (delta: -282.7 MB). Peak memory consumption was 748.9 MB. Max. memory is 16.0 GB. [2021-04-28 16:37:19,062 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 302.0 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-04-28 16:37:19,063 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.78 ms. Allocated memory is still 302.0 MB. Free memory was 273.3 MB in the beginning and 279.3 MB in the end (delta: -6.0 MB). Peak memory consumption was 37.8 MB. Max. memory is 16.0 GB. [2021-04-28 16:37:19,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.50 ms. Allocated memory is still 302.0 MB. Free memory was 279.3 MB in the beginning and 277.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-28 16:37:19,068 INFO L168 Benchmark]: Boogie Preprocessor took 52.84 ms. Allocated memory is still 302.0 MB. Free memory was 277.2 MB in the beginning and 275.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-28 16:37:19,068 INFO L168 Benchmark]: RCFGBuilder took 2344.32 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 275.1 MB in the beginning and 277.6 MB in the end (delta: -2.5 MB). Peak memory consumption was 169.9 MB. Max. memory is 16.0 GB. [2021-04-28 16:37:19,069 INFO L168 Benchmark]: TraceAbstraction took 72239.32 ms. Allocated memory was 362.8 MB in the beginning and 1.3 GB in the end (delta: 968.9 MB). Free memory was 276.6 MB in the beginning and 559.2 MB in the end (delta: -282.6 MB). Peak memory consumption was 686.3 MB. Max. memory is 16.0 GB. [2021-04-28 16:37:19,072 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.31 ms. Allocated memory is still 302.0 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 762.78 ms. Allocated memory is still 302.0 MB. Free memory was 273.3 MB in the beginning and 279.3 MB in the end (delta: -6.0 MB). Peak memory consumption was 37.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 62.50 ms. Allocated memory is still 302.0 MB. Free memory was 279.3 MB in the beginning and 277.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 52.84 ms. Allocated memory is still 302.0 MB. Free memory was 277.2 MB in the beginning and 275.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2344.32 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 275.1 MB in the beginning and 277.6 MB in the end (delta: -2.5 MB). Peak memory consumption was 169.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 72239.32 ms. Allocated memory was 362.8 MB in the beginning and 1.3 GB in the end (delta: 968.9 MB). Free memory was 276.6 MB in the beginning and 559.2 MB in the end (delta: -282.6 MB). Peak memory consumption was 686.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 41943.1ms, 112 PlacesBefore, 137 PlacesAfterwards, 104 TransitionsBefore, 128 TransitionsAfterwards, 2076 CoEnabledTransitionPairs, 8 FixpointIterations, 159 TrivialSequentialCompositions, 95 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 256 TotalNumberOfCompositions, 19494 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5797, positive: 5488, positive conditional: 5488, positive unconditional: 0, negative: 309, negative conditional: 309, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2576, positive: 2509, positive conditional: 0, positive unconditional: 2509, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2576, positive: 2509, positive conditional: 0, positive unconditional: 2509, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2576, positive: 2485, positive conditional: 0, positive unconditional: 2485, negative: 91, negative conditional: 0, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 91, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1067, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 994, negative conditional: 0, negative unconditional: 994, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5797, positive: 2979, positive conditional: 2979, positive unconditional: 0, negative: 242, negative conditional: 242, negative unconditional: 0, unknown: 2576, unknown conditional: 2576, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2575, Positive cache size: 2508, Positive conditional cache size: 2508, Positive unconditional cache size: 0, Negative cache size: 67, Negative conditional cache size: 67, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 426.8ms, 133 PlacesBefore, 79 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 2504 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 3276 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 511, positive: 425, positive conditional: 425, positive unconditional: 0, negative: 86, negative conditional: 86, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, positive: 54, positive conditional: 9, positive unconditional: 45, negative: 29, negative conditional: 6, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 83, positive: 54, positive conditional: 9, positive unconditional: 45, negative: 29, negative conditional: 6, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 83, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 29, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 29, negative conditional: 6, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 394, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 394, negative conditional: 149, negative unconditional: 246, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 511, positive: 371, positive conditional: 371, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 83, unknown conditional: 83, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2658, Positive cache size: 2562, Positive conditional cache size: 2562, Positive unconditional cache size: 0, Negative cache size: 96, Negative conditional cache size: 96, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 135.2ms, 80 PlacesBefore, 56 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 1334 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 883 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 239, positive: 212, positive conditional: 212, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, positive: 58, positive conditional: 3, positive unconditional: 55, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62, positive: 58, positive conditional: 3, positive unconditional: 55, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 62, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 239, positive: 154, positive conditional: 154, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 62, unknown conditional: 62, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2720, Positive cache size: 2620, Positive conditional cache size: 2620, Positive unconditional cache size: 0, Negative cache size: 100, Negative conditional cache size: 100, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 55.8ms, 58 PlacesBefore, 58 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 1330 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 881 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 206, positive: 179, positive conditional: 179, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 206, positive: 169, positive conditional: 169, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2730, Positive cache size: 2630, Positive conditional cache size: 2630, Positive unconditional cache size: 0, Negative cache size: 100, Negative conditional cache size: 100, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.4ms, 59 PlacesBefore, 59 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 1322 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 879 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 199, positive: 172, positive conditional: 172, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 4, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 4, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 199, positive: 167, positive conditional: 167, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2735, Positive cache size: 2635, Positive conditional cache size: 2635, Positive unconditional cache size: 0, Negative cache size: 100, Negative conditional cache size: 100, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 43.9ms, 60 PlacesBefore, 60 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 1318 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 877 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 207, positive: 180, positive conditional: 180, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 1, positive unconditional: 10, 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: 1, positive unconditional: 10, 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: 207, positive: 169, positive conditional: 169, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2746, Positive cache size: 2646, Positive conditional cache size: 2646, Positive unconditional cache size: 0, Negative cache size: 100, Negative conditional cache size: 100, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2001.4ms, 65 PlacesBefore, 65 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 1840 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1678 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 423, positive: 390, positive conditional: 390, positive unconditional: 0, negative: 33, negative conditional: 33, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, positive: 69, positive conditional: 38, positive unconditional: 31, 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: 69, positive: 69, positive conditional: 38, positive unconditional: 31, 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: 69, positive: 69, positive conditional: 0, positive unconditional: 69, 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: 423, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 33, negative conditional: 33, negative unconditional: 0, unknown: 69, unknown conditional: 69, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2815, Positive cache size: 2715, Positive conditional cache size: 2715, Positive unconditional cache size: 0, Negative cache size: 100, Negative conditional cache size: 100, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2363.1ms, 74 PlacesBefore, 74 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 2284 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 3202 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 609, positive: 558, positive conditional: 558, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, positive: 71, positive conditional: 64, positive unconditional: 7, 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: 71, positive: 71, positive conditional: 64, positive unconditional: 7, 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: 71, positive: 71, positive conditional: 0, positive unconditional: 71, 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: 609, positive: 487, positive conditional: 487, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 71, unknown conditional: 71, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2886, Positive cache size: 2786, Positive conditional cache size: 2786, Positive unconditional cache size: 0, Negative cache size: 100, Negative conditional cache size: 100, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4710.7ms, 76 PlacesBefore, 77 PlacesAfterwards, 98 TransitionsBefore, 99 TransitionsAfterwards, 2334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 6318 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1357, positive: 1259, positive conditional: 1259, positive unconditional: 0, negative: 98, negative conditional: 98, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 120, positive: 120, positive conditional: 94, positive unconditional: 26, 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: 120, positive: 120, positive conditional: 94, positive unconditional: 26, 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: 120, positive: 120, positive conditional: 0, positive unconditional: 120, 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: 1357, positive: 1139, positive conditional: 1139, positive unconditional: 0, negative: 98, negative conditional: 98, negative unconditional: 0, unknown: 120, unknown conditional: 120, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3006, Positive cache size: 2906, Positive conditional cache size: 2906, Positive unconditional cache size: 0, Negative cache size: 100, Negative conditional cache size: 100, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5027.7ms, 83 PlacesBefore, 85 PlacesAfterwards, 102 TransitionsBefore, 104 TransitionsAfterwards, 2578 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 9341 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1805, positive: 1661, positive conditional: 1661, positive unconditional: 0, negative: 144, negative conditional: 144, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, positive: 72, positive conditional: 52, positive unconditional: 20, 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: 72, positive: 72, positive conditional: 52, positive unconditional: 20, 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: 72, positive: 72, positive conditional: 0, positive unconditional: 72, 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: 1805, positive: 1589, positive conditional: 1589, positive unconditional: 0, negative: 144, negative conditional: 144, negative unconditional: 0, unknown: 72, unknown conditional: 72, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3078, Positive cache size: 2978, Positive conditional cache size: 2978, Positive unconditional cache size: 0, Negative cache size: 100, Negative conditional cache size: 100, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 362.0ms, 92 PlacesBefore, 68 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 678 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1389 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 453, positive: 399, positive conditional: 399, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, positive: 60, positive conditional: 35, positive unconditional: 25, 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: 62, positive: 60, positive conditional: 35, positive unconditional: 25, 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: 62, positive: 60, positive conditional: 0, positive unconditional: 60, 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: 73, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 453, positive: 339, positive conditional: 339, positive unconditional: 0, negative: 52, negative conditional: 52, negative unconditional: 0, unknown: 62, unknown conditional: 62, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3140, Positive cache size: 3038, Positive conditional cache size: 3038, Positive unconditional cache size: 0, Negative cache size: 102, Negative conditional cache size: 102, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool a$flush_delayed; [L725] 0 int a$mem_tmp; [L726] 0 _Bool a$r_buff0_thd0; [L727] 0 _Bool a$r_buff0_thd1; [L728] 0 _Bool a$r_buff0_thd2; [L729] 0 _Bool a$r_buff0_thd3; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$read_delayed; [L735] 0 int *a$read_delayed_var; [L736] 0 int a$w_buff0; [L737] 0 _Bool a$w_buff0_used; [L738] 0 int a$w_buff1; [L739] 0 _Bool a$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t38; [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 [L768] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L857] 0 pthread_t t39; [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L859] 0 pthread_t t40; [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L771] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L822] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L822] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L823] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L823] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L824] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L824] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L825] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L826] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L826] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L827] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L833] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L833] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L833] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 1 return 0; VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L797] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L797] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L797] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L797] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L799] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L801] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L866] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L866] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L866] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L866] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L868] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L870] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 13.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 71903.3ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 13091.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 42063.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 81 SDtfs, 98 SDslu, 26 SDs, 0 SdLazy, 364 SolverSat, 151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 555.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 219.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=659occurred in iteration=7, InterpolantAutomatonStates: 46, 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: 48.6ms SsaConstructionTime, 418.6ms SatisfiabilityAnalysisTime, 660.7ms InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 836 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...