java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:18:06,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:18:06,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:18:06,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:18:06,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:18:06,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:18:06,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:18:06,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:18:06,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:18:06,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:18:06,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:18:06,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:18:06,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:18:06,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:18:06,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:18:06,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:18:06,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:18:06,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:18:06,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:18:06,169 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:18:06,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:18:06,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:18:06,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:18:06,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:18:06,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:18:06,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:18:06,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:18:06,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:18:06,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:18:06,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:18:06,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:18:06,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:18:06,180 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:18:06,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:18:06,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:18:06,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:18:06,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:18:06,183 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:18:06,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:18:06,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:18:06,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:18:06,186 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 03:18:06,208 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:18:06,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:18:06,209 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:18:06,210 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:18:06,211 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:18:06,211 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:18:06,211 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:18:06,212 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:18:06,212 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:18:06,212 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:18:06,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:18:06,213 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:18:06,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:18:06,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:18:06,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:18:06,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:18:06,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:18:06,214 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:18:06,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:18:06,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:18:06,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:18:06,215 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:18:06,216 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:18:06,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:18:06,217 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:18:06,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:18:06,217 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:18:06,218 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:18:06,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:18:06,218 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:18:06,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:18:06,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:18:06,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:18:06,289 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:18:06,289 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:18:06,290 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2019-09-10 03:18:06,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025e38dac/49cad74716ab4da38ab9880ef7743773/FLAG237709c49 [2019-09-10 03:18:06,825 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:18:06,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2019-09-10 03:18:06,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025e38dac/49cad74716ab4da38ab9880ef7743773/FLAG237709c49 [2019-09-10 03:18:07,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025e38dac/49cad74716ab4da38ab9880ef7743773 [2019-09-10 03:18:07,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:18:07,193 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:18:07,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:18:07,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:18:07,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:18:07,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:18:07" (1/1) ... [2019-09-10 03:18:07,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d38196f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:18:07, skipping insertion in model container [2019-09-10 03:18:07,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:18:07" (1/1) ... [2019-09-10 03:18:07,209 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:18:07,242 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:18:07,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:18:07,450 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:18:07,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:18:07,621 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:18:07,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:18:07 WrapperNode [2019-09-10 03:18:07,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:18:07,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:18:07,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:18:07,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:18:07,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:18:07" (1/1) ... [2019-09-10 03:18:07,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:18:07" (1/1) ... [2019-09-10 03:18:07,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:18:07" (1/1) ... [2019-09-10 03:18:07,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:18:07" (1/1) ... [2019-09-10 03:18:07,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:18:07" (1/1) ... [2019-09-10 03:18:07,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:18:07" (1/1) ... [2019-09-10 03:18:07,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:18:07" (1/1) ... [2019-09-10 03:18:07,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:18:07,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:18:07,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:18:07,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:18:07,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:18:07" (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 [2019-09-10 03:18:07,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:18:07,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:18:07,715 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:18:07,715 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2019-09-10 03:18:07,716 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2019-09-10 03:18:07,716 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2019-09-10 03:18:07,716 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2019-09-10 03:18:07,716 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2019-09-10 03:18:07,716 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2019-09-10 03:18:07,716 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:18:07,717 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:18:07,717 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:18:07,717 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:18:07,717 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:18:07,717 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:18:07,717 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:18:07,717 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:18:07,718 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:18:07,718 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:18:07,718 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:18:07,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:18:07,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:18:07,718 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:18:07,719 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2019-09-10 03:18:07,719 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2019-09-10 03:18:07,719 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2019-09-10 03:18:07,719 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2019-09-10 03:18:07,719 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2019-09-10 03:18:07,719 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2019-09-10 03:18:07,720 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:18:07,720 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:18:07,720 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:18:07,720 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:18:07,720 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:18:07,720 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:18:07,720 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:18:07,721 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:18:07,721 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:18:07,721 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:18:07,721 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:18:07,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:18:07,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:18:08,216 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:18:08,216 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 03:18:08,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:18:08 BoogieIcfgContainer [2019-09-10 03:18:08,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:18:08,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:18:08,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:18:08,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:18:08,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:18:07" (1/3) ... [2019-09-10 03:18:08,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27efaf7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:18:08, skipping insertion in model container [2019-09-10 03:18:08,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:18:07" (2/3) ... [2019-09-10 03:18:08,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27efaf7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:18:08, skipping insertion in model container [2019-09-10 03:18:08,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:18:08" (3/3) ... [2019-09-10 03:18:08,236 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2019-09-10 03:18:08,246 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:18:08,256 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:18:08,274 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:18:08,309 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:18:08,309 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:18:08,310 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:18:08,310 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:18:08,310 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:18:08,311 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:18:08,311 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:18:08,311 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:18:08,348 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-09-10 03:18:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:18:08,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:08,375 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:08,377 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:08,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:08,383 INFO L82 PathProgramCache]: Analyzing trace with hash 4101629, now seen corresponding path program 1 times [2019-09-10 03:18:08,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:08,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:08,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:08,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:08,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:18:08,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:18:08,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:18:08,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:08,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:18:08,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:18:08,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:18:08,751 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 5 states. [2019-09-10 03:18:09,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:09,481 INFO L93 Difference]: Finished difference Result 268 states and 349 transitions. [2019-09-10 03:18:09,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:18:09,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 03:18:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:09,514 INFO L225 Difference]: With dead ends: 268 [2019-09-10 03:18:09,514 INFO L226 Difference]: Without dead ends: 252 [2019-09-10 03:18:09,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:18:09,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-09-10 03:18:09,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 233. [2019-09-10 03:18:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-10 03:18:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 305 transitions. [2019-09-10 03:18:09,627 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 305 transitions. Word has length 78 [2019-09-10 03:18:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:09,627 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 305 transitions. [2019-09-10 03:18:09,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:18:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 305 transitions. [2019-09-10 03:18:09,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:18:09,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:09,633 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:09,633 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:09,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:09,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1430979773, now seen corresponding path program 1 times [2019-09-10 03:18:09,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:09,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:09,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:09,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:09,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:18:09,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:18:09,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:18:09,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:09,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:18:09,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:18:09,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:18:09,779 INFO L87 Difference]: Start difference. First operand 233 states and 305 transitions. Second operand 6 states. [2019-09-10 03:18:10,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:10,608 INFO L93 Difference]: Finished difference Result 422 states and 573 transitions. [2019-09-10 03:18:10,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:18:10,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-10 03:18:10,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:10,615 INFO L225 Difference]: With dead ends: 422 [2019-09-10 03:18:10,616 INFO L226 Difference]: Without dead ends: 422 [2019-09-10 03:18:10,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:18:10,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-09-10 03:18:10,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 359. [2019-09-10 03:18:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-10 03:18:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2019-09-10 03:18:10,705 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 78 [2019-09-10 03:18:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:10,706 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2019-09-10 03:18:10,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:18:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2019-09-10 03:18:10,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:18:10,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:10,714 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:10,715 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:10,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:10,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1477202113, now seen corresponding path program 1 times [2019-09-10 03:18:10,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:10,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:10,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:10,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:10,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:10,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:18:10,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:18:10,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:18:10,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:10,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:18:10,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:18:10,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:18:10,820 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 6 states. [2019-09-10 03:18:10,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:10,859 INFO L93 Difference]: Finished difference Result 369 states and 486 transitions. [2019-09-10 03:18:10,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:18:10,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-10 03:18:10,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:10,863 INFO L225 Difference]: With dead ends: 369 [2019-09-10 03:18:10,864 INFO L226 Difference]: Without dead ends: 369 [2019-09-10 03:18:10,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:18:10,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-10 03:18:10,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 364. [2019-09-10 03:18:10,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-10 03:18:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 478 transitions. [2019-09-10 03:18:10,884 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 478 transitions. Word has length 78 [2019-09-10 03:18:10,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:10,884 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 478 transitions. [2019-09-10 03:18:10,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:18:10,885 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 478 transitions. [2019-09-10 03:18:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:18:10,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:10,887 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:10,888 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:10,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1229055619, now seen corresponding path program 1 times [2019-09-10 03:18:10,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:10,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:10,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:10,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:10,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:18:10,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:18:10,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:18:10,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:10,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:18:10,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:18:10,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:18:10,998 INFO L87 Difference]: Start difference. First operand 364 states and 478 transitions. Second operand 4 states. [2019-09-10 03:18:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:11,190 INFO L93 Difference]: Finished difference Result 670 states and 861 transitions. [2019-09-10 03:18:11,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:18:11,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-10 03:18:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:11,201 INFO L225 Difference]: With dead ends: 670 [2019-09-10 03:18:11,201 INFO L226 Difference]: Without dead ends: 670 [2019-09-10 03:18:11,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:18:11,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-09-10 03:18:11,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2019-09-10 03:18:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-10 03:18:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 834 transitions. [2019-09-10 03:18:11,255 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 834 transitions. Word has length 78 [2019-09-10 03:18:11,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:11,256 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 834 transitions. [2019-09-10 03:18:11,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:18:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 834 transitions. [2019-09-10 03:18:11,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:18:11,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:11,263 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:11,264 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:11,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:11,265 INFO L82 PathProgramCache]: Analyzing trace with hash 650743635, now seen corresponding path program 1 times [2019-09-10 03:18:11,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:11,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:11,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:11,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:11,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:18:11,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:18:11,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:18:11,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:11,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:18:11,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:18:11,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:18:11,423 INFO L87 Difference]: Start difference. First operand 651 states and 834 transitions. Second operand 6 states. [2019-09-10 03:18:11,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:11,461 INFO L93 Difference]: Finished difference Result 672 states and 852 transitions. [2019-09-10 03:18:11,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:18:11,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-10 03:18:11,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:11,466 INFO L225 Difference]: With dead ends: 672 [2019-09-10 03:18:11,466 INFO L226 Difference]: Without dead ends: 672 [2019-09-10 03:18:11,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:18:11,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-10 03:18:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 666. [2019-09-10 03:18:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-10 03:18:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 846 transitions. [2019-09-10 03:18:11,494 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 846 transitions. Word has length 78 [2019-09-10 03:18:11,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:11,494 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 846 transitions. [2019-09-10 03:18:11,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:18:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 846 transitions. [2019-09-10 03:18:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:18:11,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:11,498 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:11,498 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:11,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:11,499 INFO L82 PathProgramCache]: Analyzing trace with hash 578357077, now seen corresponding path program 1 times [2019-09-10 03:18:11,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:11,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:11,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:11,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:11,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:18:11,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:18:11,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:18:11,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:11,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:18:11,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:18:11,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:18:11,592 INFO L87 Difference]: Start difference. First operand 666 states and 846 transitions. Second operand 6 states. [2019-09-10 03:18:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:12,424 INFO L93 Difference]: Finished difference Result 831 states and 1047 transitions. [2019-09-10 03:18:12,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 03:18:12,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-10 03:18:12,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:12,429 INFO L225 Difference]: With dead ends: 831 [2019-09-10 03:18:12,430 INFO L226 Difference]: Without dead ends: 831 [2019-09-10 03:18:12,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-10 03:18:12,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2019-09-10 03:18:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 682. [2019-09-10 03:18:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-10 03:18:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 855 transitions. [2019-09-10 03:18:12,461 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 855 transitions. Word has length 78 [2019-09-10 03:18:12,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:12,462 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 855 transitions. [2019-09-10 03:18:12,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:18:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 855 transitions. [2019-09-10 03:18:12,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:18:12,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:12,464 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:12,464 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:12,465 INFO L82 PathProgramCache]: Analyzing trace with hash 68883987, now seen corresponding path program 1 times [2019-09-10 03:18:12,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:12,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:12,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:12,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:12,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:18:12,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:18:12,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:18:12,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:12,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:18:12,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:18:12,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:18:12,520 INFO L87 Difference]: Start difference. First operand 682 states and 855 transitions. Second operand 3 states. [2019-09-10 03:18:12,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:12,546 INFO L93 Difference]: Finished difference Result 1276 states and 1609 transitions. [2019-09-10 03:18:12,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:18:12,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 03:18:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:12,555 INFO L225 Difference]: With dead ends: 1276 [2019-09-10 03:18:12,556 INFO L226 Difference]: Without dead ends: 1276 [2019-09-10 03:18:12,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:18:12,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2019-09-10 03:18:12,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1272. [2019-09-10 03:18:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-10 03:18:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1606 transitions. [2019-09-10 03:18:12,604 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1606 transitions. Word has length 78 [2019-09-10 03:18:12,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:12,606 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 1606 transitions. [2019-09-10 03:18:12,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:18:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1606 transitions. [2019-09-10 03:18:12,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 03:18:12,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:12,609 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:12,609 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:12,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:12,610 INFO L82 PathProgramCache]: Analyzing trace with hash 173246819, now seen corresponding path program 1 times [2019-09-10 03:18:12,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:12,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:12,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:12,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:12,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:18:12,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:18:12,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:18:12,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:12,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:18:12,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:18:12,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:18:12,730 INFO L87 Difference]: Start difference. First operand 1272 states and 1606 transitions. Second operand 5 states. [2019-09-10 03:18:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:12,812 INFO L93 Difference]: Finished difference Result 2309 states and 2955 transitions. [2019-09-10 03:18:12,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:18:12,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-10 03:18:12,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:12,826 INFO L225 Difference]: With dead ends: 2309 [2019-09-10 03:18:12,826 INFO L226 Difference]: Without dead ends: 2309 [2019-09-10 03:18:12,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:18:12,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2019-09-10 03:18:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2216. [2019-09-10 03:18:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2019-09-10 03:18:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 2839 transitions. [2019-09-10 03:18:12,913 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 2839 transitions. Word has length 79 [2019-09-10 03:18:12,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:12,914 INFO L475 AbstractCegarLoop]: Abstraction has 2216 states and 2839 transitions. [2019-09-10 03:18:12,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:18:12,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2839 transitions. [2019-09-10 03:18:12,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 03:18:12,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:12,919 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:12,919 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:12,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:12,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1970791480, now seen corresponding path program 1 times [2019-09-10 03:18:12,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:12,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:12,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:12,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:12,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:18:12,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:18:12,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:18:12,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:12,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:18:12,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:18:12,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:18:12,986 INFO L87 Difference]: Start difference. First operand 2216 states and 2839 transitions. Second operand 5 states. [2019-09-10 03:18:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:13,676 INFO L93 Difference]: Finished difference Result 4830 states and 6579 transitions. [2019-09-10 03:18:13,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:18:13,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-10 03:18:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:13,709 INFO L225 Difference]: With dead ends: 4830 [2019-09-10 03:18:13,709 INFO L226 Difference]: Without dead ends: 4830 [2019-09-10 03:18:13,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:18:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4830 states. [2019-09-10 03:18:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4830 to 4685. [2019-09-10 03:18:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4685 states. [2019-09-10 03:18:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4685 states to 4685 states and 6275 transitions. [2019-09-10 03:18:13,973 INFO L78 Accepts]: Start accepts. Automaton has 4685 states and 6275 transitions. Word has length 87 [2019-09-10 03:18:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:13,974 INFO L475 AbstractCegarLoop]: Abstraction has 4685 states and 6275 transitions. [2019-09-10 03:18:13,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:18:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states and 6275 transitions. [2019-09-10 03:18:13,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 03:18:13,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:13,988 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:13,989 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:13,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:13,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1829324777, now seen corresponding path program 1 times [2019-09-10 03:18:13,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:13,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:13,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:13,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:13,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:18:14,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:18:14,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:18:14,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:14,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:18:14,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:18:14,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:18:14,079 INFO L87 Difference]: Start difference. First operand 4685 states and 6275 transitions. Second operand 4 states. [2019-09-10 03:18:14,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:14,277 INFO L93 Difference]: Finished difference Result 6310 states and 8457 transitions. [2019-09-10 03:18:14,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:18:14,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-10 03:18:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:14,318 INFO L225 Difference]: With dead ends: 6310 [2019-09-10 03:18:14,318 INFO L226 Difference]: Without dead ends: 6310 [2019-09-10 03:18:14,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:18:14,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6310 states. [2019-09-10 03:18:14,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6310 to 6141. [2019-09-10 03:18:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6141 states. [2019-09-10 03:18:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 8233 transitions. [2019-09-10 03:18:14,600 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 8233 transitions. Word has length 88 [2019-09-10 03:18:14,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:14,600 INFO L475 AbstractCegarLoop]: Abstraction has 6141 states and 8233 transitions. [2019-09-10 03:18:14,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:18:14,601 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 8233 transitions. [2019-09-10 03:18:14,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 03:18:14,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:14,604 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:14,605 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:14,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:14,605 INFO L82 PathProgramCache]: Analyzing trace with hash -874813360, now seen corresponding path program 1 times [2019-09-10 03:18:14,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:14,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:14,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:14,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:14,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:18:14,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:18:14,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:18:14,715 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2019-09-10 03:18:14,717 INFO L207 CegarAbsIntRunner]: [0], [2], [7], [10], [15], [17], [18], [21], [30], [31], [50], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [130], [131], [132], [141], [144], [147], [153], [156], [166], [169], [192], [202], [204], [206], [207], [213], [215], [220], [226], [228], [229], [243], [245], [267], [277], [279], [281], [282], [283], [286], [302], [310], [312], [315], [320], [331], [332], [333], [334], [335], [336], [337], [338], [339], [345], [346], [347], [348], [349], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [377], [378], [379], [381] [2019-09-10 03:18:14,780 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:18:14,780 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:18:14,978 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:18:14,981 INFO L272 AbstractInterpreter]: Visited 86 different actions 89 times. Merged at 2 different actions 2 times. Never widened. Performed 392 root evaluator evaluations with a maximum evaluation depth of 4. Performed 392 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 40 variables. [2019-09-10 03:18:14,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:14,985 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:18:15,189 INFO L227 lantSequenceWeakener]: Weakened 85 states. On average, predicates are now at 78.23% of their original sizes. [2019-09-10 03:18:15,190 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:18:15,689 INFO L420 sIntCurrentIteration]: We unified 88 AI predicates to 88 [2019-09-10 03:18:15,690 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:18:15,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:18:15,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [6] total 37 [2019-09-10 03:18:15,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:15,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 03:18:15,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 03:18:15,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:18:15,693 INFO L87 Difference]: Start difference. First operand 6141 states and 8233 transitions. Second operand 33 states. [2019-09-10 03:18:27,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:27,570 INFO L93 Difference]: Finished difference Result 11617 states and 15651 transitions. [2019-09-10 03:18:27,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 03:18:27,571 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 89 [2019-09-10 03:18:27,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:27,635 INFO L225 Difference]: With dead ends: 11617 [2019-09-10 03:18:27,635 INFO L226 Difference]: Without dead ends: 11617 [2019-09-10 03:18:27,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=513, Invalid=2793, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 03:18:27,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11617 states. [2019-09-10 03:18:28,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11617 to 10667. [2019-09-10 03:18:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10667 states. [2019-09-10 03:18:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10667 states to 10667 states and 14383 transitions. [2019-09-10 03:18:28,049 INFO L78 Accepts]: Start accepts. Automaton has 10667 states and 14383 transitions. Word has length 89 [2019-09-10 03:18:28,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:28,049 INFO L475 AbstractCegarLoop]: Abstraction has 10667 states and 14383 transitions. [2019-09-10 03:18:28,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 03:18:28,050 INFO L276 IsEmpty]: Start isEmpty. Operand 10667 states and 14383 transitions. [2019-09-10 03:18:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 03:18:28,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:28,053 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:28,053 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:28,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:28,054 INFO L82 PathProgramCache]: Analyzing trace with hash -851936585, now seen corresponding path program 1 times [2019-09-10 03:18:28,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:28,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:28,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:28,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:28,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:18:28,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:18:28,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 03:18:28,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:28,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:18:28,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:18:28,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:18:28,137 INFO L87 Difference]: Start difference. First operand 10667 states and 14383 transitions. Second operand 7 states. [2019-09-10 03:18:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:29,655 INFO L93 Difference]: Finished difference Result 23916 states and 32591 transitions. [2019-09-10 03:18:29,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 03:18:29,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-09-10 03:18:29,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:29,813 INFO L225 Difference]: With dead ends: 23916 [2019-09-10 03:18:29,813 INFO L226 Difference]: Without dead ends: 21075 [2019-09-10 03:18:29,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-09-10 03:18:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21075 states. [2019-09-10 03:18:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21075 to 19665. [2019-09-10 03:18:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19665 states. [2019-09-10 03:18:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19665 states to 19665 states and 25847 transitions. [2019-09-10 03:18:31,075 INFO L78 Accepts]: Start accepts. Automaton has 19665 states and 25847 transitions. Word has length 100 [2019-09-10 03:18:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:31,076 INFO L475 AbstractCegarLoop]: Abstraction has 19665 states and 25847 transitions. [2019-09-10 03:18:31,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:18:31,076 INFO L276 IsEmpty]: Start isEmpty. Operand 19665 states and 25847 transitions. [2019-09-10 03:18:31,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 03:18:31,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:31,081 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:31,082 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:31,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:31,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1692518472, now seen corresponding path program 1 times [2019-09-10 03:18:31,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:31,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:31,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:31,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:31,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 03:18:31,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:18:31,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:18:31,223 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 03:18:31,223 INFO L207 CegarAbsIntRunner]: [0], [2], [7], [10], [15], [17], [18], [21], [30], [31], [50], [56], [58], [61], [67], [71], [72], [79], [81], [84], [95], [99], [102], [104], [108], [109], [130], [131], [132], [141], [144], [147], [153], [156], [166], [169], [172], [192], [202], [204], [206], [207], [213], [215], [220], [226], [228], [229], [243], [245], [267], [277], [279], [281], [282], [283], [286], [302], [310], [312], [315], [320], [331], [332], [333], [334], [335], [336], [337], [338], [339], [345], [346], [347], [348], [349], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [377], [378], [379], [381] [2019-09-10 03:18:31,235 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:18:31,236 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:18:31,310 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:18:31,311 INFO L272 AbstractInterpreter]: Visited 88 different actions 98 times. Merged at 4 different actions 4 times. Never widened. Performed 469 root evaluator evaluations with a maximum evaluation depth of 4. Performed 469 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 40 variables. [2019-09-10 03:18:31,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:31,311 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:18:31,467 INFO L227 lantSequenceWeakener]: Weakened 105 states. On average, predicates are now at 79.16% of their original sizes. [2019-09-10 03:18:31,467 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:18:32,648 INFO L420 sIntCurrentIteration]: We unified 109 AI predicates to 109 [2019-09-10 03:18:32,649 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:18:32,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:18:32,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [8] total 50 [2019-09-10 03:18:32,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:32,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-10 03:18:32,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-10 03:18:32,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1617, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 03:18:32,652 INFO L87 Difference]: Start difference. First operand 19665 states and 25847 transitions. Second operand 44 states. [2019-09-10 03:18:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:44,434 INFO L93 Difference]: Finished difference Result 15186 states and 19757 transitions. [2019-09-10 03:18:44,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 03:18:44,434 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 110 [2019-09-10 03:18:44,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:44,491 INFO L225 Difference]: With dead ends: 15186 [2019-09-10 03:18:44,491 INFO L226 Difference]: Without dead ends: 15186 [2019-09-10 03:18:44,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=728, Invalid=4102, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 03:18:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15186 states. [2019-09-10 03:18:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15186 to 11151. [2019-09-10 03:18:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11151 states. [2019-09-10 03:18:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11151 states to 11151 states and 14463 transitions. [2019-09-10 03:18:45,027 INFO L78 Accepts]: Start accepts. Automaton has 11151 states and 14463 transitions. Word has length 110 [2019-09-10 03:18:45,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:45,028 INFO L475 AbstractCegarLoop]: Abstraction has 11151 states and 14463 transitions. [2019-09-10 03:18:45,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-10 03:18:45,028 INFO L276 IsEmpty]: Start isEmpty. Operand 11151 states and 14463 transitions. [2019-09-10 03:18:45,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 03:18:45,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:45,041 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:45,042 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:45,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:45,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1678857644, now seen corresponding path program 1 times [2019-09-10 03:18:45,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:45,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:45,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:45,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:45,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:45,141 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-10 03:18:45,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:18:45,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:18:45,141 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2019-09-10 03:18:45,142 INFO L207 CegarAbsIntRunner]: [0], [2], [7], [10], [13], [15], [17], [18], [21], [30], [31], [36], [40], [44], [45], [48], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [130], [131], [132], [141], [144], [147], [149], [153], [156], [159], [166], [169], [180], [181], [183], [186], [190], [191], [192], [195], [198], [202], [204], [206], [207], [210], [213], [215], [218], [220], [224], [226], [228], [229], [243], [245], [247], [249], [254], [259], [267], [277], [279], [281], [282], [283], [286], [288], [291], [302], [306], [308], [310], [312], [315], [318], [320], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [381] [2019-09-10 03:18:45,148 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:18:45,148 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:18:45,462 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:18:45,463 INFO L272 AbstractInterpreter]: Visited 104 different actions 911 times. Merged at 24 different actions 351 times. Widened at 1 different actions 5 times. Performed 5957 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5957 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 81 fixpoints after 8 different actions. Largest state had 40 variables. [2019-09-10 03:18:45,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:45,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:18:45,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:18:45,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:18:45,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:45,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:18:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:45,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-10 03:18:45,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:18:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 03:18:45,668 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:18:45,832 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:18:45,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:18:45,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 4] total 10 [2019-09-10 03:18:45,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:45,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:18:45,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:18:45,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 03:18:45,843 INFO L87 Difference]: Start difference. First operand 11151 states and 14463 transitions. Second operand 3 states. [2019-09-10 03:18:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:45,882 INFO L93 Difference]: Finished difference Result 9835 states and 11842 transitions. [2019-09-10 03:18:45,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:18:45,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-09-10 03:18:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:45,913 INFO L225 Difference]: With dead ends: 9835 [2019-09-10 03:18:45,913 INFO L226 Difference]: Without dead ends: 9694 [2019-09-10 03:18:45,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 03:18:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9694 states. [2019-09-10 03:18:46,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9694 to 9691. [2019-09-10 03:18:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9691 states. [2019-09-10 03:18:46,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9691 states to 9691 states and 11686 transitions. [2019-09-10 03:18:46,141 INFO L78 Accepts]: Start accepts. Automaton has 9691 states and 11686 transitions. Word has length 188 [2019-09-10 03:18:46,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:46,142 INFO L475 AbstractCegarLoop]: Abstraction has 9691 states and 11686 transitions. [2019-09-10 03:18:46,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:18:46,142 INFO L276 IsEmpty]: Start isEmpty. Operand 9691 states and 11686 transitions. [2019-09-10 03:18:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 03:18:46,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:46,150 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:46,150 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:46,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:46,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1329668345, now seen corresponding path program 1 times [2019-09-10 03:18:46,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:46,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:46,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:46,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:46,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 03:18:46,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:18:46,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:18:46,287 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2019-09-10 03:18:46,288 INFO L207 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [13], [15], [17], [18], [21], [23], [28], [30], [31], [36], [40], [44], [45], [48], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [130], [131], [132], [141], [144], [147], [149], [153], [156], [159], [166], [169], [180], [181], [183], [186], [190], [191], [192], [195], [198], [202], [204], [206], [207], [210], [213], [215], [218], [220], [224], [226], [228], [229], [243], [245], [247], [249], [254], [259], [267], [270], [273], [277], [279], [281], [282], [283], [286], [288], [291], [302], [306], [308], [310], [312], [315], [318], [320], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [381] [2019-09-10 03:18:46,296 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:18:46,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:18:49,116 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:18:49,117 INFO L272 AbstractInterpreter]: Visited 139 different actions 8989 times. Merged at 65 different actions 3426 times. Widened at 6 different actions 48 times. Performed 53491 root evaluator evaluations with a maximum evaluation depth of 4. Performed 53491 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 853 fixpoints after 23 different actions. Largest state had 40 variables. [2019-09-10 03:18:49,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:49,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:18:49,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:18:49,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:18:49,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:49,136 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:18:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:49,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 03:18:49,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:18:49,346 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 65 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 03:18:49,346 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:18:49,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:18:49,656 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-10 03:18:49,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:18:49,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2019-09-10 03:18:49,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:18:49,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:18:49,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:18:49,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-09-10 03:18:49,674 INFO L87 Difference]: Start difference. First operand 9691 states and 11686 transitions. Second operand 11 states. [2019-09-10 03:18:50,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:50,995 INFO L93 Difference]: Finished difference Result 19825 states and 23573 transitions. [2019-09-10 03:18:50,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 03:18:50,996 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2019-09-10 03:18:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:51,058 INFO L225 Difference]: With dead ends: 19825 [2019-09-10 03:18:51,058 INFO L226 Difference]: Without dead ends: 18240 [2019-09-10 03:18:51,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 384 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2019-09-10 03:18:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18240 states. [2019-09-10 03:18:51,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18240 to 17124. [2019-09-10 03:18:51,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17124 states. [2019-09-10 03:18:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17124 states to 17124 states and 20263 transitions. [2019-09-10 03:18:51,456 INFO L78 Accepts]: Start accepts. Automaton has 17124 states and 20263 transitions. Word has length 189 [2019-09-10 03:18:51,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:51,457 INFO L475 AbstractCegarLoop]: Abstraction has 17124 states and 20263 transitions. [2019-09-10 03:18:51,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:18:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand 17124 states and 20263 transitions. [2019-09-10 03:18:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 03:18:51,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:51,467 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:51,468 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:51,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:51,468 INFO L82 PathProgramCache]: Analyzing trace with hash 240152362, now seen corresponding path program 1 times [2019-09-10 03:18:51,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:51,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:51,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:51,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:51,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 37 proven. 16 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-10 03:18:51,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:18:51,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:18:51,585 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2019-09-10 03:18:51,586 INFO L207 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [13], [15], [17], [18], [21], [23], [28], [30], [31], [34], [40], [44], [45], [48], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [130], [131], [132], [141], [144], [147], [149], [153], [156], [159], [166], [169], [175], [180], [181], [183], [186], [190], [191], [192], [195], [198], [202], [204], [206], [207], [210], [213], [215], [218], [220], [224], [226], [228], [229], [243], [245], [247], [249], [254], [259], [267], [270], [273], [277], [279], [281], [282], [283], [286], [288], [291], [302], [306], [308], [312], [315], [320], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [381] [2019-09-10 03:18:51,588 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:18:51,589 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:18:53,466 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:18:53,467 INFO L272 AbstractInterpreter]: Visited 135 different actions 5498 times. Merged at 39 different actions 1569 times. Widened at 6 different actions 35 times. Performed 35807 root evaluator evaluations with a maximum evaluation depth of 4. Performed 35807 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 431 fixpoints after 15 different actions. Largest state had 40 variables. [2019-09-10 03:18:53,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:53,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:18:53,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:18:53,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:18:53,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:53,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:18:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:53,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-10 03:18:53,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:18:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 03:18:53,651 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:18:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 03:18:53,812 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:18:53,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [9] total 11 [2019-09-10 03:18:53,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:53,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:18:53,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:18:53,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:18:53,817 INFO L87 Difference]: Start difference. First operand 17124 states and 20263 transitions. Second operand 3 states. [2019-09-10 03:18:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:53,868 INFO L93 Difference]: Finished difference Result 16838 states and 19847 transitions. [2019-09-10 03:18:53,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:18:53,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-10 03:18:53,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:53,913 INFO L225 Difference]: With dead ends: 16838 [2019-09-10 03:18:53,913 INFO L226 Difference]: Without dead ends: 16835 [2019-09-10 03:18:53,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 388 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:18:53,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16835 states. [2019-09-10 03:18:54,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16835 to 16702. [2019-09-10 03:18:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16702 states. [2019-09-10 03:18:54,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16702 states to 16702 states and 19684 transitions. [2019-09-10 03:18:54,348 INFO L78 Accepts]: Start accepts. Automaton has 16702 states and 19684 transitions. Word has length 196 [2019-09-10 03:18:54,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:54,349 INFO L475 AbstractCegarLoop]: Abstraction has 16702 states and 19684 transitions. [2019-09-10 03:18:54,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:18:54,349 INFO L276 IsEmpty]: Start isEmpty. Operand 16702 states and 19684 transitions. [2019-09-10 03:18:54,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 03:18:54,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:54,357 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:54,357 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:54,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:54,357 INFO L82 PathProgramCache]: Analyzing trace with hash -597185905, now seen corresponding path program 1 times [2019-09-10 03:18:54,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:54,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:54,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:54,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:54,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-10 03:18:54,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:18:54,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:18:54,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:54,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:18:54,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:18:54,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:18:54,432 INFO L87 Difference]: Start difference. First operand 16702 states and 19684 transitions. Second operand 4 states. [2019-09-10 03:18:54,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:54,569 INFO L93 Difference]: Finished difference Result 9300 states and 10632 transitions. [2019-09-10 03:18:54,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:18:54,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-09-10 03:18:54,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:54,589 INFO L225 Difference]: With dead ends: 9300 [2019-09-10 03:18:54,589 INFO L226 Difference]: Without dead ends: 9300 [2019-09-10 03:18:54,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:18:54,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9300 states. [2019-09-10 03:18:54,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9300 to 9234. [2019-09-10 03:18:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-09-10 03:18:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 10544 transitions. [2019-09-10 03:18:54,785 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 10544 transitions. Word has length 197 [2019-09-10 03:18:54,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:54,786 INFO L475 AbstractCegarLoop]: Abstraction has 9234 states and 10544 transitions. [2019-09-10 03:18:54,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:18:54,786 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 10544 transitions. [2019-09-10 03:18:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 03:18:54,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:54,793 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:54,793 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:54,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:54,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1867445501, now seen corresponding path program 1 times [2019-09-10 03:18:54,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:54,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:54,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:54,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:54,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 03:18:55,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:18:55,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:18:55,272 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2019-09-10 03:18:55,273 INFO L207 CegarAbsIntRunner]: [0], [2], [7], [10], [13], [15], [17], [18], [21], [23], [26], [28], [30], [31], [34], [42], [44], [45], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [130], [131], [132], [141], [144], [147], [149], [153], [156], [159], [162], [166], [169], [175], [180], [181], [183], [186], [190], [191], [192], [195], [198], [202], [204], [206], [207], [210], [213], [215], [220], [224], [226], [228], [229], [243], [245], [247], [249], [254], [259], [267], [270], [275], [277], [279], [281], [282], [283], [286], [288], [291], [302], [306], [308], [312], [315], [320], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [381] [2019-09-10 03:18:55,275 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:18:55,276 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:18:57,121 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:18:57,121 INFO L272 AbstractInterpreter]: Visited 137 different actions 8264 times. Merged at 62 different actions 3012 times. Widened at 6 different actions 41 times. Performed 46255 root evaluator evaluations with a maximum evaluation depth of 4. Performed 46255 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 889 fixpoints after 26 different actions. Largest state had 40 variables. [2019-09-10 03:18:57,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:57,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:18:57,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:18:57,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:18:57,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:57,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:18:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:57,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-10 03:18:57,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:18:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 66 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-10 03:18:57,507 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:18:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:18:57,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:18:57,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 24 [2019-09-10 03:18:57,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:18:57,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 03:18:57,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 03:18:57,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2019-09-10 03:18:57,913 INFO L87 Difference]: Start difference. First operand 9234 states and 10544 transitions. Second operand 19 states. [2019-09-10 03:19:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:19:01,816 INFO L93 Difference]: Finished difference Result 18854 states and 21880 transitions. [2019-09-10 03:19:01,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 03:19:01,816 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 198 [2019-09-10 03:19:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:19:01,848 INFO L225 Difference]: With dead ends: 18854 [2019-09-10 03:19:01,848 INFO L226 Difference]: Without dead ends: 18854 [2019-09-10 03:19:01,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 390 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=392, Invalid=1678, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 03:19:01,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18854 states. [2019-09-10 03:19:02,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18854 to 18628. [2019-09-10 03:19:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18628 states. [2019-09-10 03:19:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18628 states to 18628 states and 21538 transitions. [2019-09-10 03:19:02,184 INFO L78 Accepts]: Start accepts. Automaton has 18628 states and 21538 transitions. Word has length 198 [2019-09-10 03:19:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:19:02,186 INFO L475 AbstractCegarLoop]: Abstraction has 18628 states and 21538 transitions. [2019-09-10 03:19:02,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 03:19:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 18628 states and 21538 transitions. [2019-09-10 03:19:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-10 03:19:02,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:19:02,196 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:19:02,196 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:19:02,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:19:02,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1653880274, now seen corresponding path program 2 times [2019-09-10 03:19:02,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:19:02,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:02,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:19:02,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:02,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:19:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:19:02,268 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-10 03:19:02,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:19:02,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:19:02,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:19:02,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:19:02,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:19:02,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:19:02,271 INFO L87 Difference]: Start difference. First operand 18628 states and 21538 transitions. Second operand 3 states. [2019-09-10 03:19:02,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:19:02,337 INFO L93 Difference]: Finished difference Result 18219 states and 20767 transitions. [2019-09-10 03:19:02,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:19:02,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-09-10 03:19:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:19:02,376 INFO L225 Difference]: With dead ends: 18219 [2019-09-10 03:19:02,376 INFO L226 Difference]: Without dead ends: 18219 [2019-09-10 03:19:02,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:19:02,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18219 states. [2019-09-10 03:19:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18219 to 17902. [2019-09-10 03:19:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17902 states. [2019-09-10 03:19:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17902 states to 17902 states and 20405 transitions. [2019-09-10 03:19:02,661 INFO L78 Accepts]: Start accepts. Automaton has 17902 states and 20405 transitions. Word has length 201 [2019-09-10 03:19:02,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:19:02,662 INFO L475 AbstractCegarLoop]: Abstraction has 17902 states and 20405 transitions. [2019-09-10 03:19:02,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:19:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 17902 states and 20405 transitions. [2019-09-10 03:19:02,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-09-10 03:19:02,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:19:02,675 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:19:02,675 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:19:02,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:19:02,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1199003665, now seen corresponding path program 1 times [2019-09-10 03:19:02,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:19:02,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:02,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:19:02,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:02,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:19:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:19:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-09-10 03:19:02,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:19:02,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:19:02,780 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 276 with the following transitions: [2019-09-10 03:19:02,780 INFO L207 CegarAbsIntRunner]: [0], [2], [7], [10], [13], [15], [17], [18], [21], [23], [26], [28], [30], [31], [34], [42], [44], [45], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [130], [131], [132], [141], [144], [147], [149], [153], [156], [162], [166], [169], [172], [180], [181], [183], [186], [190], [191], [192], [195], [198], [202], [204], [206], [207], [210], [213], [215], [220], [224], [226], [228], [229], [243], [245], [247], [249], [254], [259], [267], [270], [275], [277], [279], [281], [282], [283], [286], [288], [291], [302], [306], [308], [310], [312], [315], [318], [320], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [381] [2019-09-10 03:19:02,782 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:19:02,782 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:19:07,751 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:19:07,752 INFO L272 AbstractInterpreter]: Visited 138 different actions 16642 times. Merged at 69 different actions 7319 times. Widened at 9 different actions 138 times. Performed 93078 root evaluator evaluations with a maximum evaluation depth of 4. Performed 93078 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2065 fixpoints after 29 different actions. Largest state had 40 variables. [2019-09-10 03:19:07,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:19:07,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:19:07,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:19:07,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:19:07,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:19:07,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:19:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:19:07,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 1186 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 03:19:07,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:19:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-09-10 03:19:07,981 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:19:08,187 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 41 proven. 21 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-09-10 03:19:08,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:19:08,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 12 [2019-09-10 03:19:08,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:19:08,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:19:08,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:19:08,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:19:08,194 INFO L87 Difference]: Start difference. First operand 17902 states and 20405 transitions. Second operand 6 states. [2019-09-10 03:19:08,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:19:08,258 INFO L93 Difference]: Finished difference Result 11361 states and 13195 transitions. [2019-09-10 03:19:08,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:19:08,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 275 [2019-09-10 03:19:08,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:19:08,275 INFO L225 Difference]: With dead ends: 11361 [2019-09-10 03:19:08,275 INFO L226 Difference]: Without dead ends: 11361 [2019-09-10 03:19:08,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 546 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-09-10 03:19:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11361 states. [2019-09-10 03:19:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11361 to 9122. [2019-09-10 03:19:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9122 states. [2019-09-10 03:19:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9122 states to 9122 states and 10394 transitions. [2019-09-10 03:19:08,413 INFO L78 Accepts]: Start accepts. Automaton has 9122 states and 10394 transitions. Word has length 275 [2019-09-10 03:19:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:19:08,414 INFO L475 AbstractCegarLoop]: Abstraction has 9122 states and 10394 transitions. [2019-09-10 03:19:08,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:19:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 9122 states and 10394 transitions. [2019-09-10 03:19:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-10 03:19:08,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:19:08,424 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:19:08,425 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:19:08,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:19:08,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1850788876, now seen corresponding path program 1 times [2019-09-10 03:19:08,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:19:08,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:08,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:19:08,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:08,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:19:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:19:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-09-10 03:19:08,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:19:08,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:19:08,538 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 294 with the following transitions: [2019-09-10 03:19:08,538 INFO L207 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [13], [15], [17], [18], [21], [23], [28], [30], [31], [34], [36], [40], [42], [44], [45], [48], [50], [54], [56], [58], [61], [67], [71], [72], [79], [81], [84], [95], [99], [102], [104], [108], [109], [130], [131], [132], [141], [144], [147], [149], [153], [156], [166], [169], [175], [180], [181], [183], [186], [190], [191], [192], [195], [198], [200], [202], [204], [206], [207], [210], [213], [215], [218], [220], [224], [226], [228], [229], [243], [245], [247], [249], [254], [259], [267], [270], [273], [277], [279], [281], [282], [283], [286], [288], [291], [302], [306], [308], [310], [312], [315], [318], [320], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [381] [2019-09-10 03:19:08,541 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:19:08,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:19:11,416 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:19:11,417 INFO L272 AbstractInterpreter]: Visited 144 different actions 14832 times. Merged at 77 different actions 6488 times. Widened at 9 different actions 113 times. Performed 83751 root evaluator evaluations with a maximum evaluation depth of 4. Performed 83751 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1788 fixpoints after 34 different actions. Largest state had 40 variables. [2019-09-10 03:19:11,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:19:11,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:19:11,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:19:11,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:19:11,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:19:11,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:19:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:19:11,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 03:19:11,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:19:11,672 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 277 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-10 03:19:11,673 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:19:11,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:19:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 75 proven. 7 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-09-10 03:19:12,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:19:12,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-10 03:19:12,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:19:12,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:19:12,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:19:12,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:19:12,043 INFO L87 Difference]: Start difference. First operand 9122 states and 10394 transitions. Second operand 8 states. [2019-09-10 03:19:12,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:19:12,780 INFO L93 Difference]: Finished difference Result 5873 states and 6678 transitions. [2019-09-10 03:19:12,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:19:12,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 293 [2019-09-10 03:19:12,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:19:12,789 INFO L225 Difference]: With dead ends: 5873 [2019-09-10 03:19:12,790 INFO L226 Difference]: Without dead ends: 5817 [2019-09-10 03:19:12,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 581 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:19:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5817 states. [2019-09-10 03:19:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5817 to 5321. [2019-09-10 03:19:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5321 states. [2019-09-10 03:19:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5321 states to 5321 states and 6055 transitions. [2019-09-10 03:19:12,864 INFO L78 Accepts]: Start accepts. Automaton has 5321 states and 6055 transitions. Word has length 293 [2019-09-10 03:19:12,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:19:12,864 INFO L475 AbstractCegarLoop]: Abstraction has 5321 states and 6055 transitions. [2019-09-10 03:19:12,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:19:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 5321 states and 6055 transitions. [2019-09-10 03:19:12,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-10 03:19:12,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:19:12,870 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:19:12,870 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:19:12,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:19:12,871 INFO L82 PathProgramCache]: Analyzing trace with hash -173980200, now seen corresponding path program 1 times [2019-09-10 03:19:12,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:19:12,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:12,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:19:12,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:19:12,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:19:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:19:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2019-09-10 03:19:12,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:19:12,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:19:12,968 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 295 with the following transitions: [2019-09-10 03:19:12,968 INFO L207 CegarAbsIntRunner]: [0], [2], [7], [10], [13], [15], [17], [18], [21], [23], [26], [28], [30], [31], [34], [42], [44], [45], [50], [54], [56], [58], [61], [67], [71], [72], [79], [95], [99], [102], [104], [108], [109], [130], [131], [132], [141], [144], [147], [149], [153], [156], [159], [162], [166], [169], [175], [180], [181], [183], [186], [190], [191], [192], [195], [198], [202], [204], [206], [207], [210], [213], [215], [220], [224], [226], [228], [229], [243], [245], [247], [249], [254], [259], [267], [270], [275], [277], [279], [281], [282], [283], [286], [288], [291], [302], [306], [308], [312], [315], [318], [320], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [381] [2019-09-10 03:19:12,970 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:19:12,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:19:15,182 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:19:15,183 INFO L272 AbstractInterpreter]: Visited 138 different actions 12393 times. Merged at 66 different actions 4790 times. Widened at 7 different actions 98 times. Performed 67270 root evaluator evaluations with a maximum evaluation depth of 4. Performed 67270 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1516 fixpoints after 27 different actions. Largest state had 40 variables. [2019-09-10 03:19:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:19:15,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:19:15,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:19:15,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:19:15,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:19:15,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:19:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:19:15,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 03:19:15,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:19:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-09-10 03:19:15,395 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:19:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2019-09-10 03:19:15,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:19:15,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2019-09-10 03:19:15,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:19:15,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:19:15,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:19:15,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:19:15,593 INFO L87 Difference]: Start difference. First operand 5321 states and 6055 transitions. Second operand 5 states. [2019-09-10 03:19:15,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:19:15,993 INFO L93 Difference]: Finished difference Result 1171 states and 1265 transitions. [2019-09-10 03:19:15,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:19:15,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2019-09-10 03:19:15,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:19:15,994 INFO L225 Difference]: With dead ends: 1171 [2019-09-10 03:19:15,994 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 03:19:15,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:19:15,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 03:19:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 03:19:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 03:19:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 03:19:15,995 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 294 [2019-09-10 03:19:15,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:19:15,996 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 03:19:15,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:19:15,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 03:19:15,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 03:19:16,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:19:16 BoogieIcfgContainer [2019-09-10 03:19:16,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:19:16,004 INFO L168 Benchmark]: Toolchain (without parser) took 68809.28 ms. Allocated memory was 133.7 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 89.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 551.4 MB. Max. memory is 7.1 GB. [2019-09-10 03:19:16,004 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 108.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 03:19:16,005 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.51 ms. Allocated memory was 133.7 MB in the beginning and 200.3 MB in the end (delta: 66.6 MB). Free memory was 89.3 MB in the beginning and 174.9 MB in the end (delta: -85.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-09-10 03:19:16,006 INFO L168 Benchmark]: Boogie Preprocessor took 42.03 ms. Allocated memory is still 200.3 MB. Free memory was 174.9 MB in the beginning and 173.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-10 03:19:16,006 INFO L168 Benchmark]: RCFGBuilder took 553.83 ms. Allocated memory is still 200.3 MB. Free memory was 173.1 MB in the beginning and 142.7 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2019-09-10 03:19:16,007 INFO L168 Benchmark]: TraceAbstraction took 67781.99 ms. Allocated memory was 200.3 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 142.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 537.3 MB. Max. memory is 7.1 GB. [2019-09-10 03:19:16,013 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 108.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 427.51 ms. Allocated memory was 133.7 MB in the beginning and 200.3 MB in the end (delta: 66.6 MB). Free memory was 89.3 MB in the beginning and 174.9 MB in the end (delta: -85.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.03 ms. Allocated memory is still 200.3 MB. Free memory was 174.9 MB in the beginning and 173.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 553.83 ms. Allocated memory is still 200.3 MB. Free memory was 173.1 MB in the beginning and 142.7 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 67781.99 ms. Allocated memory was 200.3 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 142.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 537.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 20 procedures, 139 locations, 1 error locations. SAFE Result, 67.7s OverallTime, 22 OverallIterations, 8 TraceHistogramMax, 36.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4992 SDtfs, 8833 SDslu, 15465 SDs, 0 SdLazy, 14388 SolverSat, 3210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3788 GetRequests, 3446 SyntacticMatches, 32 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2920 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19665occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 17.3s AbstIntTime, 9 AbstIntIterations, 2 AbstIntStrong, 0.9832011361273824 AbsIntWeakeningRatio, 0.751269035532995 AbsIntAvgWeakeningVarsNumRemoved, 21.411167512690355 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 11663 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 4763 NumberOfCodeBlocks, 4763 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 6360 ConstructedInterpolants, 0 QuantifiedInterpolants, 2220772 SizeOfPredicates, 10 NumberOfNonLiveVariables, 7630 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 36 InterpolantComputations, 18 PerfectInterpolantSequences, 4304/4589 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...