/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/mix032_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-6f4246e9f5583d222ebb38ff8175c901f3a528f0-6f4246e [2021-04-28 20:08:08,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-28 20:08:08,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-28 20:08:09,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-28 20:08:09,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-28 20:08:09,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-28 20:08:09,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-28 20:08:09,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-28 20:08:09,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-28 20:08:09,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-28 20:08:09,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-28 20:08:09,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-28 20:08:09,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-28 20:08:09,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-28 20:08:09,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-28 20:08:09,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-28 20:08:09,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-28 20:08:09,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-28 20:08:09,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-28 20:08:09,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-28 20:08:09,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-28 20:08:09,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-28 20:08:09,074 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-28 20:08:09,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-28 20:08:09,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-28 20:08:09,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-28 20:08:09,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-28 20:08:09,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-28 20:08:09,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-28 20:08:09,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-28 20:08:09,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-28 20:08:09,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-28 20:08:09,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-28 20:08:09,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-28 20:08:09,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-28 20:08:09,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-28 20:08:09,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-28 20:08:09,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-28 20:08:09,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-28 20:08:09,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-28 20:08:09,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-28 20:08:09,093 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 20:08:09,126 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-28 20:08:09,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-28 20:08:09,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-28 20:08:09,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-28 20:08:09,131 INFO L138 SettingsManager]: * Use SBE=true [2021-04-28 20:08:09,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-28 20:08:09,132 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-28 20:08:09,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-28 20:08:09,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-28 20:08:09,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-28 20:08:09,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-28 20:08:09,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-28 20:08:09,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-28 20:08:09,134 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-28 20:08:09,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-28 20:08:09,135 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-28 20:08:09,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-28 20:08:09,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-28 20:08:09,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-28 20:08:09,137 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-28 20:08:09,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-28 20:08:09,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-28 20:08:09,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-28 20:08:09,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-28 20:08:09,138 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-28 20:08:09,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-28 20:08:09,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-28 20:08:09,139 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-04-28 20:08:09,139 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-04-28 20:08:09,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-04-28 20:08:09,140 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 20:08:09,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-28 20:08:09,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-28 20:08:09,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-28 20:08:09,603 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-28 20:08:09,604 INFO L275 PluginConnector]: CDTParser initialized [2021-04-28 20:08:09,605 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_tso.oepc.i [2021-04-28 20:08:09,686 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72211403/76a85099405b42baaa879c32445e5f87/FLAG89148cfeb [2021-04-28 20:08:10,525 INFO L306 CDTParser]: Found 1 translation units. [2021-04-28 20:08:10,526 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_tso.oepc.i [2021-04-28 20:08:10,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72211403/76a85099405b42baaa879c32445e5f87/FLAG89148cfeb [2021-04-28 20:08:10,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72211403/76a85099405b42baaa879c32445e5f87 [2021-04-28 20:08:10,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-28 20:08:10,819 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-28 20:08:10,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-28 20:08:10,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-28 20:08:10,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-28 20:08:10,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:08:10" (1/1) ... [2021-04-28 20:08:10,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@118d757a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:08:10, skipping insertion in model container [2021-04-28 20:08:10,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:08:10" (1/1) ... [2021-04-28 20:08:10,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-28 20:08:10,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-28 20:08:11,075 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/mix032_tso.oepc.i[949,962] [2021-04-28 20:08:11,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-28 20:08:11,303 INFO L203 MainTranslator]: Completed pre-run [2021-04-28 20:08:11,318 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/mix032_tso.oepc.i[949,962] [2021-04-28 20:08:11,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-28 20:08:11,591 INFO L208 MainTranslator]: Completed translation [2021-04-28 20:08:11,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:08:11 WrapperNode [2021-04-28 20:08:11,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-28 20:08:11,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-28 20:08:11,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-28 20:08:11,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-28 20:08:11,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:08:11" (1/1) ... [2021-04-28 20:08:11,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:08:11" (1/1) ... [2021-04-28 20:08:11,659 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-28 20:08:11,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-28 20:08:11,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-28 20:08:11,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-28 20:08:11,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:08:11" (1/1) ... [2021-04-28 20:08:11,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:08:11" (1/1) ... [2021-04-28 20:08:11,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:08:11" (1/1) ... [2021-04-28 20:08:11,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:08:11" (1/1) ... [2021-04-28 20:08:11,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:08:11" (1/1) ... [2021-04-28 20:08:11,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:08:11" (1/1) ... [2021-04-28 20:08:11,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:08:11" (1/1) ... [2021-04-28 20:08:11,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-28 20:08:11,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-28 20:08:11,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-28 20:08:11,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-28 20:08:11,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:08:11" (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 20:08:11,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-28 20:08:11,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-28 20:08:11,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-28 20:08:11,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-28 20:08:11,808 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-28 20:08:11,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-28 20:08:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-28 20:08:11,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-28 20:08:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-04-28 20:08:11,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-04-28 20:08:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-28 20:08:11,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-28 20:08:11,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-28 20:08:11,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-28 20:08:11,812 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 20:08:14,063 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-28 20:08:14,063 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-28 20:08:14,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:08:14 BoogieIcfgContainer [2021-04-28 20:08:14,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-28 20:08:14,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-28 20:08:14,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-28 20:08:14,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-28 20:08:14,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:08:10" (1/3) ... [2021-04-28 20:08:14,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3951bb4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:08:14, skipping insertion in model container [2021-04-28 20:08:14,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:08:11" (2/3) ... [2021-04-28 20:08:14,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3951bb4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:08:14, skipping insertion in model container [2021-04-28 20:08:14,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:08:14" (3/3) ... [2021-04-28 20:08:14,074 INFO L111 eAbstractionObserver]: Analyzing ICFG mix032_tso.oepc.i [2021-04-28 20:08:14,082 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-28 20:08:14,087 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-28 20:08:14,088 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-28 20:08:14,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,130 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,131 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,131 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,131 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,132 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,132 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,133 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,133 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,138 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,138 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,139 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,139 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,163 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,168 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,169 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,169 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,171 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,172 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,176 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,178 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:08:14,181 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-28 20:08:14,206 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-04-28 20:08:14,232 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-28 20:08:14,232 INFO L377 AbstractCegarLoop]: Hoare is false [2021-04-28 20:08:14,232 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-28 20:08:14,232 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-28 20:08:14,232 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-28 20:08:14,233 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-28 20:08:14,233 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-28 20:08:14,233 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-28 20:08:14,247 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2021-04-28 20:08:14,306 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2021-04-28 20:08:14,306 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 20:08:14,326 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 3. Compared 75 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 20:08:14,327 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2021-04-28 20:08:14,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2021-04-28 20:08:14,340 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:08:14,363 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2021-04-28 20:08:14,369 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2021-04-28 20:08:14,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2021-04-28 20:08:14,416 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2021-04-28 20:08:14,416 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 20:08:14,420 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 20:08:14,425 INFO L146 LiptonReduction]: Number of co-enabled transitions 2054 [2021-04-28 20:08:17,853 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-04-28 20:08:17,964 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-28 20:08:18,480 WARN L205 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-04-28 20:08:18,689 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-04-28 20:08:31,710 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-04-28 20:08:31,823 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-04-28 20:08:31,927 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-04-28 20:08:33,041 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-28 20:08:33,710 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-04-28 20:08:33,832 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-04-28 20:08:33,950 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-04-28 20:08:34,075 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-04-28 20:08:34,762 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-28 20:08:34,868 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-28 20:08:34,975 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-28 20:08:35,082 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-28 20:08:35,313 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-28 20:08:35,512 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-28 20:08:37,012 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-28 20:08:37,132 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-28 20:08:37,248 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-28 20:08:37,365 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-28 20:08:37,491 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-28 20:08:37,615 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-28 20:08:37,741 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-28 20:08:37,865 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-28 20:08:37,991 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-28 20:08:38,772 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-28 20:08:38,896 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-28 20:08:39,006 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-28 20:08:39,114 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-28 20:08:39,219 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-28 20:08:39,322 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-28 20:08:39,733 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 20:08:39,883 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 20:08:40,032 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 20:08:40,174 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-28 20:08:40,298 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-28 20:08:40,419 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-28 20:08:40,541 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-28 20:08:40,665 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-28 20:08:40,840 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 20:08:41,054 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 20:08:41,224 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 20:08:41,396 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 20:08:41,916 WARN L205 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 119 [2021-04-28 20:08:42,171 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-04-28 20:08:42,690 WARN L205 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 119 [2021-04-28 20:08:42,937 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-04-28 20:08:43,137 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-04-28 20:08:43,335 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-04-28 20:08:43,533 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-04-28 20:08:43,723 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-04-28 20:08:43,971 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:44,190 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:44,412 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:44,634 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:44,803 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 20:08:44,972 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 20:08:45,146 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 20:08:45,320 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 20:08:45,492 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 20:08:45,658 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 20:08:45,819 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 20:08:45,989 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 20:08:46,208 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:46,430 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:46,681 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:46,891 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:47,094 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:47,290 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:47,504 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:47,709 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:47,923 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:48,137 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:48,351 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:48,558 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:48,735 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 20:08:48,917 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 20:08:49,094 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 20:08:49,272 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 20:08:49,882 WARN L205 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-04-28 20:08:50,167 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-04-28 20:08:50,725 WARN L205 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-04-28 20:08:50,986 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-04-28 20:08:51,190 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:08:51,393 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:08:51,597 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:08:51,798 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:08:51,952 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 20:08:52,104 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 20:08:52,258 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 20:08:52,407 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 20:08:52,557 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 20:08:52,703 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 20:08:52,850 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 20:08:53,008 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 20:08:53,201 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 20:08:53,384 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 20:08:53,579 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 20:08:53,768 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 20:08:53,981 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-04-28 20:08:54,194 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-04-28 20:08:54,405 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-04-28 20:08:54,616 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-04-28 20:08:54,754 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-28 20:08:54,890 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-28 20:08:55,029 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-28 20:08:55,170 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-28 20:08:55,330 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 20:08:55,489 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 20:08:55,650 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 20:08:55,808 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 20:08:56,028 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:56,239 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:56,468 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:56,686 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-04-28 20:08:56,742 INFO L158 LiptonReduction]: Checked pairs total: 18578 [2021-04-28 20:08:56,744 INFO L160 LiptonReduction]: Total number of compositions: 257 [2021-04-28 20:08:56,758 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42419 [2021-04-28 20:08:56,808 INFO L129 PetriNetUnfolder]: 0/59 cut-off events. [2021-04-28 20:08:56,808 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 20:08:56,808 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:08:56,809 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-04-28 20:08:56,810 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 20:08:56,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:08:56,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1243095, now seen corresponding path program 1 times [2021-04-28 20:08:56,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:08:56,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799183883] [2021-04-28 20:08:56,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:08:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 20:08:57,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:08:57,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:08:57,156 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 20:08:57,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799183883] [2021-04-28 20:08:57,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 20:08:57,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-28 20:08:57,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587053] [2021-04-28 20:08:57,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-28 20:08:57,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 20:08:57,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-28 20:08:57,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-28 20:08:57,186 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 364 [2021-04-28 20:08:57,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 129 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 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 20:08:57,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 20:08:57,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 364 [2021-04-28 20:08:57,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 20:08:57,357 INFO L129 PetriNetUnfolder]: 49/334 cut-off events. [2021-04-28 20:08:57,358 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 20:08:57,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 334 events. 49/334 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2406 event pairs, 9 based on Foata normal form. 35/162 useless extension candidates. Maximal degree in co-relation 368. Up to 65 conditions per place. [2021-04-28 20:08:57,364 INFO L132 encePairwiseOnDemand]: 343/364 looper letters, 9 selfloop transitions, 2 changer transitions 54/129 dead transitions. [2021-04-28 20:08:57,364 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 129 transitions, 319 flow [2021-04-28 20:08:57,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 20:08:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 20:08:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2021-04-28 20:08:57,385 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8076923076923077 [2021-04-28 20:08:57,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 882 transitions. [2021-04-28 20:08:57,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 882 transitions. [2021-04-28 20:08:57,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 20:08:57,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 882 transitions. [2021-04-28 20:08:57,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 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 20:08:57,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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 20:08:57,414 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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 20:08:57,416 INFO L185 Difference]: Start difference. First operand has 138 places, 129 transitions, 267 flow. Second operand 3 states and 882 transitions. [2021-04-28 20:08:57,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 129 transitions, 319 flow [2021-04-28 20:08:57,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 129 transitions, 316 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-04-28 20:08:57,424 INFO L241 Difference]: Finished difference. Result has 134 places, 71 transitions, 152 flow [2021-04-28 20:08:57,427 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=134, PETRI_TRANSITIONS=71} [2021-04-28 20:08:57,427 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -4 predicate places. [2021-04-28 20:08:57,428 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:08:57,428 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 71 transitions, 152 flow [2021-04-28 20:08:57,428 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 71 transitions, 152 flow [2021-04-28 20:08:57,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 71 transitions, 152 flow [2021-04-28 20:08:57,439 INFO L129 PetriNetUnfolder]: 0/71 cut-off events. [2021-04-28 20:08:57,439 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 20:08:57,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 71 events. 0/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 370 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-04-28 20:08:57,442 INFO L146 LiptonReduction]: Number of co-enabled transitions 2588 [2021-04-28 20:08:57,577 INFO L158 LiptonReduction]: Checked pairs total: 3220 [2021-04-28 20:08:57,577 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 20:08:57,577 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 149 [2021-04-28 20:08:57,579 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 71 transitions, 152 flow [2021-04-28 20:08:57,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 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 20:08:57,581 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:08:57,581 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 20:08:57,581 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-28 20:08:57,581 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 20:08:57,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:08:57,582 INFO L82 PathProgramCache]: Analyzing trace with hash -165797652, now seen corresponding path program 1 times [2021-04-28 20:08:57,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:08:57,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804212617] [2021-04-28 20:08:57,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:08:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 20:08:57,702 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-04-28 20:08:57,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-04-28 20:08:57,714 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 20:08:57,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804212617] [2021-04-28 20:08:57,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 20:08:57,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-28 20:08:57,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021244443] [2021-04-28 20:08:57,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-28 20:08:57,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 20:08:57,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-28 20:08:57,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-28 20:08:57,720 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 364 [2021-04-28 20:08:57,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 0 states have call successors, (0), 0 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 20:08:57,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 20:08:57,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 364 [2021-04-28 20:08:57,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 20:08:58,246 INFO L129 PetriNetUnfolder]: 988/2625 cut-off events. [2021-04-28 20:08:58,247 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 20:08:58,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4293 conditions, 2625 events. 988/2625 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 26272 event pairs, 338 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 4284. Up to 1431 conditions per place. [2021-04-28 20:08:58,262 INFO L132 encePairwiseOnDemand]: 343/364 looper letters, 6 selfloop transitions, 4 changer transitions 48/98 dead transitions. [2021-04-28 20:08:58,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 98 transitions, 322 flow [2021-04-28 20:08:58,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 20:08:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 20:08:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2021-04-28 20:08:58,266 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7472527472527473 [2021-04-28 20:08:58,266 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 816 transitions. [2021-04-28 20:08:58,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 816 transitions. [2021-04-28 20:08:58,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 20:08:58,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 816 transitions. [2021-04-28 20:08:58,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 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 20:08:58,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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 20:08:58,276 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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 20:08:58,276 INFO L185 Difference]: Start difference. First operand has 80 places, 71 transitions, 152 flow. Second operand 3 states and 816 transitions. [2021-04-28 20:08:58,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 98 transitions, 322 flow [2021-04-28 20:08:58,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 98 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-28 20:08:58,279 INFO L241 Difference]: Finished difference. Result has 81 places, 50 transitions, 130 flow [2021-04-28 20:08:58,280 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=81, PETRI_TRANSITIONS=50} [2021-04-28 20:08:58,280 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -57 predicate places. [2021-04-28 20:08:58,280 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:08:58,281 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 50 transitions, 130 flow [2021-04-28 20:08:58,281 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 50 transitions, 130 flow [2021-04-28 20:08:58,282 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 50 transitions, 130 flow [2021-04-28 20:08:58,310 INFO L129 PetriNetUnfolder]: 46/173 cut-off events. [2021-04-28 20:08:58,311 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 20:08:58,312 INFO L84 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 173 events. 46/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 879 event pairs, 26 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 258. Up to 81 conditions per place. [2021-04-28 20:08:58,316 INFO L146 LiptonReduction]: Number of co-enabled transitions 1388 [2021-04-28 20:08:58,366 INFO L158 LiptonReduction]: Checked pairs total: 902 [2021-04-28 20:08:58,366 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 20:08:58,367 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 87 [2021-04-28 20:08:58,369 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 130 flow [2021-04-28 20:08:58,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 0 states have call successors, (0), 0 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 20:08:58,370 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:08:58,370 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 20:08:58,370 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-28 20:08:58,370 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 20:08:58,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:08:58,371 INFO L82 PathProgramCache]: Analyzing trace with hash -417854611, now seen corresponding path program 1 times [2021-04-28 20:08:58,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:08:58,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653072850] [2021-04-28 20:08:58,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:08:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 20:08:58,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:08:58,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:08:58,502 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-04-28 20:08:58,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-04-28 20:08:58,519 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 20:08:58,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653072850] [2021-04-28 20:08:58,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 20:08:58,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-28 20:08:58,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936638028] [2021-04-28 20:08:58,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-28 20:08:58,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 20:08:58,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-28 20:08:58,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-04-28 20:08:58,523 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 364 [2021-04-28 20:08:58,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 253.75) internal successors, (1015), 4 states have internal predecessors, (1015), 0 states have call successors, (0), 0 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 20:08:58,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 20:08:58,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 364 [2021-04-28 20:08:58,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 20:08:58,580 INFO L129 PetriNetUnfolder]: 36/162 cut-off events. [2021-04-28 20:08:58,580 INFO L130 PetriNetUnfolder]: For 11/41 co-relation queries the response was YES. [2021-04-28 20:08:58,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 162 events. 36/162 cut-off events. For 11/41 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 803 event pairs, 18 based on Foata normal form. 6/113 useless extension candidates. Maximal degree in co-relation 297. Up to 66 conditions per place. [2021-04-28 20:08:58,582 INFO L132 encePairwiseOnDemand]: 361/364 looper letters, 10 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2021-04-28 20:08:58,582 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 168 flow [2021-04-28 20:08:58,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 20:08:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 20:08:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 770 transitions. [2021-04-28 20:08:58,593 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7051282051282052 [2021-04-28 20:08:58,593 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 770 transitions. [2021-04-28 20:08:58,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 770 transitions. [2021-04-28 20:08:58,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 20:08:58,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 770 transitions. [2021-04-28 20:08:58,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 0 states have call successors, (0), 0 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 20:08:58,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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 20:08:58,603 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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 20:08:58,604 INFO L185 Difference]: Start difference. First operand has 57 places, 50 transitions, 130 flow. Second operand 3 states and 770 transitions. [2021-04-28 20:08:58,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 168 flow [2021-04-28 20:08:58,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-28 20:08:58,606 INFO L241 Difference]: Finished difference. Result has 59 places, 50 transitions, 137 flow [2021-04-28 20:08:58,607 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2021-04-28 20:08:58,607 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -79 predicate places. [2021-04-28 20:08:58,607 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:08:58,607 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 50 transitions, 137 flow [2021-04-28 20:08:58,608 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 50 transitions, 137 flow [2021-04-28 20:08:58,608 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 50 transitions, 137 flow [2021-04-28 20:08:58,636 INFO L129 PetriNetUnfolder]: 36/174 cut-off events. [2021-04-28 20:08:58,636 INFO L130 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2021-04-28 20:08:58,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 174 events. 36/174 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 947 event pairs, 26 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 265. Up to 66 conditions per place. [2021-04-28 20:08:58,642 INFO L146 LiptonReduction]: Number of co-enabled transitions 1380 [2021-04-28 20:08:58,649 INFO L158 LiptonReduction]: Checked pairs total: 900 [2021-04-28 20:08:58,649 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 20:08:58,650 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 43 [2021-04-28 20:08:58,652 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 137 flow [2021-04-28 20:08:58,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 253.75) internal successors, (1015), 4 states have internal predecessors, (1015), 0 states have call successors, (0), 0 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 20:08:58,653 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:08:58,653 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 20:08:58,653 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-28 20:08:58,653 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 20:08:58,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:08:58,654 INFO L82 PathProgramCache]: Analyzing trace with hash -417850643, now seen corresponding path program 1 times [2021-04-28 20:08:58,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:08:58,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899599098] [2021-04-28 20:08:58,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:08:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 20:08:58,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:08:58,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:08:58,715 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-04-28 20:08:58,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-04-28 20:08:58,734 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 20:08:58,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899599098] [2021-04-28 20:08:58,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 20:08:58,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-28 20:08:58,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644982886] [2021-04-28 20:08:58,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-28 20:08:58,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 20:08:58,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-28 20:08:58,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-04-28 20:08:58,740 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 364 [2021-04-28 20:08:58,742 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 253.75) internal successors, (1015), 4 states have internal predecessors, (1015), 0 states have call successors, (0), 0 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 20:08:58,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 20:08:58,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 364 [2021-04-28 20:08:58,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 20:08:58,793 INFO L129 PetriNetUnfolder]: 28/118 cut-off events. [2021-04-28 20:08:58,793 INFO L130 PetriNetUnfolder]: For 35/65 co-relation queries the response was YES. [2021-04-28 20:08:58,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 118 events. 28/118 cut-off events. For 35/65 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 513 event pairs, 4 based on Foata normal form. 2/82 useless extension candidates. Maximal degree in co-relation 246. Up to 54 conditions per place. [2021-04-28 20:08:58,795 INFO L132 encePairwiseOnDemand]: 361/364 looper letters, 10 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2021-04-28 20:08:58,795 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 178 flow [2021-04-28 20:08:58,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 20:08:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 20:08:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 770 transitions. [2021-04-28 20:08:58,799 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7051282051282052 [2021-04-28 20:08:58,799 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 770 transitions. [2021-04-28 20:08:58,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 770 transitions. [2021-04-28 20:08:58,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 20:08:58,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 770 transitions. [2021-04-28 20:08:58,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 0 states have call successors, (0), 0 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 20:08:58,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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 20:08:58,808 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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 20:08:58,808 INFO L185 Difference]: Start difference. First operand has 59 places, 50 transitions, 137 flow. Second operand 3 states and 770 transitions. [2021-04-28 20:08:58,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 178 flow [2021-04-28 20:08:58,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 53 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-28 20:08:58,811 INFO L241 Difference]: Finished difference. Result has 60 places, 50 transitions, 142 flow [2021-04-28 20:08:58,812 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2021-04-28 20:08:58,812 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -78 predicate places. [2021-04-28 20:08:58,812 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:08:58,812 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 50 transitions, 142 flow [2021-04-28 20:08:58,813 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 50 transitions, 142 flow [2021-04-28 20:08:58,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 50 transitions, 142 flow [2021-04-28 20:08:58,837 INFO L129 PetriNetUnfolder]: 28/150 cut-off events. [2021-04-28 20:08:58,837 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-04-28 20:08:58,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 150 events. 28/150 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 768 event pairs, 21 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 239. Up to 54 conditions per place. [2021-04-28 20:08:58,842 INFO L146 LiptonReduction]: Number of co-enabled transitions 1372 [2021-04-28 20:08:58,847 INFO L158 LiptonReduction]: Checked pairs total: 898 [2021-04-28 20:08:58,847 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 20:08:58,848 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 36 [2021-04-28 20:08:58,851 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 142 flow [2021-04-28 20:08:58,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 253.75) internal successors, (1015), 4 states have internal predecessors, (1015), 0 states have call successors, (0), 0 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 20:08:58,853 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:08:58,853 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 20:08:58,853 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-28 20:08:58,853 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 20:08:58,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:08:58,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1892375222, now seen corresponding path program 1 times [2021-04-28 20:08:58,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:08:58,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914483472] [2021-04-28 20:08:58,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:08:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 20:08:58,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:08:58,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:08:58,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:08:58,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-28 20:08:58,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:08:58,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 20:08:58,998 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 20:08:58,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914483472] [2021-04-28 20:08:58,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 20:08:58,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-28 20:08:58,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553704395] [2021-04-28 20:08:58,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-28 20:08:58,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 20:08:59,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-28 20:08:59,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-28 20:08:59,002 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 364 [2021-04-28 20:08:59,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 269.75) internal successors, (1079), 4 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 20:08:59,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 20:08:59,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 364 [2021-04-28 20:08:59,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 20:08:59,719 INFO L129 PetriNetUnfolder]: 2755/4787 cut-off events. [2021-04-28 20:08:59,719 INFO L130 PetriNetUnfolder]: For 297/312 co-relation queries the response was YES. [2021-04-28 20:08:59,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9759 conditions, 4787 events. 2755/4787 cut-off events. For 297/312 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 39414 event pairs, 1173 based on Foata normal form. 127/1477 useless extension candidates. Maximal degree in co-relation 9746. Up to 2986 conditions per place. [2021-04-28 20:08:59,767 INFO L132 encePairwiseOnDemand]: 347/364 looper letters, 27 selfloop transitions, 26 changer transitions 0/84 dead transitions. [2021-04-28 20:08:59,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 316 flow [2021-04-28 20:08:59,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-28 20:08:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-28 20:08:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1399 transitions. [2021-04-28 20:08:59,772 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7686813186813187 [2021-04-28 20:08:59,772 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1399 transitions. [2021-04-28 20:08:59,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1399 transitions. [2021-04-28 20:08:59,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 20:08:59,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1399 transitions. [2021-04-28 20:08:59,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 279.8) internal successors, (1399), 5 states have internal predecessors, (1399), 0 states have call successors, (0), 0 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 20:08:59,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 states have internal predecessors, (2184), 0 states have call successors, (0), 0 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 20:08:59,785 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 states have internal predecessors, (2184), 0 states have call successors, (0), 0 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 20:08:59,785 INFO L185 Difference]: Start difference. First operand has 60 places, 50 transitions, 142 flow. Second operand 5 states and 1399 transitions. [2021-04-28 20:08:59,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 84 transitions, 316 flow [2021-04-28 20:08:59,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-28 20:08:59,790 INFO L241 Difference]: Finished difference. Result has 65 places, 74 transitions, 329 flow [2021-04-28 20:08:59,790 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=329, PETRI_PLACES=65, PETRI_TRANSITIONS=74} [2021-04-28 20:08:59,790 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -73 predicate places. [2021-04-28 20:08:59,791 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:08:59,791 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 74 transitions, 329 flow [2021-04-28 20:08:59,791 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 74 transitions, 329 flow [2021-04-28 20:08:59,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 74 transitions, 329 flow [2021-04-28 20:09:00,235 INFO L129 PetriNetUnfolder]: 2371/4262 cut-off events. [2021-04-28 20:09:00,235 INFO L130 PetriNetUnfolder]: For 1233/3466 co-relation queries the response was YES. [2021-04-28 20:09:00,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11958 conditions, 4262 events. 2371/4262 cut-off events. For 1233/3466 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 37288 event pairs, 1077 based on Foata normal form. 8/1307 useless extension candidates. Maximal degree in co-relation 11944. Up to 3685 conditions per place. [2021-04-28 20:09:00,324 INFO L146 LiptonReduction]: Number of co-enabled transitions 1930 [2021-04-28 20:09:00,812 INFO L158 LiptonReduction]: Checked pairs total: 1702 [2021-04-28 20:09:00,812 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 20:09:00,813 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1023 [2021-04-28 20:09:00,814 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 74 transitions, 329 flow [2021-04-28 20:09:00,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 269.75) internal successors, (1079), 4 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 20:09:00,816 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:09:00,816 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 20:09:00,816 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-28 20:09:00,816 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 20:09:00,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:09:00,817 INFO L82 PathProgramCache]: Analyzing trace with hash 522146889, now seen corresponding path program 1 times [2021-04-28 20:09:00,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:09:00,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479304540] [2021-04-28 20:09:00,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:09:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 20:09:00,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:09:00,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 20:09:00,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:09:00,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:09:00,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:09:00,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:09:00,888 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 20:09:00,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479304540] [2021-04-28 20:09:00,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 20:09:00,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-28 20:09:00,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121400128] [2021-04-28 20:09:00,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-28 20:09:00,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 20:09:00,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-28 20:09:00,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-28 20:09:00,892 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 364 [2021-04-28 20:09:00,894 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 74 transitions, 329 flow. Second operand has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 20:09:00,894 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 20:09:00,894 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 364 [2021-04-28 20:09:00,895 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 20:09:01,768 INFO L129 PetriNetUnfolder]: 4362/7656 cut-off events. [2021-04-28 20:09:01,768 INFO L130 PetriNetUnfolder]: For 3184/10132 co-relation queries the response was YES. [2021-04-28 20:09:01,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21602 conditions, 7656 events. 4362/7656 cut-off events. For 3184/10132 co-relation queries the response was YES. Maximal size of possible extension queue 1749. Compared 70121 event pairs, 2001 based on Foata normal form. 95/2258 useless extension candidates. Maximal degree in co-relation 21586. Up to 6748 conditions per place. [2021-04-28 20:09:01,845 INFO L132 encePairwiseOnDemand]: 360/364 looper letters, 3 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2021-04-28 20:09:01,845 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 347 flow [2021-04-28 20:09:01,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-28 20:09:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-28 20:09:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 975 transitions. [2021-04-28 20:09:01,849 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2021-04-28 20:09:01,850 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 975 transitions. [2021-04-28 20:09:01,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 975 transitions. [2021-04-28 20:09:01,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 20:09:01,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 975 transitions. [2021-04-28 20:09:01,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 243.75) internal successors, (975), 4 states have internal predecessors, (975), 0 states have call successors, (0), 0 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 20:09:01,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 0 states have call successors, (0), 0 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 20:09:01,858 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 0 states have call successors, (0), 0 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 20:09:01,859 INFO L185 Difference]: Start difference. First operand has 65 places, 74 transitions, 329 flow. Second operand 4 states and 975 transitions. [2021-04-28 20:09:01,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 347 flow [2021-04-28 20:09:01,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 75 transitions, 347 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-04-28 20:09:01,880 INFO L241 Difference]: Finished difference. Result has 70 places, 75 transitions, 350 flow [2021-04-28 20:09:01,880 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=350, PETRI_PLACES=70, PETRI_TRANSITIONS=75} [2021-04-28 20:09:01,881 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -68 predicate places. [2021-04-28 20:09:01,881 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:09:01,881 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 75 transitions, 350 flow [2021-04-28 20:09:01,881 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 75 transitions, 350 flow [2021-04-28 20:09:01,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 75 transitions, 350 flow [2021-04-28 20:09:02,716 INFO L129 PetriNetUnfolder]: 4502/7991 cut-off events. [2021-04-28 20:09:02,716 INFO L130 PetriNetUnfolder]: For 2498/9537 co-relation queries the response was YES. [2021-04-28 20:09:02,865 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22561 conditions, 7991 events. 4502/7991 cut-off events. For 2498/9537 co-relation queries the response was YES. Maximal size of possible extension queue 1833. Compared 77135 event pairs, 2048 based on Foata normal form. 10/2281 useless extension candidates. Maximal degree in co-relation 22544. Up to 7072 conditions per place. [2021-04-28 20:09:02,956 INFO L146 LiptonReduction]: Number of co-enabled transitions 1976 [2021-04-28 20:09:03,240 INFO L158 LiptonReduction]: Checked pairs total: 3321 [2021-04-28 20:09:03,241 INFO L160 LiptonReduction]: Total number of compositions: 1 [2021-04-28 20:09:03,241 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1360 [2021-04-28 20:09:03,244 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 76 transitions, 358 flow [2021-04-28 20:09:03,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 20:09:03,245 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:09:03,245 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 20:09:03,245 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-28 20:09:03,245 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 20:09:03,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:09:03,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1938983340, now seen corresponding path program 1 times [2021-04-28 20:09:03,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:09:03,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094703142] [2021-04-28 20:09:03,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:09:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 20:09:03,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:09:03,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:09:03,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:09:03,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:09:03,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:09:03,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-28 20:09:03,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:09:03,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 20:09:03,361 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 20:09:03,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094703142] [2021-04-28 20:09:03,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 20:09:03,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-28 20:09:03,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472854648] [2021-04-28 20:09:03,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-28 20:09:03,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 20:09:03,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-28 20:09:03,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-28 20:09:03,366 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 365 [2021-04-28 20:09:03,368 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 76 transitions, 358 flow. Second operand has 5 states, 5 states have (on average 270.8) internal successors, (1354), 5 states have internal predecessors, (1354), 0 states have call successors, (0), 0 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 20:09:03,368 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 20:09:03,368 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 365 [2021-04-28 20:09:03,368 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 20:09:04,761 INFO L129 PetriNetUnfolder]: 4741/9461 cut-off events. [2021-04-28 20:09:04,762 INFO L130 PetriNetUnfolder]: For 4660/27131 co-relation queries the response was YES. [2021-04-28 20:09:04,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35477 conditions, 9461 events. 4741/9461 cut-off events. For 4660/27131 co-relation queries the response was YES. Maximal size of possible extension queue 2349. Compared 99087 event pairs, 423 based on Foata normal form. 378/3429 useless extension candidates. Maximal degree in co-relation 35458. Up to 8140 conditions per place. [2021-04-28 20:09:04,842 INFO L132 encePairwiseOnDemand]: 348/365 looper letters, 19 selfloop transitions, 50 changer transitions 9/111 dead transitions. [2021-04-28 20:09:04,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 111 transitions, 705 flow [2021-04-28 20:09:04,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-28 20:09:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-28 20:09:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1968 transitions. [2021-04-28 20:09:04,849 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7702544031311155 [2021-04-28 20:09:04,849 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1968 transitions. [2021-04-28 20:09:04,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1968 transitions. [2021-04-28 20:09:04,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 20:09:04,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1968 transitions. [2021-04-28 20:09:04,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 281.14285714285717) internal successors, (1968), 7 states have internal predecessors, (1968), 0 states have call successors, (0), 0 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 20:09:04,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 365.0) internal successors, (2920), 8 states have internal predecessors, (2920), 0 states have call successors, (0), 0 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 20:09:04,863 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 365.0) internal successors, (2920), 8 states have internal predecessors, (2920), 0 states have call successors, (0), 0 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 20:09:04,864 INFO L185 Difference]: Start difference. First operand has 71 places, 76 transitions, 358 flow. Second operand 7 states and 1968 transitions. [2021-04-28 20:09:04,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 111 transitions, 705 flow [2021-04-28 20:09:04,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 111 transitions, 700 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-28 20:09:04,893 INFO L241 Difference]: Finished difference. Result has 79 places, 100 transitions, 678 flow [2021-04-28 20:09:04,893 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=678, PETRI_PLACES=79, PETRI_TRANSITIONS=100} [2021-04-28 20:09:04,894 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -59 predicate places. [2021-04-28 20:09:04,894 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:09:04,894 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 100 transitions, 678 flow [2021-04-28 20:09:04,894 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 100 transitions, 678 flow [2021-04-28 20:09:04,895 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 100 transitions, 678 flow [2021-04-28 20:09:05,617 INFO L129 PetriNetUnfolder]: 2890/6539 cut-off events. [2021-04-28 20:09:05,618 INFO L130 PetriNetUnfolder]: For 15496/56913 co-relation queries the response was YES. [2021-04-28 20:09:05,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27753 conditions, 6539 events. 2890/6539 cut-off events. For 15496/56913 co-relation queries the response was YES. Maximal size of possible extension queue 1815. Compared 74823 event pairs, 398 based on Foata normal form. 0/1832 useless extension candidates. Maximal degree in co-relation 27732. Up to 5551 conditions per place. [2021-04-28 20:09:05,764 INFO L146 LiptonReduction]: Number of co-enabled transitions 2558 [2021-04-28 20:09:05,919 INFO L158 LiptonReduction]: Checked pairs total: 3169 [2021-04-28 20:09:05,919 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 20:09:05,919 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1025 [2021-04-28 20:09:05,921 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 100 transitions, 678 flow [2021-04-28 20:09:05,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 270.8) internal successors, (1354), 5 states have internal predecessors, (1354), 0 states have call successors, (0), 0 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 20:09:05,922 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:09:05,922 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 20:09:05,922 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-28 20:09:05,922 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 20:09:05,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:09:05,923 INFO L82 PathProgramCache]: Analyzing trace with hash -293156704, now seen corresponding path program 1 times [2021-04-28 20:09:05,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:09:05,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902009592] [2021-04-28 20:09:05,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:09:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 20:09:06,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:09:06,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 20:09:06,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:09:06,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:09:06,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:09:06,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:09:06,105 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 20:09:06,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902009592] [2021-04-28 20:09:06,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 20:09:06,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-28 20:09:06,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031715543] [2021-04-28 20:09:06,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-28 20:09:06,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 20:09:06,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-28 20:09:06,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-28 20:09:06,111 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 365 [2021-04-28 20:09:06,113 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 100 transitions, 678 flow. Second operand has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 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 20:09:06,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 20:09:06,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 365 [2021-04-28 20:09:06,114 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 20:09:07,613 INFO L129 PetriNetUnfolder]: 5828/13139 cut-off events. [2021-04-28 20:09:07,613 INFO L130 PetriNetUnfolder]: For 28932/93004 co-relation queries the response was YES. [2021-04-28 20:09:07,704 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56066 conditions, 13139 events. 5828/13139 cut-off events. For 28932/93004 co-relation queries the response was YES. Maximal size of possible extension queue 3810. Compared 158230 event pairs, 806 based on Foata normal form. 73/3832 useless extension candidates. Maximal degree in co-relation 56043. Up to 11320 conditions per place. [2021-04-28 20:09:07,729 INFO L132 encePairwiseOnDemand]: 361/365 looper letters, 4 selfloop transitions, 4 changer transitions 7/102 dead transitions. [2021-04-28 20:09:07,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 102 transitions, 704 flow [2021-04-28 20:09:07,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-28 20:09:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-28 20:09:07,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 983 transitions. [2021-04-28 20:09:07,734 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6732876712328767 [2021-04-28 20:09:07,734 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 983 transitions. [2021-04-28 20:09:07,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 983 transitions. [2021-04-28 20:09:07,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 20:09:07,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 983 transitions. [2021-04-28 20:09:07,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 245.75) internal successors, (983), 4 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-28 20:09:07,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 0 states have call successors, (0), 0 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 20:09:07,742 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 0 states have call successors, (0), 0 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 20:09:07,742 INFO L185 Difference]: Start difference. First operand has 79 places, 100 transitions, 678 flow. Second operand 4 states and 983 transitions. [2021-04-28 20:09:07,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 102 transitions, 704 flow [2021-04-28 20:09:10,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 102 transitions, 579 flow, removed 41 selfloop flow, removed 3 redundant places. [2021-04-28 20:09:10,342 INFO L241 Difference]: Finished difference. Result has 81 places, 95 transitions, 534 flow [2021-04-28 20:09:10,342 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=534, PETRI_PLACES=81, PETRI_TRANSITIONS=95} [2021-04-28 20:09:10,342 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -57 predicate places. [2021-04-28 20:09:10,342 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:09:10,342 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 95 transitions, 534 flow [2021-04-28 20:09:10,343 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 95 transitions, 534 flow [2021-04-28 20:09:10,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 95 transitions, 534 flow [2021-04-28 20:09:11,212 INFO L129 PetriNetUnfolder]: 4504/11055 cut-off events. [2021-04-28 20:09:11,212 INFO L130 PetriNetUnfolder]: For 9530/11706 co-relation queries the response was YES. [2021-04-28 20:09:11,259 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37278 conditions, 11055 events. 4504/11055 cut-off events. For 9530/11706 co-relation queries the response was YES. Maximal size of possible extension queue 3017. Compared 142415 event pairs, 795 based on Foata normal form. 1/3471 useless extension candidates. Maximal degree in co-relation 37256. Up to 4900 conditions per place. [2021-04-28 20:09:11,387 INFO L146 LiptonReduction]: Number of co-enabled transitions 2452 [2021-04-28 20:09:13,462 INFO L158 LiptonReduction]: Checked pairs total: 5244 [2021-04-28 20:09:13,462 INFO L160 LiptonReduction]: Total number of compositions: 1 [2021-04-28 20:09:13,463 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3121 [2021-04-28 20:09:13,464 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 96 transitions, 542 flow [2021-04-28 20:09:13,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 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 20:09:13,465 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:09:13,465 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 20:09:13,465 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-28 20:09:13,465 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 20:09:13,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:09:13,465 INFO L82 PathProgramCache]: Analyzing trace with hash 379588612, now seen corresponding path program 1 times [2021-04-28 20:09:13,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:09:13,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674052031] [2021-04-28 20:09:13,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:09:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 20:09:13,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:09:13,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:09:13,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:09:13,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:09:13,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:09:13,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:09:13,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:09:13,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-28 20:09:13,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:09:13,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 20:09:13,583 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 20:09:13,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674052031] [2021-04-28 20:09:13,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 20:09:13,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-28 20:09:13,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830245564] [2021-04-28 20:09:13,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-28 20:09:13,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 20:09:13,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-28 20:09:13,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-04-28 20:09:13,588 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 366 [2021-04-28 20:09:13,590 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 96 transitions, 542 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 20:09:13,590 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 20:09:13,590 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 366 [2021-04-28 20:09:13,590 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 20:09:14,980 INFO L129 PetriNetUnfolder]: 4289/11517 cut-off events. [2021-04-28 20:09:14,980 INFO L130 PetriNetUnfolder]: For 11980/57136 co-relation queries the response was YES. [2021-04-28 20:09:15,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48017 conditions, 11517 events. 4289/11517 cut-off events. For 11980/57136 co-relation queries the response was YES. Maximal size of possible extension queue 3099. Compared 151631 event pairs, 22 based on Foata normal form. 594/4340 useless extension candidates. Maximal degree in co-relation 47993. Up to 5148 conditions per place. [2021-04-28 20:09:15,035 INFO L132 encePairwiseOnDemand]: 349/366 looper letters, 2 selfloop transitions, 28 changer transitions 59/114 dead transitions. [2021-04-28 20:09:15,036 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 114 transitions, 815 flow [2021-04-28 20:09:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-28 20:09:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-04-28 20:09:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2517 transitions. [2021-04-28 20:09:15,044 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7641165755919854 [2021-04-28 20:09:15,044 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2517 transitions. [2021-04-28 20:09:15,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2517 transitions. [2021-04-28 20:09:15,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 20:09:15,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2517 transitions. [2021-04-28 20:09:15,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 279.6666666666667) internal successors, (2517), 9 states have internal predecessors, (2517), 0 states have call successors, (0), 0 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 20:09:15,061 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 20:09:15,062 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 20:09:15,062 INFO L185 Difference]: Start difference. First operand has 82 places, 96 transitions, 542 flow. Second operand 9 states and 2517 transitions. [2021-04-28 20:09:15,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 114 transitions, 815 flow [2021-04-28 20:09:16,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 114 transitions, 798 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-04-28 20:09:16,667 INFO L241 Difference]: Finished difference. Result has 90 places, 55 transitions, 358 flow [2021-04-28 20:09:16,667 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=358, PETRI_PLACES=90, PETRI_TRANSITIONS=55} [2021-04-28 20:09:16,667 INFO L343 CegarLoopForPetriNet]: 138 programPoint places, -48 predicate places. [2021-04-28 20:09:16,667 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:09:16,668 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 55 transitions, 358 flow [2021-04-28 20:09:16,668 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 55 transitions, 358 flow [2021-04-28 20:09:16,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 55 transitions, 358 flow [2021-04-28 20:09:16,698 INFO L129 PetriNetUnfolder]: 101/305 cut-off events. [2021-04-28 20:09:16,698 INFO L130 PetriNetUnfolder]: For 767/944 co-relation queries the response was YES. [2021-04-28 20:09:16,699 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 305 events. 101/305 cut-off events. For 767/944 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 1776 event pairs, 2 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 1347. Up to 172 conditions per place. [2021-04-28 20:09:16,703 INFO L146 LiptonReduction]: Number of co-enabled transitions 730 [2021-04-28 20:09:16,953 INFO L158 LiptonReduction]: Checked pairs total: 1448 [2021-04-28 20:09:16,953 INFO L160 LiptonReduction]: Total number of compositions: 3 [2021-04-28 20:09:16,953 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 286 [2021-04-28 20:09:16,955 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 362 flow [2021-04-28 20:09:16,956 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 20:09:16,956 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:09:16,956 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 20:09:16,956 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-28 20:09:16,956 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 20:09:16,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:09:16,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1295430643, now seen corresponding path program 1 times [2021-04-28 20:09:16,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:09:16,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242205996] [2021-04-28 20:09:16,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:09:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-28 20:09:17,038 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-28 20:09:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-28 20:09:17,121 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-28 20:09:17,161 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-28 20:09:17,162 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-04-28 20:09:17,162 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-28 20:09:17,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 08:09:17 BasicIcfg [2021-04-28 20:09:17,296 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-28 20:09:17,297 INFO L168 Benchmark]: Toolchain (without parser) took 66528.42 ms. Allocated memory was 302.0 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 276.6 MB in the beginning and 1.1 GB in the end (delta: -798.4 MB). Peak memory consumption was 327.6 MB. Max. memory is 16.0 GB. [2021-04-28 20:09:17,298 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 302.0 MB. Free memory was 272.2 MB in the beginning and 272.2 MB in the end (delta: 65.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-04-28 20:09:17,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.22 ms. Allocated memory is still 302.0 MB. Free memory was 273.4 MB in the beginning and 279.3 MB in the end (delta: -5.9 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.0 GB. [2021-04-28 20:09:17,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.86 ms. Allocated memory is still 302.0 MB. Free memory was 279.3 MB in the beginning and 276.4 MB in the end (delta: 2.9 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-04-28 20:09:17,299 INFO L168 Benchmark]: Boogie Preprocessor took 43.61 ms. Allocated memory is still 302.0 MB. Free memory was 276.4 MB in the beginning and 274.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-28 20:09:17,299 INFO L168 Benchmark]: RCFGBuilder took 2361.44 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 274.3 MB in the beginning and 274.7 MB in the end (delta: -390.9 kB). Peak memory consumption was 171.6 MB. Max. memory is 16.0 GB. [2021-04-28 20:09:17,300 INFO L168 Benchmark]: TraceAbstraction took 63228.90 ms. Allocated memory was 362.8 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 274.7 MB in the beginning and 1.1 GB in the end (delta: -800.4 MB). Peak memory consumption was 262.9 MB. Max. memory is 16.0 GB. [2021-04-28 20:09:17,302 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.23 ms. Allocated memory is still 302.0 MB. Free memory was 272.2 MB in the beginning and 272.2 MB in the end (delta: 65.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 769.22 ms. Allocated memory is still 302.0 MB. Free memory was 273.4 MB in the beginning and 279.3 MB in the end (delta: -5.9 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 63.86 ms. Allocated memory is still 302.0 MB. Free memory was 279.3 MB in the beginning and 276.4 MB in the end (delta: 2.9 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 43.61 ms. Allocated memory is still 302.0 MB. Free memory was 276.4 MB in the beginning and 274.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2361.44 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 274.3 MB in the beginning and 274.7 MB in the end (delta: -390.9 kB). Peak memory consumption was 171.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 63228.90 ms. Allocated memory was 362.8 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 274.7 MB in the beginning and 1.1 GB in the end (delta: -800.4 MB). Peak memory consumption was 262.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42377.0ms, 112 PlacesBefore, 138 PlacesAfterwards, 104 TransitionsBefore, 129 TransitionsAfterwards, 2054 CoEnabledTransitionPairs, 8 FixpointIterations, 159 TrivialSequentialCompositions, 96 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 257 TotalNumberOfCompositions, 18578 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4965, positive: 4675, positive conditional: 4675, positive unconditional: 0, negative: 290, negative conditional: 290, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2365, positive: 2288, positive conditional: 0, positive unconditional: 2288, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2365, positive: 2288, positive conditional: 0, positive unconditional: 2288, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2365, positive: 2270, positive conditional: 0, positive unconditional: 2270, negative: 95, negative conditional: 0, negative unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 95, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1082, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 1005, negative conditional: 0, negative unconditional: 1005, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4965, positive: 2387, positive conditional: 2387, positive unconditional: 0, negative: 213, negative conditional: 213, negative unconditional: 0, unknown: 2365, unknown conditional: 2365, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2365, Positive cache size: 2288, Positive conditional cache size: 2288, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 148.6ms, 134 PlacesBefore, 80 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 2588 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 3220 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 385, positive: 301, positive conditional: 301, positive unconditional: 0, negative: 84, negative conditional: 84, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133, positive: 113, positive conditional: 0, positive unconditional: 113, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 133, positive: 113, positive conditional: 0, positive unconditional: 113, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 133, positive: 113, positive conditional: 0, positive unconditional: 113, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 122, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 385, positive: 188, positive conditional: 188, positive unconditional: 0, negative: 64, negative conditional: 64, negative unconditional: 0, unknown: 133, unknown conditional: 133, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2498, Positive cache size: 2401, Positive conditional cache size: 2401, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 85.4ms, 81 PlacesBefore, 57 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 1388 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 902 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 108, positive: 81, positive conditional: 81, 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: 16, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 16, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 16, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, positive: 67, positive conditional: 67, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2514, Positive cache size: 2415, Positive conditional cache size: 2415, Positive unconditional cache size: 0, Negative cache size: 99, Negative conditional cache size: 99, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 41.8ms, 59 PlacesBefore, 59 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 1380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 900 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 79, positive conditional: 79, 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: 3, positive: 3, positive conditional: 3, 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: 3, positive: 3, positive conditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, positive: 76, positive conditional: 76, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2517, Positive cache size: 2418, Positive conditional cache size: 2418, Positive unconditional cache size: 0, Negative cache size: 99, Negative conditional cache size: 99, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.9ms, 60 PlacesBefore, 60 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 1372 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 898 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 112, positive: 85, positive conditional: 85, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 112, positive: 83, positive conditional: 83, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2519, Positive cache size: 2420, Positive conditional cache size: 2420, Positive unconditional cache size: 0, Negative cache size: 99, Negative conditional cache size: 99, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1021.5ms, 65 PlacesBefore, 65 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 1930 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1702 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 276, positive: 243, positive conditional: 243, 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: 44, positive: 43, positive conditional: 20, positive unconditional: 23, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 44, positive: 43, positive conditional: 20, positive unconditional: 23, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 44, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 276, positive: 200, positive conditional: 200, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 44, unknown conditional: 44, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2563, Positive cache size: 2463, Positive conditional cache size: 2463, 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: 1359.4ms, 70 PlacesBefore, 71 PlacesAfterwards, 75 TransitionsBefore, 76 TransitionsAfterwards, 1976 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3321 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 564, positive: 502, positive conditional: 502, positive unconditional: 0, negative: 62, negative conditional: 62, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, positive: 51, positive conditional: 22, positive unconditional: 29, 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: 51, positive: 51, positive conditional: 22, positive unconditional: 29, 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: 51, positive: 51, positive conditional: 0, positive unconditional: 51, 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: 564, positive: 451, positive conditional: 451, positive unconditional: 0, negative: 62, negative conditional: 62, negative unconditional: 0, unknown: 51, unknown conditional: 51, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2614, Positive cache size: 2514, Positive conditional cache size: 2514, 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: 1024.6ms, 79 PlacesBefore, 79 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 2558 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 3169 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 452, positive: 403, positive conditional: 403, positive unconditional: 0, negative: 49, negative conditional: 49, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, positive: 42, positive conditional: 36, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, positive: 42, positive conditional: 36, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, positive: 42, positive conditional: 0, positive unconditional: 42, 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: 452, positive: 361, positive conditional: 361, positive unconditional: 0, negative: 49, negative conditional: 49, negative unconditional: 0, unknown: 42, unknown conditional: 42, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2656, Positive cache size: 2556, Positive conditional cache size: 2556, 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: 3119.6ms, 81 PlacesBefore, 82 PlacesAfterwards, 95 TransitionsBefore, 96 TransitionsAfterwards, 2452 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 5244 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 990, positive: 906, positive conditional: 906, positive unconditional: 0, negative: 84, negative conditional: 84, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, positive: 83, positive conditional: 55, positive unconditional: 28, 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: 83, positive: 83, positive conditional: 55, positive unconditional: 28, 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: 83, positive: 83, positive conditional: 0, positive unconditional: 83, 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: 990, positive: 823, positive conditional: 823, positive unconditional: 0, negative: 84, negative conditional: 84, negative unconditional: 0, unknown: 83, unknown conditional: 83, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2739, Positive cache size: 2639, Positive conditional cache size: 2639, 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: 285.2ms, 90 PlacesBefore, 68 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1448 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 458, positive: 404, positive conditional: 404, 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: 66, positive: 66, positive conditional: 33, positive unconditional: 33, 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: 66, positive: 66, positive conditional: 33, positive unconditional: 33, 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: 66, positive: 66, positive conditional: 0, positive unconditional: 66, 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: 458, positive: 338, positive conditional: 338, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 66, unknown conditional: 66, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2805, Positive cache size: 2705, Positive conditional cache size: 2705, Positive unconditional cache size: 0, Negative cache size: 100, Negative conditional cache size: 100, 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_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool b$flush_delayed; [L725] 0 int b$mem_tmp; [L726] 0 _Bool b$r_buff0_thd0; [L727] 0 _Bool b$r_buff0_thd1; [L728] 0 _Bool b$r_buff0_thd2; [L729] 0 _Bool b$r_buff0_thd3; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$read_delayed; [L735] 0 int *b$read_delayed_var; [L736] 0 int b$w_buff0; [L737] 0 _Bool b$w_buff0_used; [L738] 0 int b$w_buff1; [L739] 0 _Bool b$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 t867; [L856] FCALL, FORK 0 pthread_create(&t867, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$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 b$w_buff1 = b$w_buff0 [L754] 1 b$w_buff0 = 1 [L755] 1 b$w_buff1_used = b$w_buff0_used [L756] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L758] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L759] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L760] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L761] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$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 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t868; [L858] FCALL, FORK 0 pthread_create(&t868, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 [L788] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=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_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L859] 0 pthread_t t869; [L860] FCALL, FORK 0 pthread_create(&t869, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L811] 3 a = 1 [L814] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=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 b$flush_delayed = weak$$choice2 [L820] 3 b$mem_tmp = b [L821] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L821] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L822] EXPR 3 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L822] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0) [L822] EXPR 3 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L822] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L823] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L823] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1) [L823] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L823] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L824] EXPR 3 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L824] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used) [L824] EXPR 3 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L824] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L825] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L825] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L826] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3) [L826] EXPR 3 weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L826] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L827] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L827] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = b [L829] EXPR 3 b$flush_delayed ? b$mem_tmp : b [L829] 3 b = b$flush_delayed ? b$mem_tmp : b [L830] 3 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L833] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L833] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L833] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L833] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L834] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L834] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L835] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L835] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L836] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L836] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L837] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L837] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L768] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L794] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L794] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L795] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L795] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L796] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L796] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L797] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L797] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L798] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L798] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=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 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L866] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L866] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L866] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L867] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L867] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L868] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L868] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L869] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L869] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L870] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L870] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=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: 31.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 62936.3ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 11602.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 42543.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 89 SDtfs, 72 SDslu, 22 SDs, 0 SdLazy, 344 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 562.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 179.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=678occurred in iteration=7, InterpolantAutomatonStates: 41, 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: 52.6ms SsaConstructionTime, 517.8ms SatisfiabilityAnalysisTime, 660.0ms InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 476 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...