/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-b7b32d2 [2021-02-19 18:13:49,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-19 18:13:49,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-19 18:13:49,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-19 18:13:49,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-19 18:13:49,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-19 18:13:49,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-19 18:13:49,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-19 18:13:49,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-19 18:13:49,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-19 18:13:49,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-19 18:13:49,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-19 18:13:49,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-19 18:13:49,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-19 18:13:49,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-19 18:13:49,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-19 18:13:49,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-19 18:13:49,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-19 18:13:49,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-19 18:13:49,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-19 18:13:49,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-19 18:13:49,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-19 18:13:49,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-19 18:13:49,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-19 18:13:49,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-19 18:13:49,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-19 18:13:49,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-19 18:13:49,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-19 18:13:49,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-19 18:13:49,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-19 18:13:49,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-19 18:13:49,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-19 18:13:49,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-19 18:13:49,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-19 18:13:49,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-19 18:13:49,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-19 18:13:49,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-19 18:13:49,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-19 18:13:49,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-19 18:13:49,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-19 18:13:49,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-19 18:13:49,632 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-02-19 18:13:49,693 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-19 18:13:49,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-19 18:13:49,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-02-19 18:13:49,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-02-19 18:13:49,699 INFO L138 SettingsManager]: * Use SBE=true [2021-02-19 18:13:49,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-19 18:13:49,699 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-19 18:13:49,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-19 18:13:49,700 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-19 18:13:49,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-19 18:13:49,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-19 18:13:49,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-19 18:13:49,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-19 18:13:49,702 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-19 18:13:49,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-19 18:13:49,703 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-19 18:13:49,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-19 18:13:49,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-19 18:13:49,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-02-19 18:13:49,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-19 18:13:49,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-19 18:13:49,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-19 18:13:49,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-02-19 18:13:49,705 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-02-19 18:13:49,705 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-02-19 18:13:49,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-02-19 18:13:49,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-19 18:13:49,705 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-02-19 18:13:49,706 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-02-19 18:13:50,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-19 18:13:50,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-19 18:13:50,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-19 18:13:50,187 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-19 18:13:50,188 INFO L275 PluginConnector]: CDTParser initialized [2021-02-19 18:13:50,189 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c [2021-02-19 18:13:50,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2029425e0/0696160d6313457884716915fff934a9/FLAG45ef5484b [2021-02-19 18:13:51,050 INFO L306 CDTParser]: Found 1 translation units. [2021-02-19 18:13:51,051 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c [2021-02-19 18:13:51,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2029425e0/0696160d6313457884716915fff934a9/FLAG45ef5484b [2021-02-19 18:13:51,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2029425e0/0696160d6313457884716915fff934a9 [2021-02-19 18:13:51,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-19 18:13:51,406 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-19 18:13:51,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-19 18:13:51,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-19 18:13:51,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-19 18:13:51,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 06:13:51" (1/1) ... [2021-02-19 18:13:51,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@187c5982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 06:13:51, skipping insertion in model container [2021-02-19 18:13:51,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 06:13:51" (1/1) ... [2021-02-19 18:13:51,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-19 18:13:51,470 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-19 18:13:51,633 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c[338,351] [2021-02-19 18:13:51,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-19 18:13:51,755 INFO L203 MainTranslator]: Completed pre-run [2021-02-19 18:13:51,778 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c[338,351] [2021-02-19 18:13:51,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-19 18:13:51,891 INFO L208 MainTranslator]: Completed translation [2021-02-19 18:13:51,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 06:13:51 WrapperNode [2021-02-19 18:13:51,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-19 18:13:51,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-19 18:13:51,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-19 18:13:51,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-19 18:13:51,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 06:13:51" (1/1) ... [2021-02-19 18:13:51,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 06:13:51" (1/1) ... [2021-02-19 18:13:51,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 06:13:51" (1/1) ... [2021-02-19 18:13:51,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 06:13:51" (1/1) ... [2021-02-19 18:13:51,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 06:13:51" (1/1) ... [2021-02-19 18:13:52,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 06:13:51" (1/1) ... [2021-02-19 18:13:52,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 06:13:51" (1/1) ... [2021-02-19 18:13:52,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-19 18:13:52,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-19 18:13:52,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-19 18:13:52,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-19 18:13:52,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 06:13:51" (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-02-19 18:13:52,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-19 18:13:52,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-19 18:13:52,210 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-19 18:13:52,210 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-02-19 18:13:52,210 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2021-02-19 18:13:52,210 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-02-19 18:13:52,211 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-02-19 18:13:52,211 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2021-02-19 18:13:52,212 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2021-02-19 18:13:52,212 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2021-02-19 18:13:52,213 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-02-19 18:13:52,213 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2021-02-19 18:13:52,214 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-02-19 18:13:52,214 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-02-19 18:13:52,215 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-02-19 18:13:52,215 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-02-19 18:13:52,215 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2021-02-19 18:13:52,216 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2021-02-19 18:13:52,216 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2021-02-19 18:13:52,216 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2021-02-19 18:13:52,216 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-19 18:13:52,216 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-19 18:13:52,216 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-19 18:13:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-19 18:13:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-19 18:13:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-19 18:13:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-02-19 18:13:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2021-02-19 18:13:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-02-19 18:13:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-02-19 18:13:52,218 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2021-02-19 18:13:52,218 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2021-02-19 18:13:52,218 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2021-02-19 18:13:52,218 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-02-19 18:13:52,218 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2021-02-19 18:13:52,218 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-02-19 18:13:52,218 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-02-19 18:13:52,219 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-02-19 18:13:52,219 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-02-19 18:13:52,219 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2021-02-19 18:13:52,219 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2021-02-19 18:13:52,219 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2021-02-19 18:13:52,219 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2021-02-19 18:13:52,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-19 18:13:52,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-19 18:13:52,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-19 18:13:52,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-19 18:13:52,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-19 18:13:52,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-19 18:13:52,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-19 18:13:53,231 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-19 18:13:53,232 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-02-19 18:13:53,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 06:13:53 BoogieIcfgContainer [2021-02-19 18:13:53,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-19 18:13:53,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-19 18:13:53,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-19 18:13:53,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-19 18:13:53,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 06:13:51" (1/3) ... [2021-02-19 18:13:53,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527721b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 06:13:53, skipping insertion in model container [2021-02-19 18:13:53,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 06:13:51" (2/3) ... [2021-02-19 18:13:53,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527721b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 06:13:53, skipping insertion in model container [2021-02-19 18:13:53,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 06:13:53" (3/3) ... [2021-02-19 18:13:53,244 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2021-02-19 18:13:53,251 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-02-19 18:13:53,257 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-19 18:13:53,279 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-19 18:13:53,310 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-19 18:13:53,310 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-19 18:13:53,311 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-02-19 18:13:53,311 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-19 18:13:53,311 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-19 18:13:53,311 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-19 18:13:53,311 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-19 18:13:53,311 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-19 18:13:53,335 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2021-02-19 18:13:53,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-19 18:13:53,345 INFO L414 BasicCegarLoop]: Found error trace [2021-02-19 18:13:53,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-19 18:13:53,347 INFO L428 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-19 18:13:53,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-19 18:13:53,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1736225506, now seen corresponding path program 1 times [2021-02-19 18:13:53,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-19 18:13:53,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237630169] [2021-02-19 18:13:53,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-19 18:13:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:53,688 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:53,690 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:53,693 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:53,695 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:13:53,712 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:53,713 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:53,851 WARN L202 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-02-19 18:13:53,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-19 18:13:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:53,879 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:53,880 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:53,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-19 18:13:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:53,938 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:53,940 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-19 18:13:53,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-19 18:13:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:53,985 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:53,986 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:54,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-19 18:13:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:54,048 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:54,049 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-19 18:13:54,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-19 18:13:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:54,097 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:54,098 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:54,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-19 18:13:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:54,118 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:54,118 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:54,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-19 18:13:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:54,126 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:54,127 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:54,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-19 18:13:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:54,134 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:54,135 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:54,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-19 18:13:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:54,148 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:54,149 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:54,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-19 18:13:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:54,157 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:54,158 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-19 18:13:54,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237630169] [2021-02-19 18:13:54,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-19 18:13:54,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-19 18:13:54,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615060850] [2021-02-19 18:13:54,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-19 18:13:54,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-19 18:13:54,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-19 18:13:54,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-02-19 18:13:54,297 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 9 states. [2021-02-19 18:13:54,473 WARN L202 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-02-19 18:13:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-19 18:13:56,597 INFO L93 Difference]: Finished difference Result 364 states and 588 transitions. [2021-02-19 18:13:56,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-02-19 18:13:56,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2021-02-19 18:13:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-19 18:13:56,632 INFO L225 Difference]: With dead ends: 364 [2021-02-19 18:13:56,633 INFO L226 Difference]: Without dead ends: 233 [2021-02-19 18:13:56,646 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-02-19 18:13:56,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-02-19 18:13:56,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 122. [2021-02-19 18:13:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2021-02-19 18:13:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 156 transitions. [2021-02-19 18:13:56,811 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 156 transitions. Word has length 70 [2021-02-19 18:13:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-19 18:13:56,812 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 156 transitions. [2021-02-19 18:13:56,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-19 18:13:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 156 transitions. [2021-02-19 18:13:56,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-19 18:13:56,820 INFO L414 BasicCegarLoop]: Found error trace [2021-02-19 18:13:56,820 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-19 18:13:56,821 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-19 18:13:56,821 INFO L428 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-19 18:13:56,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-19 18:13:56,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2114841116, now seen corresponding path program 1 times [2021-02-19 18:13:56,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-19 18:13:56,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28766654] [2021-02-19 18:13:56,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-19 18:13:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:57,021 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:57,022 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:57,023 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:57,023 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:13:57,028 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:57,028 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:13:57,029 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:57,029 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:13:57,030 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:57,031 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:57,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-19 18:13:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:57,126 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:57,126 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:57,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-19 18:13:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:57,175 WARN L141 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size [2021-02-19 18:13:57,176 WARN L147 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size 7 [2021-02-19 18:13:57,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-19 18:13:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:57,201 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:57,202 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:13:57,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-19 18:13:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:57,231 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:57,232 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:57,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-19 18:13:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:57,257 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:57,258 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:13:57,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-19 18:13:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:57,278 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:57,279 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:57,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-19 18:13:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:57,283 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:57,284 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:57,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-19 18:13:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:57,288 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:57,289 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:57,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-19 18:13:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:57,295 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:57,295 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:57,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-19 18:13:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:13:57,300 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:13:57,301 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:13:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-19 18:13:57,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28766654] [2021-02-19 18:13:57,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-19 18:13:57,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-19 18:13:57,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446257033] [2021-02-19 18:13:57,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-19 18:13:57,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-19 18:13:57,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-19 18:13:57,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-02-19 18:13:57,315 INFO L87 Difference]: Start difference. First operand 122 states and 156 transitions. Second operand 10 states. [2021-02-19 18:14:00,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-19 18:14:00,739 INFO L93 Difference]: Finished difference Result 519 states and 794 transitions. [2021-02-19 18:14:00,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-02-19 18:14:00,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2021-02-19 18:14:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-19 18:14:00,755 INFO L225 Difference]: With dead ends: 519 [2021-02-19 18:14:00,755 INFO L226 Difference]: Without dead ends: 416 [2021-02-19 18:14:00,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2021-02-19 18:14:00,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-02-19 18:14:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 234. [2021-02-19 18:14:00,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-02-19 18:14:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 304 transitions. [2021-02-19 18:14:00,860 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 304 transitions. Word has length 70 [2021-02-19 18:14:00,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-19 18:14:00,860 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 304 transitions. [2021-02-19 18:14:00,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-19 18:14:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 304 transitions. [2021-02-19 18:14:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-19 18:14:00,863 INFO L414 BasicCegarLoop]: Found error trace [2021-02-19 18:14:00,863 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-19 18:14:00,863 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-19 18:14:00,864 INFO L428 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-19 18:14:00,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-19 18:14:00,864 INFO L82 PathProgramCache]: Analyzing trace with hash 581728891, now seen corresponding path program 1 times [2021-02-19 18:14:00,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-19 18:14:00,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041322969] [2021-02-19 18:14:00,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-19 18:14:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:00,908 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:00,909 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:00,910 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:00,910 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:00,914 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:00,915 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:00,919 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:00,920 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:00,923 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:00,923 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:01,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-19 18:14:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:01,055 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:01,056 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:01,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-19 18:14:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:01,088 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:01,089 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:01,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-19 18:14:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:01,108 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:01,109 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-19 18:14:01,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-19 18:14:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:01,136 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:01,137 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:01,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-19 18:14:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:01,155 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:01,156 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-02-19 18:14:01,168 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:01,169 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-19 18:14:01,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-19 18:14:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:01,189 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:01,189 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:01,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-19 18:14:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:01,193 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:01,194 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:01,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-19 18:14:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:01,198 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:01,199 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:01,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-19 18:14:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:01,212 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:01,213 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:01,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-19 18:14:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:01,219 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:01,220 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-19 18:14:01,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041322969] [2021-02-19 18:14:01,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-19 18:14:01,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-19 18:14:01,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140954177] [2021-02-19 18:14:01,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-19 18:14:01,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-19 18:14:01,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-19 18:14:01,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-02-19 18:14:01,234 INFO L87 Difference]: Start difference. First operand 234 states and 304 transitions. Second operand 10 states. [2021-02-19 18:14:02,020 WARN L202 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-02-19 18:14:05,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-19 18:14:05,129 INFO L93 Difference]: Finished difference Result 805 states and 1156 transitions. [2021-02-19 18:14:05,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-02-19 18:14:05,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2021-02-19 18:14:05,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-19 18:14:05,136 INFO L225 Difference]: With dead ends: 805 [2021-02-19 18:14:05,136 INFO L226 Difference]: Without dead ends: 598 [2021-02-19 18:14:05,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2021-02-19 18:14:05,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-02-19 18:14:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 360. [2021-02-19 18:14:05,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2021-02-19 18:14:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 473 transitions. [2021-02-19 18:14:05,240 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 473 transitions. Word has length 70 [2021-02-19 18:14:05,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-19 18:14:05,241 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 473 transitions. [2021-02-19 18:14:05,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-19 18:14:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 473 transitions. [2021-02-19 18:14:05,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-19 18:14:05,244 INFO L414 BasicCegarLoop]: Found error trace [2021-02-19 18:14:05,245 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-19 18:14:05,245 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-19 18:14:05,245 INFO L428 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-19 18:14:05,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-19 18:14:05,246 INFO L82 PathProgramCache]: Analyzing trace with hash 228640509, now seen corresponding path program 1 times [2021-02-19 18:14:05,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-19 18:14:05,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918444443] [2021-02-19 18:14:05,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-19 18:14:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:05,287 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:05,288 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:05,288 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:05,289 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:05,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-19 18:14:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:05,372 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:05,373 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:05,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-19 18:14:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:05,399 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:05,399 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:05,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-19 18:14:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:05,416 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:05,417 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:05,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-19 18:14:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:05,432 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:05,432 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:05,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-19 18:14:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:05,447 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:05,448 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:05,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-19 18:14:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:05,459 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:05,460 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:05,461 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:05,462 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:05,471 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:05,471 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:05,481 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:05,482 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:05,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-19 18:14:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:05,485 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:05,486 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:05,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-19 18:14:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:05,492 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:05,493 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:05,494 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:05,494 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:05,508 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:05,509 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:05,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-19 18:14:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:05,527 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:05,528 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:05,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-19 18:14:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:05,532 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:05,533 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-19 18:14:05,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918444443] [2021-02-19 18:14:05,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-19 18:14:05,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-19 18:14:05,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111809453] [2021-02-19 18:14:05,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-19 18:14:05,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-19 18:14:05,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-19 18:14:05,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-02-19 18:14:05,544 INFO L87 Difference]: Start difference. First operand 360 states and 473 transitions. Second operand 11 states. [2021-02-19 18:14:06,312 WARN L202 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-02-19 18:14:08,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-19 18:14:08,297 INFO L93 Difference]: Finished difference Result 884 states and 1248 transitions. [2021-02-19 18:14:08,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-02-19 18:14:08,298 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2021-02-19 18:14:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-19 18:14:08,304 INFO L225 Difference]: With dead ends: 884 [2021-02-19 18:14:08,304 INFO L226 Difference]: Without dead ends: 567 [2021-02-19 18:14:08,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-02-19 18:14:08,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-02-19 18:14:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 375. [2021-02-19 18:14:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2021-02-19 18:14:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 488 transitions. [2021-02-19 18:14:08,396 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 488 transitions. Word has length 70 [2021-02-19 18:14:08,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-19 18:14:08,398 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 488 transitions. [2021-02-19 18:14:08,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-19 18:14:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 488 transitions. [2021-02-19 18:14:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-19 18:14:08,404 INFO L414 BasicCegarLoop]: Found error trace [2021-02-19 18:14:08,404 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-19 18:14:08,404 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-19 18:14:08,404 INFO L428 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-19 18:14:08,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-19 18:14:08,408 INFO L82 PathProgramCache]: Analyzing trace with hash 88091899, now seen corresponding path program 1 times [2021-02-19 18:14:08,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-19 18:14:08,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221596775] [2021-02-19 18:14:08,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-19 18:14:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:08,496 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:08,498 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:08,499 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:08,500 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:08,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-19 18:14:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:08,590 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:08,591 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:08,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-19 18:14:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:08,616 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:08,616 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:08,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-19 18:14:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:08,632 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:08,633 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:08,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-19 18:14:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:08,647 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:08,647 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:08,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-19 18:14:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:08,662 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:08,663 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:08,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-19 18:14:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:08,676 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:08,677 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:08,678 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:08,679 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-19 18:14:08,690 WARN L141 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-02-19 18:14:08,691 WARN L147 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size 9 [2021-02-19 18:14:08,705 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:08,706 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:08,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-19 18:14:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:08,715 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:08,716 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:08,717 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:08,719 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-19 18:14:08,732 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:08,733 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-19 18:14:08,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-19 18:14:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:08,754 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:08,755 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:08,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-19 18:14:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:08,761 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:08,762 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:08,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-19 18:14:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:08,766 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:08,769 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-19 18:14:08,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221596775] [2021-02-19 18:14:08,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-19 18:14:08,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-19 18:14:08,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810935891] [2021-02-19 18:14:08,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-19 18:14:08,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-19 18:14:08,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-19 18:14:08,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-02-19 18:14:08,782 INFO L87 Difference]: Start difference. First operand 375 states and 488 transitions. Second operand 11 states. [2021-02-19 18:14:09,410 WARN L202 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-02-19 18:14:11,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-19 18:14:11,340 INFO L93 Difference]: Finished difference Result 890 states and 1237 transitions. [2021-02-19 18:14:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-19 18:14:11,341 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2021-02-19 18:14:11,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-19 18:14:11,347 INFO L225 Difference]: With dead ends: 890 [2021-02-19 18:14:11,347 INFO L226 Difference]: Without dead ends: 558 [2021-02-19 18:14:11,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-02-19 18:14:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-02-19 18:14:11,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2021-02-19 18:14:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2021-02-19 18:14:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 491 transitions. [2021-02-19 18:14:11,415 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 491 transitions. Word has length 70 [2021-02-19 18:14:11,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-19 18:14:11,416 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 491 transitions. [2021-02-19 18:14:11,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-19 18:14:11,416 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 491 transitions. [2021-02-19 18:14:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-19 18:14:11,417 INFO L414 BasicCegarLoop]: Found error trace [2021-02-19 18:14:11,418 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-19 18:14:11,418 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-19 18:14:11,418 INFO L428 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-19 18:14:11,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-19 18:14:11,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2139075897, now seen corresponding path program 1 times [2021-02-19 18:14:11,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-19 18:14:11,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739101963] [2021-02-19 18:14:11,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-19 18:14:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:11,452 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,453 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:11,456 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,456 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:11,457 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,457 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:11,462 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,463 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:11,467 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,467 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-19 18:14:11,473 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,476 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:11,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-19 18:14:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:11,568 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,569 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:11,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-19 18:14:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:11,599 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,599 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:11,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-19 18:14:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:11,630 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,631 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-19 18:14:11,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-19 18:14:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:11,665 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,665 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:11,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-19 18:14:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:11,690 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,691 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:11,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-19 18:14:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:11,720 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,722 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:11,723 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,724 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-19 18:14:11,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-19 18:14:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:11,739 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,739 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:11,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-19 18:14:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:11,747 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,748 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:11,752 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,752 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-19 18:14:11,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-19 18:14:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:11,757 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,760 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:11,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-19 18:14:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:11,766 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:11,767 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-19 18:14:11,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739101963] [2021-02-19 18:14:11,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-19 18:14:11,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-02-19 18:14:11,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985773963] [2021-02-19 18:14:11,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-02-19 18:14:11,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-19 18:14:11,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-02-19 18:14:11,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-02-19 18:14:11,781 INFO L87 Difference]: Start difference. First operand 380 states and 491 transitions. Second operand 13 states. [2021-02-19 18:14:12,008 WARN L202 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2021-02-19 18:14:13,251 WARN L202 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2021-02-19 18:14:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-19 18:14:19,881 INFO L93 Difference]: Finished difference Result 2301 states and 3260 transitions. [2021-02-19 18:14:19,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-02-19 18:14:19,882 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2021-02-19 18:14:19,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-19 18:14:19,917 INFO L225 Difference]: With dead ends: 2301 [2021-02-19 18:14:19,917 INFO L226 Difference]: Without dead ends: 1935 [2021-02-19 18:14:19,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=505, Invalid=2687, Unknown=0, NotChecked=0, Total=3192 [2021-02-19 18:14:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2021-02-19 18:14:20,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1616. [2021-02-19 18:14:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2021-02-19 18:14:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2137 transitions. [2021-02-19 18:14:20,202 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2137 transitions. Word has length 70 [2021-02-19 18:14:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-19 18:14:20,203 INFO L480 AbstractCegarLoop]: Abstraction has 1616 states and 2137 transitions. [2021-02-19 18:14:20,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-02-19 18:14:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2137 transitions. [2021-02-19 18:14:20,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-19 18:14:20,208 INFO L414 BasicCegarLoop]: Found error trace [2021-02-19 18:14:20,209 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-19 18:14:20,209 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-19 18:14:20,209 INFO L428 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-19 18:14:20,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-19 18:14:20,210 INFO L82 PathProgramCache]: Analyzing trace with hash 508153532, now seen corresponding path program 1 times [2021-02-19 18:14:20,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-19 18:14:20,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792267854] [2021-02-19 18:14:20,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-19 18:14:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:20,255 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:20,255 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:20,256 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:20,257 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:20,260 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:20,261 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:20,261 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:20,262 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:20,263 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:20,263 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:20,264 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:20,265 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:20,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-19 18:14:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:20,352 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:20,353 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:20,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-19 18:14:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:20,381 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:20,382 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-19 18:14:20,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-19 18:14:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:20,401 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:20,402 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-19 18:14:20,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-19 18:14:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:20,429 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:20,430 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:20,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-19 18:14:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:20,443 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:20,444 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-19 18:14:20,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-19 18:14:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:20,451 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:20,452 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:20,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-19 18:14:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:20,457 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:20,458 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:20,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-19 18:14:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:20,461 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:20,461 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:20,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-19 18:14:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:20,476 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:20,477 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-02-19 18:14:20,488 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:20,489 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-19 18:14:20,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-19 18:14:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-19 18:14:20,503 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-19 18:14:20,504 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-19 18:14:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-19 18:14:20,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792267854] [2021-02-19 18:14:20,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-19 18:14:20,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-19 18:14:20,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139334402] [2021-02-19 18:14:20,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-19 18:14:20,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-19 18:14:20,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-19 18:14:20,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-02-19 18:14:20,517 INFO L87 Difference]: Start difference. First operand 1616 states and 2137 transitions. Second operand 10 states. [2021-02-19 18:14:20,943 WARN L202 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-02-19 18:14:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-19 18:14:24,124 INFO L93 Difference]: Finished difference Result 3486 states and 4678 transitions. [2021-02-19 18:14:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-02-19 18:14:24,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2021-02-19 18:14:24,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-19 18:14:24,140 INFO L225 Difference]: With dead ends: 3486 [2021-02-19 18:14:24,141 INFO L226 Difference]: Without dead ends: 2141 [2021-02-19 18:14:24,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2021-02-19 18:14:24,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2021-02-19 18:14:24,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1623. [2021-02-19 18:14:24,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2021-02-19 18:14:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2135 transitions. [2021-02-19 18:14:24,470 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2135 transitions. Word has length 70 [2021-02-19 18:14:24,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-19 18:14:24,473 INFO L480 AbstractCegarLoop]: Abstraction has 1623 states and 2135 transitions. [2021-02-19 18:14:24,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-19 18:14:24,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2135 transitions. [2021-02-19 18:14:24,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-19 18:14:24,474 INFO L414 BasicCegarLoop]: Found error trace [2021-02-19 18:14:24,474 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-19 18:14:24,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-19 18:14:24,475 INFO L428 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-19 18:14:24,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-19 18:14:24,478 INFO L82 PathProgramCache]: Analyzing trace with hash -309494918, now seen corresponding path program 1 times [2021-02-19 18:14:24,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-19 18:14:24,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144871431] [2021-02-19 18:14:24,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-19 18:14:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-02-19 18:14:24,512 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-02-19 18:14:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-02-19 18:14:24,537 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-02-19 18:14:24,618 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-02-19 18:14:24,618 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-02-19 18:14:24,618 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-19 18:14:24,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.02 06:14:24 BoogieIcfgContainer [2021-02-19 18:14:24,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-19 18:14:24,782 INFO L168 Benchmark]: Toolchain (without parser) took 33384.96 ms. Allocated memory was 153.1 MB in the beginning and 385.9 MB in the end (delta: 232.8 MB). Free memory was 110.5 MB in the beginning and 332.5 MB in the end (delta: -222.0 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-02-19 18:14:24,783 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 153.1 MB. Free memory was 127.0 MB in the beginning and 127.0 MB in the end (delta: 78.3 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-02-19 18:14:24,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 484.47 ms. Allocated memory is still 153.1 MB. Free memory was 109.5 MB in the beginning and 124.8 MB in the end (delta: -15.3 MB). Peak memory consumption was 4.9 MB. Max. memory is 8.0 GB. [2021-02-19 18:14:24,784 INFO L168 Benchmark]: Boogie Preprocessor took 134.35 ms. Allocated memory is still 153.1 MB. Free memory was 124.8 MB in the beginning and 122.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-02-19 18:14:24,787 INFO L168 Benchmark]: RCFGBuilder took 1203.66 ms. Allocated memory is still 153.1 MB. Free memory was 122.7 MB in the beginning and 105.8 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2021-02-19 18:14:24,788 INFO L168 Benchmark]: TraceAbstraction took 31545.30 ms. Allocated memory was 153.1 MB in the beginning and 385.9 MB in the end (delta: 232.8 MB). Free memory was 105.3 MB in the beginning and 332.5 MB in the end (delta: -227.2 MB). Peak memory consumption was 6.0 MB. Max. memory is 8.0 GB. [2021-02-19 18:14:24,790 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.26 ms. Allocated memory is still 153.1 MB. Free memory was 127.0 MB in the beginning and 127.0 MB in the end (delta: 78.3 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 484.47 ms. Allocated memory is still 153.1 MB. Free memory was 109.5 MB in the beginning and 124.8 MB in the end (delta: -15.3 MB). Peak memory consumption was 4.9 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 134.35 ms. Allocated memory is still 153.1 MB. Free memory was 124.8 MB in the beginning and 122.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1203.66 ms. Allocated memory is still 153.1 MB. Free memory was 122.7 MB in the beginning and 105.8 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 31545.30 ms. Allocated memory was 153.1 MB in the beginning and 385.9 MB in the end (delta: 232.8 MB). Free memory was 105.3 MB in the beginning and 332.5 MB in the end (delta: -227.2 MB). Peak memory consumption was 6.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int q_buf_0 ; [L18] int q_free ; [L19] int q_read_ev ; [L20] int q_write_ev ; [L21] int q_req_up ; [L22] int q_ev ; [L43] int p_num_write ; [L44] int p_last_write ; [L45] int p_dw_st ; [L46] int p_dw_pc ; [L47] int p_dw_i ; [L48] int c_num_read ; [L49] int c_last_read ; [L50] int c_dr_st ; [L51] int c_dr_pc ; [L52] int c_dr_i ; [L156] static int a_t ; VAL [\old(a_t)=69, \old(c_dr_i)=49, \old(c_dr_pc)=58, \old(c_dr_st)=60, \old(c_last_read)=65, \old(c_num_read)=66, \old(p_dw_i)=63, \old(p_dw_pc)=59, \old(p_dw_st)=52, \old(p_last_write)=73, \old(p_num_write)=51, \old(q_buf_0)=54, \old(q_ev)=72, \old(q_free)=61, \old(q_read_ev)=71, \old(q_req_up)=57, \old(q_write_ev)=67, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0] [L458] int __retres1 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=0, \old(q_read_ev)=0, \old(q_req_up)=0, \old(q_write_ev)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0] [L462] CALL init_model() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=0, \old(q_read_ev)=0, \old(q_req_up)=0, \old(q_write_ev)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0] [L444] q_free = 1 [L445] q_write_ev = 2 [L446] q_read_ev = q_write_ev [L447] p_num_write = 0 [L448] p_dw_pc = 0 [L449] p_dw_i = 1 [L450] c_num_read = 0 [L451] c_dr_pc = 0 [L452] c_dr_i = 1 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=0, \old(q_read_ev)=0, \old(q_req_up)=0, \old(q_write_ev)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L462] RET init_model() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=0, \old(q_read_ev)=0, \old(q_req_up)=0, \old(q_write_ev)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L463] CALL start_simulation() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L398] int kernel_st ; [L399] int tmp ; [L403] kernel_st = 0 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L404] CALL update_channels() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L214] COND FALSE !((int )q_req_up == 1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L404] RET update_channels() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L405] CALL init_threads() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L229] COND TRUE (int )p_dw_i == 1 [L230] p_dw_st = 0 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L234] COND TRUE (int )c_dr_i == 1 [L235] c_dr_st = 0 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L405] RET init_threads() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L406] CALL fire_delta_events() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L267] COND FALSE !((int )q_read_ev == 0) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L272] COND FALSE !((int )q_write_ev == 0) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L406] RET fire_delta_events() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L407] CALL activate_threads() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L300] int tmp ; [L301] int tmp___0 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L305] CALL, EXPR is_do_write_p_triggered() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L54] int __retres1 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L57] COND FALSE !((int )p_dw_pc == 1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L67] __retres1 = 0 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L69] return (__retres1); VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L305] RET, EXPR is_do_write_p_triggered() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, is_do_write_p_triggered()=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L305] tmp = is_do_write_p_triggered() [L307] COND FALSE !(\read(tmp)) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0] [L313] CALL, EXPR is_do_read_c_triggered() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L73] int __retres1 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L76] COND FALSE !((int )c_dr_pc == 1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L86] __retres1 = 0 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L88] return (__retres1); VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L313] RET, EXPR is_do_read_c_triggered() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, is_do_read_c_triggered()=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0] [L313] tmp___0 = is_do_read_c_triggered() [L315] COND FALSE !(\read(tmp___0)) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0, tmp___0=0] [L407] RET activate_threads() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L408] CALL reset_delta_events() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L285] COND FALSE !((int )q_read_ev == 1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L290] COND FALSE !((int )q_write_ev == 1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L408] RET reset_delta_events() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L411] COND TRUE 1 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L414] kernel_st = 1 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=1, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L415] CALL eval() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L325] int tmp ; [L326] int tmp___0 ; [L327] int tmp___1 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L331] COND TRUE 1 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L334] CALL, EXPR exists_runnable_thread() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L244] int __retres1 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L247] COND TRUE (int )p_dw_st == 0 [L248] __retres1 = 1 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L260] return (__retres1); VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, \result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L334] RET, EXPR exists_runnable_thread() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, exists_runnable_thread()=1, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L334] tmp___1 = exists_runnable_thread() [L336] COND TRUE \read(tmp___1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp___1=1] [L341] COND TRUE (int )p_dw_st == 0 [L343] tmp = __VERIFIER_nondet_int() [L345] COND FALSE !(\read(tmp)) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0, tmp___1=1] [L351] CALL error() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L12] reach_error() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 31.3s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1128 SDtfs, 4454 SDslu, 1207 SDs, 0 SdLazy, 11183 SolverSat, 2895 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 347 GetRequests, 160 SyntacticMatches, 5 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1623occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 1738 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 560 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 483 ConstructedInterpolants, 0 QuantifiedInterpolants, 119301 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...