/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-21 16:40:55,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-21 16:40:55,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-21 16:40:55,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-21 16:40:55,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-21 16:40:55,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-21 16:40:55,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-21 16:40:55,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-21 16:40:55,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-21 16:40:55,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-21 16:40:55,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-21 16:40:55,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-21 16:40:55,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-21 16:40:55,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-21 16:40:55,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-21 16:40:55,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-21 16:40:55,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-21 16:40:55,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-21 16:40:55,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-21 16:40:55,242 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-21 16:40:55,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-21 16:40:55,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-21 16:40:55,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-21 16:40:55,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-21 16:40:55,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-21 16:40:55,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-21 16:40:55,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-21 16:40:55,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-21 16:40:55,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-21 16:40:55,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-21 16:40:55,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-21 16:40:55,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-21 16:40:55,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-21 16:40:55,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-21 16:40:55,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-21 16:40:55,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-21 16:40:55,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-21 16:40:55,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-21 16:40:55,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-21 16:40:55,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-21 16:40:55,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-21 16:40:55,287 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-21 16:40:55,351 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-21 16:40:55,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-21 16:40:55,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-02-21 16:40:55,353 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-02-21 16:40:55,354 INFO L138 SettingsManager]: * Use SBE=true [2021-02-21 16:40:55,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-21 16:40:55,354 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-21 16:40:55,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-21 16:40:55,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-21 16:40:55,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-21 16:40:55,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-21 16:40:55,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-21 16:40:55,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-21 16:40:55,356 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-21 16:40:55,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-21 16:40:55,356 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-21 16:40:55,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-21 16:40:55,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-21 16:40:55,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-02-21 16:40:55,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-21 16:40:55,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-21 16:40:55,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-21 16:40:55,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-02-21 16:40:55,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-02-21 16:40:55,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-02-21 16:40:55,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-02-21 16:40:55,359 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-21 16:40:55,359 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-02-21 16:40:55,359 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-21 16:40:55,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-21 16:40:55,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-21 16:40:55,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-21 16:40:55,900 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-21 16:40:55,901 INFO L275 PluginConnector]: CDTParser initialized [2021-02-21 16:40:55,902 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-21 16:40:56,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dca54aa5/ab343dcf63214517aa050f54b3bebb54/FLAG786b4b086 [2021-02-21 16:40:56,653 INFO L306 CDTParser]: Found 1 translation units. [2021-02-21 16:40:56,654 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c [2021-02-21 16:40:56,673 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dca54aa5/ab343dcf63214517aa050f54b3bebb54/FLAG786b4b086 [2021-02-21 16:40:57,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dca54aa5/ab343dcf63214517aa050f54b3bebb54 [2021-02-21 16:40:57,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-21 16:40:57,055 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-21 16:40:57,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-21 16:40:57,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-21 16:40:57,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-21 16:40:57,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:40:57" (1/1) ... [2021-02-21 16:40:57,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@106b1043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:40:57, skipping insertion in model container [2021-02-21 16:40:57,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:40:57" (1/1) ... [2021-02-21 16:40:57,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-21 16:40:57,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-21 16:40:57,370 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-21 16:40:57,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 16:40:57,482 INFO L203 MainTranslator]: Completed pre-run [2021-02-21 16:40:57,495 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-21 16:40:57,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 16:40:57,549 INFO L208 MainTranslator]: Completed translation [2021-02-21 16:40:57,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:40:57 WrapperNode [2021-02-21 16:40:57,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-21 16:40:57,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-21 16:40:57,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-21 16:40:57,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-21 16:40:57,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:40:57" (1/1) ... [2021-02-21 16:40:57,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:40:57" (1/1) ... [2021-02-21 16:40:57,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:40:57" (1/1) ... [2021-02-21 16:40:57,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:40:57" (1/1) ... [2021-02-21 16:40:57,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:40:57" (1/1) ... [2021-02-21 16:40:57,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:40:57" (1/1) ... [2021-02-21 16:40:57,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:40:57" (1/1) ... [2021-02-21 16:40:57,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-21 16:40:57,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-21 16:40:57,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-21 16:40:57,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-21 16:40:57,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:40:57" (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-21 16:40:57,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-21 16:40:57,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-21 16:40:57,756 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-21 16:40:57,756 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-02-21 16:40:57,757 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2021-02-21 16:40:57,757 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-02-21 16:40:57,757 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-02-21 16:40:57,758 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2021-02-21 16:40:57,758 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2021-02-21 16:40:57,759 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2021-02-21 16:40:57,759 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-02-21 16:40:57,759 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2021-02-21 16:40:57,760 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-02-21 16:40:57,760 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-02-21 16:40:57,764 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-02-21 16:40:57,764 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-02-21 16:40:57,765 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2021-02-21 16:40:57,765 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2021-02-21 16:40:57,765 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2021-02-21 16:40:57,765 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2021-02-21 16:40:57,765 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-21 16:40:57,766 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-21 16:40:57,766 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-21 16:40:57,766 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-21 16:40:57,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-21 16:40:57,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-21 16:40:57,767 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-02-21 16:40:57,767 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2021-02-21 16:40:57,767 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-02-21 16:40:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-02-21 16:40:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2021-02-21 16:40:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2021-02-21 16:40:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2021-02-21 16:40:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-02-21 16:40:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2021-02-21 16:40:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-02-21 16:40:57,769 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-02-21 16:40:57,769 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-02-21 16:40:57,769 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-02-21 16:40:57,769 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2021-02-21 16:40:57,769 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2021-02-21 16:40:57,769 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2021-02-21 16:40:57,769 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2021-02-21 16:40:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-21 16:40:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-21 16:40:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-21 16:40:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-21 16:40:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-21 16:40:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-21 16:40:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-21 16:40:58,412 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-21 16:40:58,414 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-02-21 16:40:58,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:40:58 BoogieIcfgContainer [2021-02-21 16:40:58,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-21 16:40:58,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-21 16:40:58,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-21 16:40:58,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-21 16:40:58,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 04:40:57" (1/3) ... [2021-02-21 16:40:58,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d1afa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 04:40:58, skipping insertion in model container [2021-02-21 16:40:58,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:40:57" (2/3) ... [2021-02-21 16:40:58,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d1afa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 04:40:58, skipping insertion in model container [2021-02-21 16:40:58,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:40:58" (3/3) ... [2021-02-21 16:40:58,432 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2021-02-21 16:40:58,441 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-02-21 16:40:58,448 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-21 16:40:58,471 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-21 16:40:58,505 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-21 16:40:58,506 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-21 16:40:58,506 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-02-21 16:40:58,506 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-21 16:40:58,506 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-21 16:40:58,506 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-21 16:40:58,506 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-21 16:40:58,507 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-21 16:40:58,531 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2021-02-21 16:40:58,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-21 16:40:58,541 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 16:40:58,542 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-21 16:40:58,543 INFO L428 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 16:40:58,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 16:40:58,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1736225506, now seen corresponding path program 1 times [2021-02-21 16:40:58,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-21 16:40:58,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284033827] [2021-02-21 16:40:58,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 16:40:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:40:58,949 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:40:58,951 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:40:58,953 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:40:58,958 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:40:58,973 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:40:58,975 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:40:59,098 WARN L202 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-02-21 16:40:59,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 16:40:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:40:59,166 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:40:59,167 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:40:59,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-21 16:40:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:40:59,239 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:40:59,241 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 16:40:59,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-21 16:40:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:40:59,282 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:40:59,282 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:40:59,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-21 16:40:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:40:59,312 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:40:59,313 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 16:40:59,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-21 16:40:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:40:59,347 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:40:59,348 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:40:59,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-21 16:40:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:40:59,362 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:40:59,363 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:40:59,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 16:40:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:40:59,369 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:40:59,370 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:40:59,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-21 16:40:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:40:59,376 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:40:59,377 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:40:59,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-21 16:40:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:40:59,386 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:40:59,387 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:40:59,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-21 16:40:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:40:59,393 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:40:59,394 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:40:59,415 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-21 16:40:59,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284033827] [2021-02-21 16:40:59,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 16:40:59,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-21 16:40:59,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601580595] [2021-02-21 16:40:59,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-21 16:40:59,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-21 16:40:59,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-21 16:40:59,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-02-21 16:40:59,444 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 9 states. [2021-02-21 16:41:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 16:41:01,350 INFO L93 Difference]: Finished difference Result 364 states and 588 transitions. [2021-02-21 16:41:01,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-02-21 16:41:01,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2021-02-21 16:41:01,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 16:41:01,370 INFO L225 Difference]: With dead ends: 364 [2021-02-21 16:41:01,370 INFO L226 Difference]: Without dead ends: 233 [2021-02-21 16:41:01,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-02-21 16:41:01,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-02-21 16:41:01,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 122. [2021-02-21 16:41:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2021-02-21 16:41:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 156 transitions. [2021-02-21 16:41:01,525 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 156 transitions. Word has length 70 [2021-02-21 16:41:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 16:41:01,525 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 156 transitions. [2021-02-21 16:41:01,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-21 16:41:01,526 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 156 transitions. [2021-02-21 16:41:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-21 16:41:01,530 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 16:41:01,531 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-21 16:41:01,532 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-21 16:41:01,533 INFO L428 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 16:41:01,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 16:41:01,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2114841116, now seen corresponding path program 1 times [2021-02-21 16:41:01,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-21 16:41:01,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931458096] [2021-02-21 16:41:01,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 16:41:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:01,645 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:01,646 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:01,647 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:01,647 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:01,652 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:01,652 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:01,653 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:01,654 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:01,654 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:01,655 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:01,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 16:41:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:01,774 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:01,775 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:01,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-21 16:41:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:01,824 WARN L141 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size [2021-02-21 16:41:01,826 WARN L147 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size 7 [2021-02-21 16:41:01,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-21 16:41:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:01,849 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:01,850 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:01,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-21 16:41:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:01,877 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:01,878 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:01,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-21 16:41:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:01,912 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:01,912 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:01,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-21 16:41:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:01,960 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:01,962 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:01,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 16:41:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:01,972 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:01,973 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:01,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-21 16:41:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:01,979 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:01,980 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:01,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-21 16:41:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:01,987 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:01,988 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:01,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-21 16:41:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:02,000 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:02,000 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:02,013 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-21 16:41:02,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931458096] [2021-02-21 16:41:02,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 16:41:02,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-21 16:41:02,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246114702] [2021-02-21 16:41:02,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-21 16:41:02,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-21 16:41:02,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-21 16:41:02,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-02-21 16:41:02,025 INFO L87 Difference]: Start difference. First operand 122 states and 156 transitions. Second operand 10 states. [2021-02-21 16:41:05,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 16:41:05,548 INFO L93 Difference]: Finished difference Result 519 states and 794 transitions. [2021-02-21 16:41:05,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-02-21 16:41:05,549 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2021-02-21 16:41:05,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 16:41:05,565 INFO L225 Difference]: With dead ends: 519 [2021-02-21 16:41:05,565 INFO L226 Difference]: Without dead ends: 416 [2021-02-21 16:41:05,568 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-21 16:41:05,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-02-21 16:41:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 234. [2021-02-21 16:41:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-02-21 16:41:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 304 transitions. [2021-02-21 16:41:05,650 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 304 transitions. Word has length 70 [2021-02-21 16:41:05,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 16:41:05,651 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 304 transitions. [2021-02-21 16:41:05,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-21 16:41:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 304 transitions. [2021-02-21 16:41:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-21 16:41:05,654 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 16:41:05,655 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-21 16:41:05,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-21 16:41:05,655 INFO L428 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 16:41:05,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 16:41:05,656 INFO L82 PathProgramCache]: Analyzing trace with hash 581728891, now seen corresponding path program 1 times [2021-02-21 16:41:05,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-21 16:41:05,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520406088] [2021-02-21 16:41:05,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 16:41:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:05,762 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:05,763 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:05,767 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:05,767 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:05,773 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:05,773 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:05,774 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:05,775 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:05,779 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:05,780 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:05,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 16:41:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:05,867 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:05,867 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:05,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-21 16:41:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:05,896 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:05,896 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:05,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-21 16:41:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:05,915 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:05,916 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 16:41:05,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-21 16:41:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:05,943 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:05,944 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:05,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-21 16:41:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:05,959 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:05,959 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-02-21 16:41:05,971 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:05,972 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 16:41:05,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-21 16:41:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:05,990 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:05,990 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:05,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 16:41:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:05,994 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:05,995 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:05,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-21 16:41:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:05,999 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:05,999 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:06,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-21 16:41:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:06,011 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:06,012 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:06,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-21 16:41:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:06,016 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:06,017 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:06,027 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-21 16:41:06,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520406088] [2021-02-21 16:41:06,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 16:41:06,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-21 16:41:06,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426960849] [2021-02-21 16:41:06,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-21 16:41:06,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-21 16:41:06,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-21 16:41:06,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-02-21 16:41:06,030 INFO L87 Difference]: Start difference. First operand 234 states and 304 transitions. Second operand 10 states. [2021-02-21 16:41:06,551 WARN L202 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-02-21 16:41:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 16:41:09,733 INFO L93 Difference]: Finished difference Result 805 states and 1156 transitions. [2021-02-21 16:41:09,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-02-21 16:41:09,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2021-02-21 16:41:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 16:41:09,741 INFO L225 Difference]: With dead ends: 805 [2021-02-21 16:41:09,742 INFO L226 Difference]: Without dead ends: 598 [2021-02-21 16:41:09,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2021-02-21 16:41:09,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-02-21 16:41:09,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 360. [2021-02-21 16:41:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2021-02-21 16:41:09,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 473 transitions. [2021-02-21 16:41:09,831 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 473 transitions. Word has length 70 [2021-02-21 16:41:09,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 16:41:09,831 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 473 transitions. [2021-02-21 16:41:09,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-21 16:41:09,832 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 473 transitions. [2021-02-21 16:41:09,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-21 16:41:09,835 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 16:41:09,836 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-21 16:41:09,836 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-21 16:41:09,836 INFO L428 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 16:41:09,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 16:41:09,837 INFO L82 PathProgramCache]: Analyzing trace with hash 228640509, now seen corresponding path program 1 times [2021-02-21 16:41:09,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-21 16:41:09,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124389268] [2021-02-21 16:41:09,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 16:41:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:09,877 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:09,878 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:09,878 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:09,879 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:09,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 16:41:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:09,960 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:09,961 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:09,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-21 16:41:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:09,986 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:09,987 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:09,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-21 16:41:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:10,004 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:10,005 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:10,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-21 16:41:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:10,024 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:10,025 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:10,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-21 16:41:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:10,043 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:10,044 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:10,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-21 16:41:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:10,077 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:10,077 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:10,081 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:10,082 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:10,090 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:10,090 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:10,099 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:10,100 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:10,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 16:41:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:10,107 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:10,108 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:10,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-21 16:41:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:10,126 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:10,128 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:10,129 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:10,129 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:10,139 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:10,144 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:10,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-21 16:41:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:10,173 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:10,183 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:10,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-21 16:41:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:10,188 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:10,190 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:10,203 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-21 16:41:10,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124389268] [2021-02-21 16:41:10,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 16:41:10,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-21 16:41:10,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827472258] [2021-02-21 16:41:10,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-21 16:41:10,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-21 16:41:10,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-21 16:41:10,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-02-21 16:41:10,209 INFO L87 Difference]: Start difference. First operand 360 states and 473 transitions. Second operand 11 states. [2021-02-21 16:41:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 16:41:12,832 INFO L93 Difference]: Finished difference Result 884 states and 1248 transitions. [2021-02-21 16:41:12,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-02-21 16:41:12,833 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2021-02-21 16:41:12,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 16:41:12,839 INFO L225 Difference]: With dead ends: 884 [2021-02-21 16:41:12,839 INFO L226 Difference]: Without dead ends: 567 [2021-02-21 16:41:12,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-02-21 16:41:12,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-02-21 16:41:12,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 375. [2021-02-21 16:41:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2021-02-21 16:41:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 488 transitions. [2021-02-21 16:41:12,917 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 488 transitions. Word has length 70 [2021-02-21 16:41:12,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 16:41:12,917 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 488 transitions. [2021-02-21 16:41:12,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-21 16:41:12,917 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 488 transitions. [2021-02-21 16:41:12,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-21 16:41:12,920 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 16:41:12,920 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-21 16:41:12,920 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-21 16:41:12,921 INFO L428 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 16:41:12,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 16:41:12,921 INFO L82 PathProgramCache]: Analyzing trace with hash 88091899, now seen corresponding path program 1 times [2021-02-21 16:41:12,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-21 16:41:12,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472442090] [2021-02-21 16:41:12,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 16:41:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:12,961 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:12,962 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:12,963 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:12,963 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:13,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 16:41:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:13,046 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:13,047 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:13,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-21 16:41:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:13,071 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:13,072 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:13,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-21 16:41:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:13,087 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:13,088 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:13,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-21 16:41:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:13,101 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:13,102 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:13,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-21 16:41:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:13,117 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:13,118 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:13,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-21 16:41:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:13,131 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:13,131 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:13,132 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:13,133 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 16:41:13,146 WARN L141 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-02-21 16:41:13,147 WARN L147 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size 9 [2021-02-21 16:41:13,159 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:13,159 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:13,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 16:41:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:13,168 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:13,169 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:13,170 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:13,171 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 16:41:13,184 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:13,185 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 16:41:13,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-21 16:41:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:13,205 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:13,206 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:13,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-21 16:41:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:13,211 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:13,211 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:13,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-21 16:41:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:13,216 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:13,216 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 16:41:13,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472442090] [2021-02-21 16:41:13,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 16:41:13,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-21 16:41:13,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124289261] [2021-02-21 16:41:13,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-21 16:41:13,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-21 16:41:13,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-21 16:41:13,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-02-21 16:41:13,227 INFO L87 Difference]: Start difference. First operand 375 states and 488 transitions. Second operand 11 states. [2021-02-21 16:41:15,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 16:41:15,727 INFO L93 Difference]: Finished difference Result 890 states and 1237 transitions. [2021-02-21 16:41:15,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-21 16:41:15,728 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2021-02-21 16:41:15,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 16:41:15,733 INFO L225 Difference]: With dead ends: 890 [2021-02-21 16:41:15,734 INFO L226 Difference]: Without dead ends: 558 [2021-02-21 16:41:15,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-02-21 16:41:15,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-02-21 16:41:15,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2021-02-21 16:41:15,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2021-02-21 16:41:15,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 491 transitions. [2021-02-21 16:41:15,804 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 491 transitions. Word has length 70 [2021-02-21 16:41:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 16:41:15,805 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 491 transitions. [2021-02-21 16:41:15,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-21 16:41:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 491 transitions. [2021-02-21 16:41:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-21 16:41:15,807 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 16:41:15,808 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-21 16:41:15,808 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-21 16:41:15,808 INFO L428 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 16:41:15,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 16:41:15,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2139075897, now seen corresponding path program 1 times [2021-02-21 16:41:15,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-21 16:41:15,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602884538] [2021-02-21 16:41:15,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 16:41:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:15,845 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:15,846 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:15,849 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:15,850 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:15,851 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:15,851 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:15,856 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:15,856 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:15,860 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:15,861 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 16:41:15,867 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:15,867 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:15,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 16:41:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:15,958 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:15,959 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:15,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-21 16:41:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:15,995 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:15,996 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:16,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-21 16:41:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:16,028 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:16,029 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 16:41:16,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-21 16:41:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:16,057 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:16,058 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:16,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-21 16:41:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:16,078 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:16,078 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:16,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-21 16:41:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:16,098 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:16,100 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:16,101 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:16,101 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 16:41:16,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 16:41:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:16,115 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:16,116 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:16,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-21 16:41:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:16,122 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:16,122 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:16,123 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:16,124 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 16:41:16,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-21 16:41:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:16,128 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:16,130 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:16,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-21 16:41:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:16,133 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:16,136 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:16,145 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-21 16:41:16,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602884538] [2021-02-21 16:41:16,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 16:41:16,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-02-21 16:41:16,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090874619] [2021-02-21 16:41:16,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-02-21 16:41:16,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-21 16:41:16,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-02-21 16:41:16,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-02-21 16:41:16,147 INFO L87 Difference]: Start difference. First operand 380 states and 491 transitions. Second operand 13 states. [2021-02-21 16:41:16,388 WARN L202 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2021-02-21 16:41:17,655 WARN L202 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2021-02-21 16:41:24,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 16:41:24,029 INFO L93 Difference]: Finished difference Result 2301 states and 3260 transitions. [2021-02-21 16:41:24,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-02-21 16:41:24,029 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2021-02-21 16:41:24,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 16:41:24,045 INFO L225 Difference]: With dead ends: 2301 [2021-02-21 16:41:24,045 INFO L226 Difference]: Without dead ends: 1935 [2021-02-21 16:41:24,050 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-21 16:41:24,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2021-02-21 16:41:24,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1616. [2021-02-21 16:41:24,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2021-02-21 16:41:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2137 transitions. [2021-02-21 16:41:24,347 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2137 transitions. Word has length 70 [2021-02-21 16:41:24,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 16:41:24,348 INFO L480 AbstractCegarLoop]: Abstraction has 1616 states and 2137 transitions. [2021-02-21 16:41:24,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-02-21 16:41:24,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2137 transitions. [2021-02-21 16:41:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-21 16:41:24,349 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 16:41:24,349 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-21 16:41:24,349 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-21 16:41:24,350 INFO L428 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 16:41:24,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 16:41:24,350 INFO L82 PathProgramCache]: Analyzing trace with hash 508153532, now seen corresponding path program 1 times [2021-02-21 16:41:24,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-21 16:41:24,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743411070] [2021-02-21 16:41:24,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 16:41:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:24,399 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:24,400 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:24,400 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:24,401 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:24,404 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:24,404 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:24,405 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:24,406 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:24,406 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:24,407 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:24,408 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:24,409 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:24,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 16:41:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:24,492 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:24,493 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:24,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-21 16:41:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:24,520 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:24,521 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 16:41:24,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-21 16:41:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:24,539 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:24,540 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 16:41:24,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-21 16:41:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:24,564 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:24,565 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:24,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-21 16:41:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:24,578 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:24,579 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 16:41:24,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-21 16:41:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:24,586 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:24,586 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:24,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 16:41:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:24,591 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:24,591 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:24,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-21 16:41:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:24,595 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:24,595 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:24,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-21 16:41:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:24,608 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:24,609 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-02-21 16:41:24,620 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:24,621 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 16:41:24,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-21 16:41:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 16:41:24,634 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 16:41:24,634 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 16:41:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 16:41:24,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743411070] [2021-02-21 16:41:24,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 16:41:24,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-21 16:41:24,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901317534] [2021-02-21 16:41:24,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-21 16:41:24,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-21 16:41:24,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-21 16:41:24,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-02-21 16:41:24,647 INFO L87 Difference]: Start difference. First operand 1616 states and 2137 transitions. Second operand 10 states. [2021-02-21 16:41:28,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 16:41:28,068 INFO L93 Difference]: Finished difference Result 3486 states and 4678 transitions. [2021-02-21 16:41:28,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-02-21 16:41:28,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2021-02-21 16:41:28,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 16:41:28,087 INFO L225 Difference]: With dead ends: 3486 [2021-02-21 16:41:28,087 INFO L226 Difference]: Without dead ends: 2141 [2021-02-21 16:41:28,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2021-02-21 16:41:28,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2021-02-21 16:41:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1623. [2021-02-21 16:41:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2021-02-21 16:41:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2135 transitions. [2021-02-21 16:41:28,381 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2135 transitions. Word has length 70 [2021-02-21 16:41:28,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 16:41:28,381 INFO L480 AbstractCegarLoop]: Abstraction has 1623 states and 2135 transitions. [2021-02-21 16:41:28,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-21 16:41:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2135 transitions. [2021-02-21 16:41:28,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-21 16:41:28,382 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 16:41:28,382 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-21 16:41:28,383 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-21 16:41:28,383 INFO L428 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 16:41:28,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 16:41:28,384 INFO L82 PathProgramCache]: Analyzing trace with hash -309494918, now seen corresponding path program 1 times [2021-02-21 16:41:28,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-21 16:41:28,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901615882] [2021-02-21 16:41:28,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 16:41:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-02-21 16:41:28,419 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-02-21 16:41:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-02-21 16:41:28,448 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-02-21 16:41:28,533 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-02-21 16:41:28,533 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-02-21 16:41:28,533 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-21 16:41:28,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 04:41:28 BoogieIcfgContainer [2021-02-21 16:41:28,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-21 16:41:28,711 INFO L168 Benchmark]: Toolchain (without parser) took 31667.66 ms. Allocated memory was 152.0 MB in the beginning and 457.2 MB in the end (delta: 305.1 MB). Free memory was 127.6 MB in the beginning and 426.1 MB in the end (delta: -298.4 MB). Peak memory consumption was 269.2 MB. Max. memory is 8.0 GB. [2021-02-21 16:41:28,712 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 152.0 MB. Free memory is still 124.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-21 16:41:28,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 490.95 ms. Allocated memory is still 152.0 MB. Free memory was 126.6 MB in the beginning and 114.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-02-21 16:41:28,715 INFO L168 Benchmark]: Boogie Preprocessor took 66.70 ms. Allocated memory is still 152.0 MB. Free memory was 114.1 MB in the beginning and 112.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-02-21 16:41:28,716 INFO L168 Benchmark]: RCFGBuilder took 800.25 ms. Allocated memory is still 152.0 MB. Free memory was 112.0 MB in the beginning and 112.7 MB in the end (delta: -750.5 kB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-02-21 16:41:28,716 INFO L168 Benchmark]: TraceAbstraction took 30284.45 ms. Allocated memory was 152.0 MB in the beginning and 457.2 MB in the end (delta: 305.1 MB). Free memory was 112.2 MB in the beginning and 426.1 MB in the end (delta: -313.8 MB). Peak memory consumption was 252.4 MB. Max. memory is 8.0 GB. [2021-02-21 16:41:28,720 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.27 ms. Allocated memory is still 152.0 MB. Free memory is still 124.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 490.95 ms. Allocated memory is still 152.0 MB. Free memory was 126.6 MB in the beginning and 114.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 66.70 ms. Allocated memory is still 152.0 MB. Free memory was 114.1 MB in the beginning and 112.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 800.25 ms. Allocated memory is still 152.0 MB. Free memory was 112.0 MB in the beginning and 112.7 MB in the end (delta: -750.5 kB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 30284.45 ms. Allocated memory was 152.0 MB in the beginning and 457.2 MB in the end (delta: 305.1 MB). Free memory was 112.2 MB in the beginning and 426.1 MB in the end (delta: -313.8 MB). Peak memory consumption was 252.4 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: 30.0s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 25.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1127 SDtfs, 4454 SDslu, 1199 SDs, 0 SdLazy, 11147 SolverSat, 2893 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 347 GetRequests, 160 SyntacticMatches, 5 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 6.1s 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s 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...