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/token_ring.13.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:37:12,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:37:12,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:37:12,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:37:12,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:37:12,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:37:12,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:37:12,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:37:12,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:37:12,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:37:12,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:37:12,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:37:12,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:37:12,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:37:12,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:37:12,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:37:12,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:37:12,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:37:12,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:37:12,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:37:12,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:37:12,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:37:12,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:37:12,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:37:12,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:37:12,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:37:12,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:37:12,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:37:12,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:37:12,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:37:12,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:37:12,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:37:12,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:37:12,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:37:12,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:37:12,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:37:12,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:37:12,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:37:12,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:37:12,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:37:12,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:37:12,216 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:37:12,231 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:37:12,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:37:12,231 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:37:12,231 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:37:12,232 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:37:12,232 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:37:12,232 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:37:12,233 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:37:12,233 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:37:12,233 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:37:12,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:37:12,234 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:37:12,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:37:12,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:37:12,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:37:12,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:37:12,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:37:12,235 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:37:12,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:37:12,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:37:12,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:37:12,236 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:37:12,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:37:12,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:37:12,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:37:12,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:37:12,237 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:37:12,237 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:37:12,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:37:12,237 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:37:12,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:37:12,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:37:12,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:37:12,282 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:37:12,282 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:37:12,283 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.13.cil-2.c [2019-09-10 03:37:12,342 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fad8ba79/8a1bb6b5ee6145009ad804be9c39bf73/FLAG78c3d460b [2019-09-10 03:37:12,831 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:37:12,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.13.cil-2.c [2019-09-10 03:37:12,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fad8ba79/8a1bb6b5ee6145009ad804be9c39bf73/FLAG78c3d460b [2019-09-10 03:37:13,170 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fad8ba79/8a1bb6b5ee6145009ad804be9c39bf73 [2019-09-10 03:37:13,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:37:13,180 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:37:13,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:37:13,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:37:13,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:37:13,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:37:13" (1/1) ... [2019-09-10 03:37:13,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@89f1d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:37:13, skipping insertion in model container [2019-09-10 03:37:13,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:37:13" (1/1) ... [2019-09-10 03:37:13,198 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:37:13,273 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:37:13,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:37:13,742 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:37:13,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:37:13,925 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:37:13,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:37:13 WrapperNode [2019-09-10 03:37:13,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:37:13,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:37:13,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:37:13,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:37:13,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:37:13" (1/1) ... [2019-09-10 03:37:13,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:37:13" (1/1) ... [2019-09-10 03:37:13,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:37:13" (1/1) ... [2019-09-10 03:37:13,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:37:13" (1/1) ... [2019-09-10 03:37:13,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:37:13" (1/1) ... [2019-09-10 03:37:14,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:37:13" (1/1) ... [2019-09-10 03:37:14,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:37:13" (1/1) ... [2019-09-10 03:37:14,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:37:14,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:37:14,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:37:14,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:37:14,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:37:13" (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:37:14,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:37:14,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:37:14,120 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:37:14,120 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-10 03:37:14,120 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-10 03:37:14,120 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-10 03:37:14,120 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-10 03:37:14,120 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-10 03:37:14,121 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-10 03:37:14,121 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-10 03:37:14,121 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-10 03:37:14,121 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-10 03:37:14,121 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-10 03:37:14,121 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-10 03:37:14,122 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit11 [2019-09-10 03:37:14,122 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit12 [2019-09-10 03:37:14,122 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit13 [2019-09-10 03:37:14,122 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-10 03:37:14,122 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-10 03:37:14,122 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-10 03:37:14,123 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-10 03:37:14,123 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-10 03:37:14,123 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-10 03:37:14,123 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-10 03:37:14,123 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-10 03:37:14,123 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-10 03:37:14,123 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-10 03:37:14,123 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-10 03:37:14,124 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit11_triggered [2019-09-10 03:37:14,124 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit12_triggered [2019-09-10 03:37:14,124 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit13_triggered [2019-09-10 03:37:14,124 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:37:14,124 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:37:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:37:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:37:14,127 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:37:14,127 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:37:14,127 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:37:14,127 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-10 03:37:14,127 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-10 03:37:14,127 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-10 03:37:14,127 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:37:14,128 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:37:14,128 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:37:14,128 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:37:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:37:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:37:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-10 03:37:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-10 03:37:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-10 03:37:14,130 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-10 03:37:14,130 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-10 03:37:14,130 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-10 03:37:14,130 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-10 03:37:14,130 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-10 03:37:14,130 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-10 03:37:14,130 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-10 03:37:14,130 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-10 03:37:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit11_triggered [2019-09-10 03:37:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit12_triggered [2019-09-10 03:37:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit13_triggered [2019-09-10 03:37:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-10 03:37:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:37:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-10 03:37:14,132 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-10 03:37:14,132 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-10 03:37:14,132 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-10 03:37:14,132 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-10 03:37:14,133 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-10 03:37:14,133 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-10 03:37:14,133 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-10 03:37:14,133 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-10 03:37:14,133 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-10 03:37:14,134 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-10 03:37:14,134 INFO L130 BoogieDeclarations]: Found specification of procedure transmit11 [2019-09-10 03:37:14,134 INFO L130 BoogieDeclarations]: Found specification of procedure transmit12 [2019-09-10 03:37:14,134 INFO L130 BoogieDeclarations]: Found specification of procedure transmit13 [2019-09-10 03:37:14,134 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:37:14,135 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:37:14,136 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:37:14,136 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:37:14,136 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:37:14,136 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:37:14,136 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:37:14,136 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-10 03:37:14,137 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-10 03:37:14,138 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:37:14,138 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:37:14,138 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:37:14,138 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:37:14,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:37:14,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:37:15,479 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:37:15,479 INFO L283 CfgBuilder]: Removed 16 assume(true) statements. [2019-09-10 03:37:15,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:37:15 BoogieIcfgContainer [2019-09-10 03:37:15,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:37:15,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:37:15,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:37:15,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:37:15,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:37:13" (1/3) ... [2019-09-10 03:37:15,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57643aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:37:15, skipping insertion in model container [2019-09-10 03:37:15,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:37:13" (2/3) ... [2019-09-10 03:37:15,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57643aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:37:15, skipping insertion in model container [2019-09-10 03:37:15,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:37:15" (3/3) ... [2019-09-10 03:37:15,493 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.13.cil-2.c [2019-09-10 03:37:15,503 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:37:15,529 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:37:15,548 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:37:15,581 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:37:15,581 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:37:15,582 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:37:15,582 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:37:15,582 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:37:15,582 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:37:15,582 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:37:15,583 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:37:15,626 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states. [2019-09-10 03:37:15,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:15,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:15,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:15,676 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:15,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:15,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1935396934, now seen corresponding path program 1 times [2019-09-10 03:37:15,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:15,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:15,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:15,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:15,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:16,288 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:37:16,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:16,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:37:16,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:16,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:37:16,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:37:16,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:37:16,315 INFO L87 Difference]: Start difference. First operand 504 states. Second operand 4 states. [2019-09-10 03:37:16,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:16,768 INFO L93 Difference]: Finished difference Result 502 states and 735 transitions. [2019-09-10 03:37:16,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:37:16,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-09-10 03:37:16,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:16,804 INFO L225 Difference]: With dead ends: 502 [2019-09-10 03:37:16,810 INFO L226 Difference]: Without dead ends: 495 [2019-09-10 03:37:16,813 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:37:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-10 03:37:16,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2019-09-10 03:37:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 728 transitions. [2019-09-10 03:37:16,941 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 728 transitions. Word has length 245 [2019-09-10 03:37:16,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:16,945 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 728 transitions. [2019-09-10 03:37:16,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:37:16,945 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 728 transitions. [2019-09-10 03:37:16,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:16,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:16,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:16,956 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:16,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:16,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1272610812, now seen corresponding path program 1 times [2019-09-10 03:37:16,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:16,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:16,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:16,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:16,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:17,261 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:37:17,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:17,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:37:17,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:17,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:37:17,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:37:17,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:37:17,265 INFO L87 Difference]: Start difference. First operand 495 states and 728 transitions. Second operand 4 states. [2019-09-10 03:37:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:17,575 INFO L93 Difference]: Finished difference Result 495 states and 727 transitions. [2019-09-10 03:37:17,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:37:17,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-09-10 03:37:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:17,579 INFO L225 Difference]: With dead ends: 495 [2019-09-10 03:37:17,580 INFO L226 Difference]: Without dead ends: 495 [2019-09-10 03:37:17,580 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:37:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-10 03:37:17,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2019-09-10 03:37:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 727 transitions. [2019-09-10 03:37:17,598 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 727 transitions. Word has length 245 [2019-09-10 03:37:17,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:17,598 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 727 transitions. [2019-09-10 03:37:17,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:37:17,599 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 727 transitions. [2019-09-10 03:37:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:17,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:17,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:17,602 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:17,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:17,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1329476158, now seen corresponding path program 1 times [2019-09-10 03:37:17,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:17,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:17,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:17,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:17,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:17,817 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:37:17,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:17,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:17,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:17,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:17,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:17,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:17,820 INFO L87 Difference]: Start difference. First operand 495 states and 727 transitions. Second operand 5 states. [2019-09-10 03:37:18,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:18,873 INFO L93 Difference]: Finished difference Result 569 states and 865 transitions. [2019-09-10 03:37:18,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:18,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:18,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:18,878 INFO L225 Difference]: With dead ends: 569 [2019-09-10 03:37:18,879 INFO L226 Difference]: Without dead ends: 569 [2019-09-10 03:37:18,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:18,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-10 03:37:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 495. [2019-09-10 03:37:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 726 transitions. [2019-09-10 03:37:18,900 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 726 transitions. Word has length 245 [2019-09-10 03:37:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:18,901 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 726 transitions. [2019-09-10 03:37:18,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 726 transitions. [2019-09-10 03:37:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:18,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:18,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:18,906 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:18,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:18,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1060310780, now seen corresponding path program 1 times [2019-09-10 03:37:18,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:18,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:18,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:18,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:18,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:19,060 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:37:19,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:19,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:19,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:19,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:19,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:19,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:19,062 INFO L87 Difference]: Start difference. First operand 495 states and 726 transitions. Second operand 5 states. [2019-09-10 03:37:20,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:20,127 INFO L93 Difference]: Finished difference Result 569 states and 865 transitions. [2019-09-10 03:37:20,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:20,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:20,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:20,132 INFO L225 Difference]: With dead ends: 569 [2019-09-10 03:37:20,132 INFO L226 Difference]: Without dead ends: 569 [2019-09-10 03:37:20,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:20,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-10 03:37:20,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 495. [2019-09-10 03:37:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 725 transitions. [2019-09-10 03:37:20,149 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 725 transitions. Word has length 245 [2019-09-10 03:37:20,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:20,150 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 725 transitions. [2019-09-10 03:37:20,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 725 transitions. [2019-09-10 03:37:20,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:20,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:20,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:20,154 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:20,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:20,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1190175358, now seen corresponding path program 1 times [2019-09-10 03:37:20,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:20,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:20,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:20,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:20,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:20,299 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:37:20,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:20,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:20,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:20,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:20,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:20,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:20,302 INFO L87 Difference]: Start difference. First operand 495 states and 725 transitions. Second operand 5 states. [2019-09-10 03:37:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:21,332 INFO L93 Difference]: Finished difference Result 567 states and 860 transitions. [2019-09-10 03:37:21,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:21,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:21,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:21,336 INFO L225 Difference]: With dead ends: 567 [2019-09-10 03:37:21,336 INFO L226 Difference]: Without dead ends: 567 [2019-09-10 03:37:21,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:21,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-10 03:37:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 495. [2019-09-10 03:37:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 724 transitions. [2019-09-10 03:37:21,353 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 724 transitions. Word has length 245 [2019-09-10 03:37:21,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:21,353 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 724 transitions. [2019-09-10 03:37:21,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:21,354 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 724 transitions. [2019-09-10 03:37:21,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:21,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:21,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:21,358 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:21,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:21,358 INFO L82 PathProgramCache]: Analyzing trace with hash -883845444, now seen corresponding path program 1 times [2019-09-10 03:37:21,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:21,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:21,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:21,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:21,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:21,505 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:37:21,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:21,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:21,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:21,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:21,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:21,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:21,507 INFO L87 Difference]: Start difference. First operand 495 states and 724 transitions. Second operand 5 states. [2019-09-10 03:37:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:22,460 INFO L93 Difference]: Finished difference Result 565 states and 855 transitions. [2019-09-10 03:37:22,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:22,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:22,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:22,464 INFO L225 Difference]: With dead ends: 565 [2019-09-10 03:37:22,464 INFO L226 Difference]: Without dead ends: 565 [2019-09-10 03:37:22,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-09-10 03:37:22,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 495. [2019-09-10 03:37:22,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:22,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 723 transitions. [2019-09-10 03:37:22,481 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 723 transitions. Word has length 245 [2019-09-10 03:37:22,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:22,483 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 723 transitions. [2019-09-10 03:37:22,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 723 transitions. [2019-09-10 03:37:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:22,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:22,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:22,487 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:22,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:22,487 INFO L82 PathProgramCache]: Analyzing trace with hash 2097291966, now seen corresponding path program 1 times [2019-09-10 03:37:22,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:22,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:22,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:22,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:22,717 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:37:22,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:22,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:22,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:22,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:22,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:22,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:22,720 INFO L87 Difference]: Start difference. First operand 495 states and 723 transitions. Second operand 5 states. [2019-09-10 03:37:23,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:23,807 INFO L93 Difference]: Finished difference Result 563 states and 850 transitions. [2019-09-10 03:37:23,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:23,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:23,813 INFO L225 Difference]: With dead ends: 563 [2019-09-10 03:37:23,813 INFO L226 Difference]: Without dead ends: 563 [2019-09-10 03:37:23,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-09-10 03:37:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 495. [2019-09-10 03:37:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 722 transitions. [2019-09-10 03:37:23,832 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 722 transitions. Word has length 245 [2019-09-10 03:37:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:23,833 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 722 transitions. [2019-09-10 03:37:23,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 722 transitions. [2019-09-10 03:37:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:23,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:23,838 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:23,838 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:23,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:23,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1223626364, now seen corresponding path program 1 times [2019-09-10 03:37:23,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:23,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:23,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:23,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:23,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:23,971 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:37:23,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:23,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:23,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:23,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:23,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:23,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:23,975 INFO L87 Difference]: Start difference. First operand 495 states and 722 transitions. Second operand 5 states. [2019-09-10 03:37:24,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:24,946 INFO L93 Difference]: Finished difference Result 561 states and 845 transitions. [2019-09-10 03:37:24,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:24,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:24,950 INFO L225 Difference]: With dead ends: 561 [2019-09-10 03:37:24,951 INFO L226 Difference]: Without dead ends: 561 [2019-09-10 03:37:24,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-09-10 03:37:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 495. [2019-09-10 03:37:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:24,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 721 transitions. [2019-09-10 03:37:24,968 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 721 transitions. Word has length 245 [2019-09-10 03:37:24,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:24,968 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 721 transitions. [2019-09-10 03:37:24,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 721 transitions. [2019-09-10 03:37:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:24,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:24,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:24,973 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:24,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash 502706942, now seen corresponding path program 1 times [2019-09-10 03:37:24,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:24,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:24,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:25,172 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:37:25,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:25,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:25,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:25,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:25,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:25,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:25,174 INFO L87 Difference]: Start difference. First operand 495 states and 721 transitions. Second operand 5 states. [2019-09-10 03:37:26,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:26,292 INFO L93 Difference]: Finished difference Result 557 states and 836 transitions. [2019-09-10 03:37:26,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:26,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:26,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:26,300 INFO L225 Difference]: With dead ends: 557 [2019-09-10 03:37:26,300 INFO L226 Difference]: Without dead ends: 557 [2019-09-10 03:37:26,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:26,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-09-10 03:37:26,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 495. [2019-09-10 03:37:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 720 transitions. [2019-09-10 03:37:26,343 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 720 transitions. Word has length 245 [2019-09-10 03:37:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:26,343 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 720 transitions. [2019-09-10 03:37:26,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:26,344 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 720 transitions. [2019-09-10 03:37:26,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:26,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:26,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:26,348 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:26,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:26,348 INFO L82 PathProgramCache]: Analyzing trace with hash -633237504, now seen corresponding path program 1 times [2019-09-10 03:37:26,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:26,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:26,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:26,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:26,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:26,554 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:37:26,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:26,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:26,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:26,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:26,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:26,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:26,557 INFO L87 Difference]: Start difference. First operand 495 states and 720 transitions. Second operand 5 states. [2019-09-10 03:37:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:27,545 INFO L93 Difference]: Finished difference Result 555 states and 831 transitions. [2019-09-10 03:37:27,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:27,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:27,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:27,551 INFO L225 Difference]: With dead ends: 555 [2019-09-10 03:37:27,551 INFO L226 Difference]: Without dead ends: 555 [2019-09-10 03:37:27,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:27,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-09-10 03:37:27,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 495. [2019-09-10 03:37:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 719 transitions. [2019-09-10 03:37:27,568 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 719 transitions. Word has length 245 [2019-09-10 03:37:27,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:27,568 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 719 transitions. [2019-09-10 03:37:27,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 719 transitions. [2019-09-10 03:37:27,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:27,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:27,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:27,571 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:27,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:27,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1501164866, now seen corresponding path program 1 times [2019-09-10 03:37:27,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:27,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:27,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:27,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:27,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:27,699 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:37:27,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:27,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:27,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:27,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:27,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:27,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:27,702 INFO L87 Difference]: Start difference. First operand 495 states and 719 transitions. Second operand 5 states. [2019-09-10 03:37:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:28,682 INFO L93 Difference]: Finished difference Result 553 states and 826 transitions. [2019-09-10 03:37:28,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:28,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:28,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:28,689 INFO L225 Difference]: With dead ends: 553 [2019-09-10 03:37:28,689 INFO L226 Difference]: Without dead ends: 553 [2019-09-10 03:37:28,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-09-10 03:37:28,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 495. [2019-09-10 03:37:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:28,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 718 transitions. [2019-09-10 03:37:28,718 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 718 transitions. Word has length 245 [2019-09-10 03:37:28,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:28,719 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 718 transitions. [2019-09-10 03:37:28,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 718 transitions. [2019-09-10 03:37:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:28,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:28,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:28,724 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:28,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:28,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1518878784, now seen corresponding path program 1 times [2019-09-10 03:37:28,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:28,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:28,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:28,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:28,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:28,934 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:37:28,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:28,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:28,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:28,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:28,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:28,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:28,937 INFO L87 Difference]: Start difference. First operand 495 states and 718 transitions. Second operand 5 states. [2019-09-10 03:37:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:29,905 INFO L93 Difference]: Finished difference Result 551 states and 821 transitions. [2019-09-10 03:37:29,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:29,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:29,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:29,914 INFO L225 Difference]: With dead ends: 551 [2019-09-10 03:37:29,914 INFO L226 Difference]: Without dead ends: 551 [2019-09-10 03:37:29,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:29,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-10 03:37:29,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 495. [2019-09-10 03:37:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 717 transitions. [2019-09-10 03:37:29,928 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 717 transitions. Word has length 245 [2019-09-10 03:37:29,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:29,928 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 717 transitions. [2019-09-10 03:37:29,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 717 transitions. [2019-09-10 03:37:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:29,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:29,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:29,931 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:29,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:29,931 INFO L82 PathProgramCache]: Analyzing trace with hash 646468222, now seen corresponding path program 1 times [2019-09-10 03:37:29,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:29,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:29,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:29,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:29,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:30,039 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:37:30,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:30,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:30,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:30,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:30,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:30,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:30,041 INFO L87 Difference]: Start difference. First operand 495 states and 717 transitions. Second operand 5 states. [2019-09-10 03:37:31,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:31,140 INFO L93 Difference]: Finished difference Result 549 states and 816 transitions. [2019-09-10 03:37:31,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:31,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:31,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:31,146 INFO L225 Difference]: With dead ends: 549 [2019-09-10 03:37:31,146 INFO L226 Difference]: Without dead ends: 549 [2019-09-10 03:37:31,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-09-10 03:37:31,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 495. [2019-09-10 03:37:31,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 716 transitions. [2019-09-10 03:37:31,170 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 716 transitions. Word has length 245 [2019-09-10 03:37:31,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:31,170 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 716 transitions. [2019-09-10 03:37:31,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 716 transitions. [2019-09-10 03:37:31,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:31,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:31,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:31,174 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:31,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:31,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1321336704, now seen corresponding path program 1 times [2019-09-10 03:37:31,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:31,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:31,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:31,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:31,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:31,369 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:37:31,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:31,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:31,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:31,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:31,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:31,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:31,372 INFO L87 Difference]: Start difference. First operand 495 states and 716 transitions. Second operand 5 states. [2019-09-10 03:37:32,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:32,561 INFO L93 Difference]: Finished difference Result 547 states and 811 transitions. [2019-09-10 03:37:32,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:32,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:32,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:32,566 INFO L225 Difference]: With dead ends: 547 [2019-09-10 03:37:32,566 INFO L226 Difference]: Without dead ends: 547 [2019-09-10 03:37:32,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:32,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-10 03:37:32,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 495. [2019-09-10 03:37:32,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 715 transitions. [2019-09-10 03:37:32,585 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 715 transitions. Word has length 245 [2019-09-10 03:37:32,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:32,585 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 715 transitions. [2019-09-10 03:37:32,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:32,586 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 715 transitions. [2019-09-10 03:37:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:32,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:32,588 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:32,588 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:32,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:32,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1107719618, now seen corresponding path program 1 times [2019-09-10 03:37:32,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:32,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:32,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:32,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:32,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:32,711 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:37:32,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:32,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:32,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:32,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:32,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:32,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:32,712 INFO L87 Difference]: Start difference. First operand 495 states and 715 transitions. Second operand 5 states. [2019-09-10 03:37:33,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:33,738 INFO L93 Difference]: Finished difference Result 545 states and 806 transitions. [2019-09-10 03:37:33,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:33,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:33,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:33,743 INFO L225 Difference]: With dead ends: 545 [2019-09-10 03:37:33,743 INFO L226 Difference]: Without dead ends: 545 [2019-09-10 03:37:33,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:33,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-09-10 03:37:33,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 495. [2019-09-10 03:37:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 714 transitions. [2019-09-10 03:37:33,763 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 714 transitions. Word has length 245 [2019-09-10 03:37:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:33,764 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 714 transitions. [2019-09-10 03:37:33,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 714 transitions. [2019-09-10 03:37:33,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:33,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:33,766 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:33,766 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:33,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:33,767 INFO L82 PathProgramCache]: Analyzing trace with hash -823734080, now seen corresponding path program 1 times [2019-09-10 03:37:33,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:33,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:33,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:33,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:33,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:33,966 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:37:33,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:33,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:33,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:33,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:33,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:33,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:33,971 INFO L87 Difference]: Start difference. First operand 495 states and 714 transitions. Second operand 5 states. [2019-09-10 03:37:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:35,319 INFO L93 Difference]: Finished difference Result 589 states and 890 transitions. [2019-09-10 03:37:35,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:35,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:35,325 INFO L225 Difference]: With dead ends: 589 [2019-09-10 03:37:35,325 INFO L226 Difference]: Without dead ends: 589 [2019-09-10 03:37:35,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-10 03:37:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 495. [2019-09-10 03:37:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 713 transitions. [2019-09-10 03:37:35,371 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 713 transitions. Word has length 245 [2019-09-10 03:37:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:35,371 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 713 transitions. [2019-09-10 03:37:35,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 713 transitions. [2019-09-10 03:37:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:35,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:35,375 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:35,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:35,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1746390978, now seen corresponding path program 1 times [2019-09-10 03:37:35,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:35,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:35,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:35,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:35,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:35,564 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:37:35,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:35,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:35,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:35,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:35,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:35,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:35,567 INFO L87 Difference]: Start difference. First operand 495 states and 713 transitions. Second operand 5 states. [2019-09-10 03:37:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:36,992 INFO L93 Difference]: Finished difference Result 591 states and 890 transitions. [2019-09-10 03:37:36,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:36,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:36,998 INFO L225 Difference]: With dead ends: 591 [2019-09-10 03:37:36,998 INFO L226 Difference]: Without dead ends: 591 [2019-09-10 03:37:36,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:37,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-10 03:37:37,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 495. [2019-09-10 03:37:37,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:37,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 712 transitions. [2019-09-10 03:37:37,020 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 712 transitions. Word has length 245 [2019-09-10 03:37:37,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:37,021 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 712 transitions. [2019-09-10 03:37:37,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:37,021 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 712 transitions. [2019-09-10 03:37:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:37,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:37,025 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:37,025 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:37,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:37,026 INFO L82 PathProgramCache]: Analyzing trace with hash -248911744, now seen corresponding path program 1 times [2019-09-10 03:37:37,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:37,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:37,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:37,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:37,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:37,227 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:37:37,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:37,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:37,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:37,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:37,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:37,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:37,229 INFO L87 Difference]: Start difference. First operand 495 states and 712 transitions. Second operand 5 states. [2019-09-10 03:37:38,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:38,195 INFO L93 Difference]: Finished difference Result 589 states and 885 transitions. [2019-09-10 03:37:38,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:38,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:38,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:38,200 INFO L225 Difference]: With dead ends: 589 [2019-09-10 03:37:38,201 INFO L226 Difference]: Without dead ends: 589 [2019-09-10 03:37:38,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-10 03:37:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 495. [2019-09-10 03:37:38,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 711 transitions. [2019-09-10 03:37:38,215 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 711 transitions. Word has length 245 [2019-09-10 03:37:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:38,215 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 711 transitions. [2019-09-10 03:37:38,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 711 transitions. [2019-09-10 03:37:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:38,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:38,217 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:38,218 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:38,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:38,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1764933634, now seen corresponding path program 1 times [2019-09-10 03:37:38,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:38,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:38,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:38,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:38,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:38,337 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:37:38,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:38,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:38,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:38,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:38,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:38,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:38,341 INFO L87 Difference]: Start difference. First operand 495 states and 711 transitions. Second operand 5 states. [2019-09-10 03:37:39,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:39,323 INFO L93 Difference]: Finished difference Result 587 states and 880 transitions. [2019-09-10 03:37:39,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:39,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:39,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:39,328 INFO L225 Difference]: With dead ends: 587 [2019-09-10 03:37:39,328 INFO L226 Difference]: Without dead ends: 587 [2019-09-10 03:37:39,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:39,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-10 03:37:39,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 495. [2019-09-10 03:37:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 710 transitions. [2019-09-10 03:37:39,343 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 710 transitions. Word has length 245 [2019-09-10 03:37:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:39,343 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 710 transitions. [2019-09-10 03:37:39,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 710 transitions. [2019-09-10 03:37:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:39,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:39,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:39,346 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:39,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:39,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1691349056, now seen corresponding path program 1 times [2019-09-10 03:37:39,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:39,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:39,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:39,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:39,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:39,450 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:37:39,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:39,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:39,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:39,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:39,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:39,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:39,452 INFO L87 Difference]: Start difference. First operand 495 states and 710 transitions. Second operand 5 states. [2019-09-10 03:37:40,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:40,446 INFO L93 Difference]: Finished difference Result 585 states and 875 transitions. [2019-09-10 03:37:40,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:40,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:40,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:40,450 INFO L225 Difference]: With dead ends: 585 [2019-09-10 03:37:40,450 INFO L226 Difference]: Without dead ends: 585 [2019-09-10 03:37:40,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:40,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-10 03:37:40,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 495. [2019-09-10 03:37:40,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 709 transitions. [2019-09-10 03:37:40,464 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 709 transitions. Word has length 245 [2019-09-10 03:37:40,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:40,464 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 709 transitions. [2019-09-10 03:37:40,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 709 transitions. [2019-09-10 03:37:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:40,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:40,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:40,466 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:40,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:40,467 INFO L82 PathProgramCache]: Analyzing trace with hash -389234622, now seen corresponding path program 1 times [2019-09-10 03:37:40,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:40,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:40,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:40,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:40,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:40,578 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:37:40,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:40,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:40,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:40,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:40,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:40,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:40,580 INFO L87 Difference]: Start difference. First operand 495 states and 709 transitions. Second operand 5 states. [2019-09-10 03:37:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:41,568 INFO L93 Difference]: Finished difference Result 583 states and 870 transitions. [2019-09-10 03:37:41,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:41,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:41,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:41,575 INFO L225 Difference]: With dead ends: 583 [2019-09-10 03:37:41,575 INFO L226 Difference]: Without dead ends: 583 [2019-09-10 03:37:41,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-10 03:37:41,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 495. [2019-09-10 03:37:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 708 transitions. [2019-09-10 03:37:41,597 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 708 transitions. Word has length 245 [2019-09-10 03:37:41,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:41,599 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 708 transitions. [2019-09-10 03:37:41,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:41,600 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 708 transitions. [2019-09-10 03:37:41,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:41,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:41,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:41,603 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:41,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:41,603 INFO L82 PathProgramCache]: Analyzing trace with hash 97839104, now seen corresponding path program 1 times [2019-09-10 03:37:41,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:41,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:41,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:41,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:41,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:41,728 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:37:41,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:41,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:41,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:41,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:41,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:41,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:41,730 INFO L87 Difference]: Start difference. First operand 495 states and 708 transitions. Second operand 5 states. [2019-09-10 03:37:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:42,671 INFO L93 Difference]: Finished difference Result 581 states and 865 transitions. [2019-09-10 03:37:42,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:42,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:42,678 INFO L225 Difference]: With dead ends: 581 [2019-09-10 03:37:42,678 INFO L226 Difference]: Without dead ends: 581 [2019-09-10 03:37:42,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-09-10 03:37:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 495. [2019-09-10 03:37:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 707 transitions. [2019-09-10 03:37:42,691 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 707 transitions. Word has length 245 [2019-09-10 03:37:42,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:42,692 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 707 transitions. [2019-09-10 03:37:42,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 707 transitions. [2019-09-10 03:37:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:42,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:42,694 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:42,694 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:42,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:42,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1687564158, now seen corresponding path program 1 times [2019-09-10 03:37:42,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:42,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:42,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:42,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:42,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:42,801 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:37:42,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:42,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:42,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:42,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:42,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:42,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:42,803 INFO L87 Difference]: Start difference. First operand 495 states and 707 transitions. Second operand 5 states. [2019-09-10 03:37:43,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:43,735 INFO L93 Difference]: Finished difference Result 577 states and 856 transitions. [2019-09-10 03:37:43,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:43,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:43,739 INFO L225 Difference]: With dead ends: 577 [2019-09-10 03:37:43,739 INFO L226 Difference]: Without dead ends: 577 [2019-09-10 03:37:43,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:43,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-10 03:37:43,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 495. [2019-09-10 03:37:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 706 transitions. [2019-09-10 03:37:43,752 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 706 transitions. Word has length 245 [2019-09-10 03:37:43,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:43,752 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 706 transitions. [2019-09-10 03:37:43,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 706 transitions. [2019-09-10 03:37:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:43,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:43,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:43,755 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:43,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:43,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1564282492, now seen corresponding path program 1 times [2019-09-10 03:37:43,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:43,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:43,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:43,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:43,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:43,874 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:37:43,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:43,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:43,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:43,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:43,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:43,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:43,878 INFO L87 Difference]: Start difference. First operand 495 states and 706 transitions. Second operand 5 states. [2019-09-10 03:37:44,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:44,782 INFO L93 Difference]: Finished difference Result 575 states and 851 transitions. [2019-09-10 03:37:44,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:44,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:44,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:44,786 INFO L225 Difference]: With dead ends: 575 [2019-09-10 03:37:44,786 INFO L226 Difference]: Without dead ends: 575 [2019-09-10 03:37:44,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:44,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-09-10 03:37:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 495. [2019-09-10 03:37:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 705 transitions. [2019-09-10 03:37:44,799 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 705 transitions. Word has length 245 [2019-09-10 03:37:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:44,799 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 705 transitions. [2019-09-10 03:37:44,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 705 transitions. [2019-09-10 03:37:44,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:44,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:44,801 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:44,801 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:44,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:44,802 INFO L82 PathProgramCache]: Analyzing trace with hash 656451650, now seen corresponding path program 1 times [2019-09-10 03:37:44,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:44,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:44,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:44,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:44,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:44,903 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:37:44,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:44,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:44,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:44,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:44,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:44,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:44,905 INFO L87 Difference]: Start difference. First operand 495 states and 705 transitions. Second operand 5 states. [2019-09-10 03:37:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:45,859 INFO L93 Difference]: Finished difference Result 573 states and 846 transitions. [2019-09-10 03:37:45,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:45,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:45,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:45,863 INFO L225 Difference]: With dead ends: 573 [2019-09-10 03:37:45,863 INFO L226 Difference]: Without dead ends: 573 [2019-09-10 03:37:45,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:45,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-09-10 03:37:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 495. [2019-09-10 03:37:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 704 transitions. [2019-09-10 03:37:45,877 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 704 transitions. Word has length 245 [2019-09-10 03:37:45,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:45,877 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 704 transitions. [2019-09-10 03:37:45,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 704 transitions. [2019-09-10 03:37:45,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:45,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:45,879 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:45,880 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:45,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:45,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1559372228, now seen corresponding path program 1 times [2019-09-10 03:37:45,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:45,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:45,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:45,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:45,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:45,992 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:37:45,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:45,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:45,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:45,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:45,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:45,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:45,994 INFO L87 Difference]: Start difference. First operand 495 states and 704 transitions. Second operand 5 states. [2019-09-10 03:37:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:46,959 INFO L93 Difference]: Finished difference Result 571 states and 841 transitions. [2019-09-10 03:37:46,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:46,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:46,963 INFO L225 Difference]: With dead ends: 571 [2019-09-10 03:37:46,963 INFO L226 Difference]: Without dead ends: 571 [2019-09-10 03:37:46,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:46,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-10 03:37:46,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 495. [2019-09-10 03:37:46,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 703 transitions. [2019-09-10 03:37:46,976 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 703 transitions. Word has length 245 [2019-09-10 03:37:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:46,977 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 703 transitions. [2019-09-10 03:37:46,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 703 transitions. [2019-09-10 03:37:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:46,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:46,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:46,979 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:46,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:46,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1311404034, now seen corresponding path program 1 times [2019-09-10 03:37:46,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:46,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:46,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:46,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:46,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:47,088 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:37:47,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:47,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:37:47,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:47,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:37:47,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:37:47,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:37:47,090 INFO L87 Difference]: Start difference. First operand 495 states and 703 transitions. Second operand 5 states. [2019-09-10 03:37:48,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:48,028 INFO L93 Difference]: Finished difference Result 569 states and 836 transitions. [2019-09-10 03:37:48,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:37:48,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 03:37:48,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:48,031 INFO L225 Difference]: With dead ends: 569 [2019-09-10 03:37:48,031 INFO L226 Difference]: Without dead ends: 569 [2019-09-10 03:37:48,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:37:48,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-10 03:37:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 495. [2019-09-10 03:37:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-10 03:37:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 702 transitions. [2019-09-10 03:37:48,047 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 702 transitions. Word has length 245 [2019-09-10 03:37:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:48,048 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 702 transitions. [2019-09-10 03:37:48,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:37:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 702 transitions. [2019-09-10 03:37:48,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:37:48,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:48,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:48,050 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:48,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:48,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1303405060, now seen corresponding path program 1 times [2019-09-10 03:37:48,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:48,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:48,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:48,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:48,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:48,154 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:37:48,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:37:48,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:37:48,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:48,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:37:48,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:37:48,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:37:48,156 INFO L87 Difference]: Start difference. First operand 495 states and 702 transitions. Second operand 4 states. [2019-09-10 03:37:48,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:48,619 INFO L93 Difference]: Finished difference Result 950 states and 1344 transitions. [2019-09-10 03:37:48,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:37:48,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-09-10 03:37:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:48,625 INFO L225 Difference]: With dead ends: 950 [2019-09-10 03:37:48,625 INFO L226 Difference]: Without dead ends: 950 [2019-09-10 03:37:48,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:37:48,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-09-10 03:37:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 949. [2019-09-10 03:37:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-09-10 03:37:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1343 transitions. [2019-09-10 03:37:48,650 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1343 transitions. Word has length 245 [2019-09-10 03:37:48,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:48,651 INFO L475 AbstractCegarLoop]: Abstraction has 949 states and 1343 transitions. [2019-09-10 03:37:48,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:37:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1343 transitions. [2019-09-10 03:37:48,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-10 03:37:48,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:48,655 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:48,655 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:48,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:48,656 INFO L82 PathProgramCache]: Analyzing trace with hash -584466167, now seen corresponding path program 1 times [2019-09-10 03:37:48,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:48,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:48,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:48,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:48,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 1 proven. 46 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-10 03:37:48,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:37:48,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:37:48,841 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 410 with the following transitions: [2019-09-10 03:37:48,845 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [742], [745], [750], [753], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [963], [964], [965], [968], [971], [979], [980], [983], [989], [995], [1001], [1009], [1013], [1019], [1025], [1031], [1037], [1043], [1049], [1057], [1061], [1067], [1073], [1079], [1085], [1091], [1097], [1105], [1109], [1115], [1121], [1127], [1133], [1139], [1145], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1249], [1250], [1251], [1254], [1257], [1265], [1266], [1269], [1271], [1274], [1285], [1287], [1289], [1293], [1301], [1304], [1305], [1306], [1316], [1318], [1320], [1321], [1322], [1331], [1334], [1337], [1343], [1346], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1469], [1482], [1495], [1508], [1521], [1527], [1537], [1539], [1541], [1542], [1543], [1553], [1555], [1557], [1558], [1559], [1560], [1574], [1576], [1696], [1697], [1716], [1717], [1718], [1722], [1723], [1724], [1725], [1726], [1727], [1728], [1729], [1730], [1731], [1732], [1733], [1734], [1735], [1736], [1737], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1754], [1755], [1756], [1758], [1759], [1760], [1761], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1818], [1819], [1820] [2019-09-10 03:37:48,921 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:37:48,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:37:49,160 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:37:49,161 INFO L272 AbstractInterpreter]: Visited 74 different actions 74 times. Never merged. Never widened. Performed 797 root evaluator evaluations with a maximum evaluation depth of 3. Performed 797 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:37:49,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:49,169 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:37:49,515 INFO L227 lantSequenceWeakener]: Weakened 72 states. On average, predicates are now at 67.51% of their original sizes. [2019-09-10 03:37:49,515 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:37:50,065 INFO L420 sIntCurrentIteration]: We unified 408 AI predicates to 408 [2019-09-10 03:37:50,065 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:37:50,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:37:50,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2019-09-10 03:37:50,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:50,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 03:37:50,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 03:37:50,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:37:50,069 INFO L87 Difference]: Start difference. First operand 949 states and 1343 transitions. Second operand 21 states. [2019-09-10 03:38:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:02,031 INFO L93 Difference]: Finished difference Result 1273 states and 1732 transitions. [2019-09-10 03:38:02,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 03:38:02,031 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 409 [2019-09-10 03:38:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:02,038 INFO L225 Difference]: With dead ends: 1273 [2019-09-10 03:38:02,038 INFO L226 Difference]: Without dead ends: 1273 [2019-09-10 03:38:02,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=378, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:38:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2019-09-10 03:38:02,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1243. [2019-09-10 03:38:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2019-09-10 03:38:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1701 transitions. [2019-09-10 03:38:02,067 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1701 transitions. Word has length 409 [2019-09-10 03:38:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:02,067 INFO L475 AbstractCegarLoop]: Abstraction has 1243 states and 1701 transitions. [2019-09-10 03:38:02,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 03:38:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1701 transitions. [2019-09-10 03:38:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-09-10 03:38:02,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:02,073 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:02,074 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:02,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:02,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1918060814, now seen corresponding path program 1 times [2019-09-10 03:38:02,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:02,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:02,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:02,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:02,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:02,306 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 1 proven. 43 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-09-10 03:38:02,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:38:02,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:38:02,307 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 440 with the following transitions: [2019-09-10 03:38:02,308 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [47], [63], [65], [73], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [750], [753], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1269], [1271], [1274], [1285], [1287], [1289], [1293], [1301], [1304], [1305], [1306], [1316], [1318], [1320], [1321], [1322], [1331], [1334], [1337], [1343], [1346], [1352], [1365], [1378], [1382], [1385], [1391], [1404], [1417], [1430], [1443], [1456], [1469], [1482], [1495], [1508], [1521], [1527], [1537], [1539], [1541], [1542], [1543], [1553], [1555], [1557], [1558], [1559], [1560], [1574], [1576], [1696], [1697], [1716], [1717], [1718], [1722], [1723], [1724], [1725], [1726], [1727], [1728], [1729], [1730], [1731], [1732], [1733], [1734], [1735], [1736], [1737], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1754], [1755], [1756], [1758], [1759], [1760], [1761], [1766], [1767], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1818], [1819], [1820] [2019-09-10 03:38:02,317 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:38:02,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:38:02,379 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:38:02,379 INFO L272 AbstractInterpreter]: Visited 85 different actions 85 times. Never merged. Never widened. Performed 877 root evaluator evaluations with a maximum evaluation depth of 4. Performed 877 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:38:02,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:02,380 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:38:02,558 INFO L227 lantSequenceWeakener]: Weakened 81 states. On average, predicates are now at 67.3% of their original sizes. [2019-09-10 03:38:02,558 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:38:03,380 INFO L420 sIntCurrentIteration]: We unified 438 AI predicates to 438 [2019-09-10 03:38:03,381 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:38:03,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:38:03,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [6] total 30 [2019-09-10 03:38:03,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:03,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 03:38:03,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 03:38:03,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2019-09-10 03:38:03,385 INFO L87 Difference]: Start difference. First operand 1243 states and 1701 transitions. Second operand 26 states. [2019-09-10 03:38:19,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:19,937 INFO L93 Difference]: Finished difference Result 1260 states and 1703 transitions. [2019-09-10 03:38:19,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:38:19,938 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 439 [2019-09-10 03:38:19,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:19,943 INFO L225 Difference]: With dead ends: 1260 [2019-09-10 03:38:19,943 INFO L226 Difference]: Without dead ends: 1260 [2019-09-10 03:38:19,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=357, Invalid=833, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 03:38:19,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-09-10 03:38:19,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1230. [2019-09-10 03:38:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-09-10 03:38:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1672 transitions. [2019-09-10 03:38:19,969 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1672 transitions. Word has length 439 [2019-09-10 03:38:19,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:19,969 INFO L475 AbstractCegarLoop]: Abstraction has 1230 states and 1672 transitions. [2019-09-10 03:38:19,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 03:38:19,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1672 transitions. [2019-09-10 03:38:19,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-09-10 03:38:19,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:19,975 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:19,975 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:19,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:19,976 INFO L82 PathProgramCache]: Analyzing trace with hash 628615954, now seen corresponding path program 1 times [2019-09-10 03:38:19,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:19,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:19,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:19,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:19,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 1 proven. 40 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-09-10 03:38:20,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:38:20,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:38:20,151 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 441 with the following transitions: [2019-09-10 03:38:20,151 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [47], [63], [65], [73], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1269], [1271], [1274], [1285], [1287], [1289], [1293], [1301], [1304], [1305], [1306], [1316], [1318], [1320], [1321], [1322], [1331], [1334], [1337], [1343], [1346], [1349], [1365], [1378], [1382], [1385], [1391], [1404], [1417], [1430], [1443], [1456], [1469], [1482], [1495], [1508], [1521], [1527], [1537], [1539], [1541], [1542], [1543], [1553], [1555], [1557], [1558], [1559], [1560], [1574], [1576], [1696], [1697], [1716], [1717], [1718], [1722], [1723], [1724], [1725], [1726], [1727], [1728], [1729], [1730], [1731], [1732], [1733], [1734], [1735], [1736], [1737], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1754], [1755], [1756], [1758], [1759], [1760], [1761], [1766], [1767], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1818], [1819], [1820] [2019-09-10 03:38:20,154 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:38:20,155 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:38:20,196 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:38:20,196 INFO L272 AbstractInterpreter]: Visited 95 different actions 95 times. Never merged. Never widened. Performed 956 root evaluator evaluations with a maximum evaluation depth of 4. Performed 956 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:38:20,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:20,196 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:38:20,322 INFO L227 lantSequenceWeakener]: Weakened 90 states. On average, predicates are now at 67% of their original sizes. [2019-09-10 03:38:20,323 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:38:21,346 INFO L420 sIntCurrentIteration]: We unified 439 AI predicates to 439 [2019-09-10 03:38:21,346 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:38:21,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:38:21,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [6] total 34 [2019-09-10 03:38:21,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:21,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 03:38:21,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 03:38:21,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2019-09-10 03:38:21,348 INFO L87 Difference]: Start difference. First operand 1230 states and 1672 transitions. Second operand 30 states. [2019-09-10 03:38:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:36,669 INFO L93 Difference]: Finished difference Result 1260 states and 1701 transitions. [2019-09-10 03:38:36,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 03:38:36,669 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 440 [2019-09-10 03:38:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:36,675 INFO L225 Difference]: With dead ends: 1260 [2019-09-10 03:38:36,675 INFO L226 Difference]: Without dead ends: 1260 [2019-09-10 03:38:36,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=468, Invalid=1424, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 03:38:36,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-09-10 03:38:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1230. [2019-09-10 03:38:36,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-09-10 03:38:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1670 transitions. [2019-09-10 03:38:36,704 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1670 transitions. Word has length 440 [2019-09-10 03:38:36,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:36,704 INFO L475 AbstractCegarLoop]: Abstraction has 1230 states and 1670 transitions. [2019-09-10 03:38:36,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 03:38:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1670 transitions. [2019-09-10 03:38:36,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-10 03:38:36,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:36,710 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:36,710 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:36,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:36,711 INFO L82 PathProgramCache]: Analyzing trace with hash -2126493023, now seen corresponding path program 1 times [2019-09-10 03:38:36,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:36,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:36,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:36,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:36,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 1 proven. 37 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-10 03:38:36,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:38:36,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:38:36,868 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 410 with the following transitions: [2019-09-10 03:38:36,868 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1269], [1271], [1274], [1285], [1287], [1289], [1293], [1301], [1304], [1305], [1306], [1316], [1318], [1320], [1321], [1322], [1331], [1334], [1337], [1343], [1346], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1469], [1482], [1495], [1508], [1521], [1527], [1537], [1539], [1541], [1542], [1543], [1553], [1555], [1557], [1558], [1559], [1560], [1574], [1576], [1696], [1697], [1716], [1717], [1718], [1722], [1723], [1724], [1725], [1726], [1727], [1728], [1729], [1730], [1731], [1732], [1733], [1734], [1735], [1736], [1737], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1754], [1755], [1756], [1758], [1759], [1760], [1761], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1818], [1819], [1820] [2019-09-10 03:38:36,872 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:38:36,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:38:36,979 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:38:36,980 INFO L272 AbstractInterpreter]: Visited 105 different actions 105 times. Never merged. Never widened. Performed 1035 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1035 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:38:36,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:36,981 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:38:37,169 INFO L227 lantSequenceWeakener]: Weakened 99 states. On average, predicates are now at 67.8% of their original sizes. [2019-09-10 03:38:37,169 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:38:38,391 INFO L420 sIntCurrentIteration]: We unified 408 AI predicates to 408 [2019-09-10 03:38:38,392 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:38:38,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:38:38,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [34] imperfect sequences [6] total 38 [2019-09-10 03:38:38,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:38,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 03:38:38,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 03:38:38,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 03:38:38,394 INFO L87 Difference]: Start difference. First operand 1230 states and 1670 transitions. Second operand 34 states. [2019-09-10 03:39:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:39:13,584 INFO L93 Difference]: Finished difference Result 1260 states and 1700 transitions. [2019-09-10 03:39:13,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 03:39:13,585 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 409 [2019-09-10 03:39:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:39:13,592 INFO L225 Difference]: With dead ends: 1260 [2019-09-10 03:39:13,593 INFO L226 Difference]: Without dead ends: 1260 [2019-09-10 03:39:13,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=573, Invalid=1977, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 03:39:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-09-10 03:39:13,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1230. [2019-09-10 03:39:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-09-10 03:39:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1669 transitions. [2019-09-10 03:39:13,619 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1669 transitions. Word has length 409 [2019-09-10 03:39:13,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:39:13,620 INFO L475 AbstractCegarLoop]: Abstraction has 1230 states and 1669 transitions. [2019-09-10 03:39:13,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 03:39:13,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1669 transitions. [2019-09-10 03:39:13,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-09-10 03:39:13,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:39:13,626 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:13,626 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:39:13,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:13,627 INFO L82 PathProgramCache]: Analyzing trace with hash -635341902, now seen corresponding path program 1 times [2019-09-10 03:39:13,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:39:13,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:13,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:39:13,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:13,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:39:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:39:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-10 03:39:13,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:39:13,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:39:13,832 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 441 with the following transitions: [2019-09-10 03:39:13,832 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1269], [1271], [1274], [1285], [1287], [1289], [1293], [1301], [1304], [1305], [1306], [1316], [1318], [1320], [1321], [1322], [1331], [1334], [1337], [1343], [1346], [1349], [1356], [1359], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1469], [1482], [1495], [1508], [1521], [1527], [1537], [1539], [1541], [1542], [1543], [1553], [1555], [1557], [1558], [1559], [1560], [1574], [1576], [1696], [1697], [1716], [1717], [1718], [1722], [1723], [1724], [1725], [1726], [1727], [1728], [1729], [1730], [1731], [1732], [1733], [1734], [1735], [1736], [1737], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1754], [1755], [1756], [1758], [1759], [1760], [1761], [1762], [1763], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1818], [1819], [1820] [2019-09-10 03:39:13,836 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:39:13,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:39:13,900 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:39:13,901 INFO L272 AbstractInterpreter]: Visited 115 different actions 115 times. Never merged. Never widened. Performed 1114 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1114 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:39:13,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:13,902 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:39:14,069 INFO L227 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 66.26% of their original sizes. [2019-09-10 03:39:14,070 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:39:15,755 INFO L420 sIntCurrentIteration]: We unified 439 AI predicates to 439 [2019-09-10 03:39:15,756 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:39:15,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:39:15,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [6] total 42 [2019-09-10 03:39:15,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:39:15,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 03:39:15,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 03:39:15,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 03:39:15,758 INFO L87 Difference]: Start difference. First operand 1230 states and 1669 transitions. Second operand 38 states. [2019-09-10 03:39:59,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:39:59,373 INFO L93 Difference]: Finished difference Result 1260 states and 1697 transitions. [2019-09-10 03:39:59,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 03:39:59,374 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 440 [2019-09-10 03:39:59,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:39:59,379 INFO L225 Difference]: With dead ends: 1260 [2019-09-10 03:39:59,379 INFO L226 Difference]: Without dead ends: 1260 [2019-09-10 03:39:59,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=735, Invalid=3047, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 03:39:59,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-09-10 03:39:59,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1230. [2019-09-10 03:39:59,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-09-10 03:39:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1666 transitions. [2019-09-10 03:39:59,405 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1666 transitions. Word has length 440 [2019-09-10 03:39:59,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:39:59,406 INFO L475 AbstractCegarLoop]: Abstraction has 1230 states and 1666 transitions. [2019-09-10 03:39:59,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 03:39:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1666 transitions. [2019-09-10 03:39:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-09-10 03:39:59,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:39:59,412 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:59,413 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:39:59,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1664513740, now seen corresponding path program 1 times [2019-09-10 03:39:59,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:39:59,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:59,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:39:59,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:59,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:39:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:39:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-09-10 03:39:59,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:39:59,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:39:59,675 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 441 with the following transitions: [2019-09-10 03:39:59,676 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1269], [1271], [1274], [1285], [1287], [1289], [1293], [1301], [1304], [1305], [1306], [1316], [1318], [1320], [1321], [1322], [1331], [1334], [1337], [1343], [1346], [1349], [1356], [1359], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1469], [1482], [1495], [1508], [1521], [1527], [1537], [1539], [1541], [1542], [1543], [1553], [1555], [1557], [1558], [1559], [1560], [1574], [1576], [1696], [1697], [1716], [1717], [1718], [1722], [1723], [1724], [1725], [1726], [1727], [1728], [1729], [1730], [1731], [1732], [1733], [1734], [1735], [1736], [1737], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1754], [1755], [1756], [1758], [1759], [1760], [1761], [1762], [1763], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1818], [1819], [1820] [2019-09-10 03:39:59,681 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:39:59,681 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:39:59,796 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:39:59,797 INFO L272 AbstractInterpreter]: Visited 125 different actions 125 times. Never merged. Never widened. Performed 1193 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1193 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:39:59,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:59,797 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:40:00,081 INFO L227 lantSequenceWeakener]: Weakened 117 states. On average, predicates are now at 65.83% of their original sizes. [2019-09-10 03:40:00,081 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:40:02,295 INFO L420 sIntCurrentIteration]: We unified 439 AI predicates to 439 [2019-09-10 03:40:02,296 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:40:02,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:40:02,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [6] total 46 [2019-09-10 03:40:02,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:40:02,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-10 03:40:02,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-10 03:40:02,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1533, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 03:40:02,298 INFO L87 Difference]: Start difference. First operand 1230 states and 1666 transitions. Second operand 42 states. [2019-09-10 03:40:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:40:50,482 INFO L93 Difference]: Finished difference Result 1260 states and 1695 transitions. [2019-09-10 03:40:50,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 03:40:50,483 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 440 [2019-09-10 03:40:50,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:40:50,487 INFO L225 Difference]: With dead ends: 1260 [2019-09-10 03:40:50,487 INFO L226 Difference]: Without dead ends: 1260 [2019-09-10 03:40:50,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=891, Invalid=4079, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 03:40:50,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-09-10 03:40:50,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1230. [2019-09-10 03:40:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-09-10 03:40:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1664 transitions. [2019-09-10 03:40:50,513 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1664 transitions. Word has length 440 [2019-09-10 03:40:50,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:40:50,514 INFO L475 AbstractCegarLoop]: Abstraction has 1230 states and 1664 transitions. [2019-09-10 03:40:50,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-10 03:40:50,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1664 transitions. [2019-09-10 03:40:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-10 03:40:50,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:40:50,519 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:50,519 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:40:50,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:50,520 INFO L82 PathProgramCache]: Analyzing trace with hash -15482909, now seen corresponding path program 1 times [2019-09-10 03:40:50,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:40:50,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:50,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:40:50,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:50,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:40:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:40:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-10 03:40:50,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:40:50,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:40:50,700 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 410 with the following transitions: [2019-09-10 03:40:50,701 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1269], [1271], [1274], [1285], [1287], [1289], [1293], [1301], [1304], [1305], [1306], [1316], [1318], [1320], [1321], [1322], [1331], [1334], [1337], [1343], [1346], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1469], [1482], [1495], [1508], [1521], [1527], [1537], [1539], [1541], [1542], [1543], [1553], [1555], [1557], [1558], [1559], [1560], [1574], [1576], [1696], [1697], [1716], [1717], [1718], [1722], [1723], [1724], [1725], [1726], [1727], [1728], [1729], [1730], [1731], [1732], [1733], [1734], [1735], [1736], [1737], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1754], [1755], [1756], [1758], [1759], [1760], [1761], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1818], [1819], [1820] [2019-09-10 03:40:50,705 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:40:50,705 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:40:50,782 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:40:50,782 INFO L272 AbstractInterpreter]: Visited 136 different actions 136 times. Never merged. Never widened. Performed 1273 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1273 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:40:50,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:50,783 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:40:50,937 INFO L227 lantSequenceWeakener]: Weakened 126 states. On average, predicates are now at 68.33% of their original sizes. [2019-09-10 03:40:50,937 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:40:53,183 INFO L420 sIntCurrentIteration]: We unified 408 AI predicates to 408 [2019-09-10 03:40:53,185 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:40:53,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:40:53,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [6] total 50 [2019-09-10 03:40:53,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:40:53,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 03:40:53,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 03:40:53,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1819, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 03:40:53,188 INFO L87 Difference]: Start difference. First operand 1230 states and 1664 transitions. Second operand 46 states. [2019-09-10 03:41:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:41:30,882 INFO L93 Difference]: Finished difference Result 1260 states and 1694 transitions. [2019-09-10 03:41:30,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 03:41:30,882 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 409 [2019-09-10 03:41:30,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:41:30,886 INFO L225 Difference]: With dead ends: 1260 [2019-09-10 03:41:30,886 INFO L226 Difference]: Without dead ends: 1260 [2019-09-10 03:41:30,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=927, Invalid=4623, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 03:41:30,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-09-10 03:41:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1230. [2019-09-10 03:41:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-09-10 03:41:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1663 transitions. [2019-09-10 03:41:30,912 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1663 transitions. Word has length 409 [2019-09-10 03:41:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:41:30,912 INFO L475 AbstractCegarLoop]: Abstraction has 1230 states and 1663 transitions. [2019-09-10 03:41:30,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 03:41:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1663 transitions. [2019-09-10 03:41:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-09-10 03:41:30,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:41:30,918 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:30,918 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:41:30,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:41:30,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1282888844, now seen corresponding path program 1 times [2019-09-10 03:41:30,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:41:30,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:41:30,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:41:30,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:41:30,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:41:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:41:31,076 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-10 03:41:31,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:41:31,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:41:31,076 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 441 with the following transitions: [2019-09-10 03:41:31,077 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1269], [1271], [1274], [1285], [1287], [1289], [1293], [1301], [1304], [1305], [1306], [1316], [1318], [1320], [1321], [1322], [1331], [1334], [1337], [1343], [1346], [1349], [1356], [1359], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1469], [1482], [1495], [1508], [1521], [1527], [1537], [1539], [1541], [1542], [1543], [1553], [1555], [1557], [1558], [1559], [1560], [1574], [1576], [1696], [1697], [1716], [1717], [1718], [1722], [1723], [1724], [1725], [1726], [1727], [1728], [1729], [1730], [1731], [1732], [1733], [1734], [1735], [1736], [1737], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1754], [1755], [1756], [1758], [1759], [1760], [1761], [1762], [1763], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1818], [1819], [1820] [2019-09-10 03:41:31,080 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:41:31,080 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:41:31,133 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:41:31,134 INFO L272 AbstractInterpreter]: Visited 147 different actions 147 times. Never merged. Never widened. Performed 1353 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1353 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:41:31,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:41:31,134 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:41:31,304 INFO L227 lantSequenceWeakener]: Weakened 135 states. On average, predicates are now at 64.9% of their original sizes. [2019-09-10 03:41:31,304 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:41:34,538 INFO L420 sIntCurrentIteration]: We unified 439 AI predicates to 439 [2019-09-10 03:41:34,538 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:41:34,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:41:34,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [6] total 54 [2019-09-10 03:41:34,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:41:34,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 03:41:34,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 03:41:34,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2246, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 03:41:34,540 INFO L87 Difference]: Start difference. First operand 1230 states and 1663 transitions. Second operand 50 states. [2019-09-10 03:42:19,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:42:19,635 INFO L93 Difference]: Finished difference Result 1260 states and 1691 transitions. [2019-09-10 03:42:19,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 03:42:19,635 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 440 [2019-09-10 03:42:19,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:42:19,640 INFO L225 Difference]: With dead ends: 1260 [2019-09-10 03:42:19,640 INFO L226 Difference]: Without dead ends: 1260 [2019-09-10 03:42:19,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1248, Invalid=6584, Unknown=0, NotChecked=0, Total=7832 [2019-09-10 03:42:19,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-09-10 03:42:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1230. [2019-09-10 03:42:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-09-10 03:42:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1660 transitions. [2019-09-10 03:42:19,664 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1660 transitions. Word has length 440 [2019-09-10 03:42:19,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:42:19,665 INFO L475 AbstractCegarLoop]: Abstraction has 1230 states and 1660 transitions. [2019-09-10 03:42:19,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 03:42:19,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1660 transitions. [2019-09-10 03:42:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-09-10 03:42:19,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:19,670 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:19,671 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:19,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:19,671 INFO L82 PathProgramCache]: Analyzing trace with hash 103427890, now seen corresponding path program 1 times [2019-09-10 03:42:19,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:19,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:19,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:19,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:19,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:19,857 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-10 03:42:19,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:42:19,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:42:19,858 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 441 with the following transitions: [2019-09-10 03:42:19,858 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1269], [1271], [1274], [1285], [1287], [1289], [1293], [1301], [1304], [1305], [1306], [1316], [1318], [1320], [1321], [1322], [1331], [1334], [1337], [1343], [1346], [1349], [1356], [1359], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1469], [1482], [1495], [1508], [1521], [1527], [1537], [1539], [1541], [1542], [1543], [1553], [1555], [1557], [1558], [1559], [1560], [1574], [1576], [1696], [1697], [1716], [1717], [1718], [1722], [1723], [1724], [1725], [1726], [1727], [1728], [1729], [1730], [1731], [1732], [1733], [1734], [1735], [1736], [1737], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1754], [1755], [1756], [1758], [1759], [1760], [1761], [1762], [1763], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1818], [1819], [1820] [2019-09-10 03:42:19,862 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:42:19,862 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:42:19,974 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:42:19,974 INFO L272 AbstractInterpreter]: Visited 158 different actions 158 times. Never merged. Never widened. Performed 1433 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1433 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:42:19,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:19,975 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:42:20,183 INFO L227 lantSequenceWeakener]: Weakened 144 states. On average, predicates are now at 64.41% of their original sizes. [2019-09-10 03:42:20,184 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:42:24,012 INFO L420 sIntCurrentIteration]: We unified 439 AI predicates to 439 [2019-09-10 03:42:24,012 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:42:24,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:42:24,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [6] total 58 [2019-09-10 03:42:24,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:42:24,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 03:42:24,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 03:42:24,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2649, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 03:42:24,015 INFO L87 Difference]: Start difference. First operand 1230 states and 1660 transitions. Second operand 54 states. [2019-09-10 03:43:11,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:43:11,441 INFO L93 Difference]: Finished difference Result 1260 states and 1689 transitions. [2019-09-10 03:43:11,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 03:43:11,442 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 440 [2019-09-10 03:43:11,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:43:11,446 INFO L225 Difference]: With dead ends: 1260 [2019-09-10 03:43:11,446 INFO L226 Difference]: Without dead ends: 1260 [2019-09-10 03:43:11,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1528 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1449, Invalid=8057, Unknown=0, NotChecked=0, Total=9506 [2019-09-10 03:43:11,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-09-10 03:43:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1230. [2019-09-10 03:43:11,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-09-10 03:43:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1658 transitions. [2019-09-10 03:43:11,471 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1658 transitions. Word has length 440 [2019-09-10 03:43:11,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:43:11,472 INFO L475 AbstractCegarLoop]: Abstraction has 1230 states and 1658 transitions. [2019-09-10 03:43:11,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-10 03:43:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1658 transitions. [2019-09-10 03:43:11,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-10 03:43:11,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:43:11,477 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:11,477 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:43:11,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:43:11,478 INFO L82 PathProgramCache]: Analyzing trace with hash 325106657, now seen corresponding path program 1 times [2019-09-10 03:43:11,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:43:11,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:43:11,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:43:11,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:43:11,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:43:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:43:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-10 03:43:11,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:43:11,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:43:11,630 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 410 with the following transitions: [2019-09-10 03:43:11,630 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1269], [1271], [1274], [1285], [1287], [1289], [1293], [1301], [1304], [1305], [1306], [1316], [1318], [1320], [1321], [1322], [1331], [1334], [1337], [1343], [1346], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1469], [1482], [1495], [1508], [1521], [1527], [1537], [1539], [1541], [1542], [1543], [1553], [1555], [1557], [1558], [1559], [1560], [1574], [1576], [1696], [1697], [1716], [1717], [1718], [1722], [1723], [1724], [1725], [1726], [1727], [1728], [1729], [1730], [1731], [1732], [1733], [1734], [1735], [1736], [1737], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1754], [1755], [1756], [1758], [1759], [1760], [1761], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1818], [1819], [1820] [2019-09-10 03:43:11,633 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:43:11,633 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:43:11,697 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:43:11,697 INFO L272 AbstractInterpreter]: Visited 168 different actions 168 times. Never merged. Never widened. Performed 1512 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1512 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:43:11,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:43:11,697 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:43:11,861 INFO L227 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 68.7% of their original sizes. [2019-09-10 03:43:11,861 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:43:15,406 INFO L420 sIntCurrentIteration]: We unified 408 AI predicates to 408 [2019-09-10 03:43:15,406 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:43:15,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:43:15,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [58] imperfect sequences [6] total 62 [2019-09-10 03:43:15,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:43:15,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-10 03:43:15,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-10 03:43:15,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=3007, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 03:43:15,409 INFO L87 Difference]: Start difference. First operand 1230 states and 1658 transitions. Second operand 58 states. [2019-09-10 03:44:12,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:44:12,197 INFO L93 Difference]: Finished difference Result 1260 states and 1688 transitions. [2019-09-10 03:44:12,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 03:44:12,198 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 409 [2019-09-10 03:44:12,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:44:12,202 INFO L225 Difference]: With dead ends: 1260 [2019-09-10 03:44:12,202 INFO L226 Difference]: Without dead ends: 1260 [2019-09-10 03:44:12,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1317, Invalid=8385, Unknown=0, NotChecked=0, Total=9702 [2019-09-10 03:44:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-09-10 03:44:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1230. [2019-09-10 03:44:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-09-10 03:44:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1657 transitions. [2019-09-10 03:44:12,224 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1657 transitions. Word has length 409 [2019-09-10 03:44:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:44:12,225 INFO L475 AbstractCegarLoop]: Abstraction has 1230 states and 1657 transitions. [2019-09-10 03:44:12,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-10 03:44:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1657 transitions. [2019-09-10 03:44:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-10 03:44:12,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:44:12,230 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:12,230 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:44:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:44:12,231 INFO L82 PathProgramCache]: Analyzing trace with hash 149984355, now seen corresponding path program 1 times [2019-09-10 03:44:12,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:44:12,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:44:12,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:44:12,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:44:12,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:44:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:44:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-10 03:44:12,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:44:12,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:44:12,384 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 410 with the following transitions: [2019-09-10 03:44:12,384 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [811], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1269], [1271], [1274], [1285], [1287], [1289], [1293], [1301], [1304], [1305], [1306], [1316], [1318], [1320], [1321], [1322], [1331], [1334], [1337], [1343], [1346], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1469], [1482], [1495], [1508], [1521], [1527], [1537], [1539], [1541], [1542], [1543], [1553], [1555], [1557], [1558], [1559], [1560], [1574], [1576], [1696], [1697], [1716], [1717], [1718], [1722], [1723], [1724], [1725], [1726], [1727], [1728], [1729], [1730], [1731], [1732], [1733], [1734], [1735], [1736], [1737], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1754], [1755], [1756], [1758], [1759], [1760], [1761], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1818], [1819], [1820] [2019-09-10 03:44:12,387 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:44:12,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:44:12,466 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:44:12,467 INFO L272 AbstractInterpreter]: Visited 178 different actions 178 times. Never merged. Never widened. Performed 1591 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1591 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:44:12,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:44:12,467 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:44:12,611 INFO L227 lantSequenceWeakener]: Weakened 162 states. On average, predicates are now at 68.81% of their original sizes. [2019-09-10 03:44:12,611 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:44:16,771 INFO L420 sIntCurrentIteration]: We unified 408 AI predicates to 408 [2019-09-10 03:44:16,771 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:44:16,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:44:16,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [62] imperfect sequences [6] total 66 [2019-09-10 03:44:16,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:44:16,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 03:44:16,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 03:44:16,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=3467, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 03:44:16,774 INFO L87 Difference]: Start difference. First operand 1230 states and 1657 transitions. Second operand 62 states. [2019-09-10 03:45:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:45:17,552 INFO L93 Difference]: Finished difference Result 1260 states and 1687 transitions. [2019-09-10 03:45:17,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 03:45:17,553 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 409 [2019-09-10 03:45:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:45:17,556 INFO L225 Difference]: With dead ends: 1260 [2019-09-10 03:45:17,556 INFO L226 Difference]: Without dead ends: 1260 [2019-09-10 03:45:17,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1397 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1455, Invalid=9887, Unknown=0, NotChecked=0, Total=11342 [2019-09-10 03:45:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-09-10 03:45:17,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1230. [2019-09-10 03:45:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-09-10 03:45:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1656 transitions. [2019-09-10 03:45:17,574 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1656 transitions. Word has length 409 [2019-09-10 03:45:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:45:17,575 INFO L475 AbstractCegarLoop]: Abstraction has 1230 states and 1656 transitions. [2019-09-10 03:45:17,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 03:45:17,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1656 transitions. [2019-09-10 03:45:17,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-09-10 03:45:17,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:45:17,580 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:17,580 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:45:17,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:45:17,581 INFO L82 PathProgramCache]: Analyzing trace with hash -602202124, now seen corresponding path program 1 times [2019-09-10 03:45:17,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:45:17,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:45:17,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:45:17,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:45:17,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:45:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:45:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-09-10 03:45:17,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:45:17,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:45:17,751 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 441 with the following transitions: [2019-09-10 03:45:17,752 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [811], [814], [817], [819], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1269], [1271], [1274], [1285], [1287], [1289], [1293], [1301], [1304], [1305], [1306], [1316], [1318], [1320], [1321], [1322], [1331], [1334], [1337], [1343], [1346], [1349], [1356], [1359], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1469], [1482], [1495], [1508], [1521], [1527], [1537], [1539], [1541], [1542], [1543], [1553], [1555], [1557], [1558], [1559], [1560], [1574], [1576], [1696], [1697], [1716], [1717], [1718], [1722], [1723], [1724], [1725], [1726], [1727], [1728], [1729], [1730], [1731], [1732], [1733], [1734], [1735], [1736], [1737], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1754], [1755], [1756], [1758], [1759], [1760], [1761], [1762], [1763], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1818], [1819], [1820] [2019-09-10 03:45:17,755 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:45:17,755 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:45:17,859 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:45:17,859 INFO L272 AbstractInterpreter]: Visited 189 different actions 189 times. Never merged. Never widened. Performed 1671 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1671 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:45:17,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:45:17,860 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:45:18,047 INFO L227 lantSequenceWeakener]: Weakened 171 states. On average, predicates are now at 62.87% of their original sizes. [2019-09-10 03:45:18,047 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:45:24,415 INFO L420 sIntCurrentIteration]: We unified 439 AI predicates to 439 [2019-09-10 03:45:24,415 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:45:24,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:45:24,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [6] total 70 [2019-09-10 03:45:24,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:45:24,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-10 03:45:24,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-10 03:45:24,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4044, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 03:45:24,417 INFO L87 Difference]: Start difference. First operand 1230 states and 1656 transitions. Second operand 66 states. [2019-09-10 03:46:48,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:48,086 INFO L93 Difference]: Finished difference Result 1260 states and 1683 transitions. [2019-09-10 03:46:48,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-10 03:46:48,087 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 440 [2019-09-10 03:46:48,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:48,090 INFO L225 Difference]: With dead ends: 1260 [2019-09-10 03:46:48,090 INFO L226 Difference]: Without dead ends: 1260 [2019-09-10 03:46:48,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2578 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=2142, Invalid=13358, Unknown=0, NotChecked=0, Total=15500 [2019-09-10 03:46:48,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-09-10 03:46:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1230. [2019-09-10 03:46:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-09-10 03:46:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1652 transitions. [2019-09-10 03:46:48,106 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1652 transitions. Word has length 440 [2019-09-10 03:46:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:48,106 INFO L475 AbstractCegarLoop]: Abstraction has 1230 states and 1652 transitions. [2019-09-10 03:46:48,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-10 03:46:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1652 transitions. [2019-09-10 03:46:48,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-10 03:46:48,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:48,112 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:48,113 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:48,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:48,113 INFO L82 PathProgramCache]: Analyzing trace with hash -489482589, now seen corresponding path program 1 times [2019-09-10 03:46:48,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:48,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:48,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:48,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:48,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-09-10 03:46:48,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:46:48,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:46:48,249 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 410 with the following transitions: [2019-09-10 03:46:48,249 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [811], [814], [817], [819], [822], [825], [827], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1269], [1271], [1274], [1285], [1287], [1289], [1293], [1301], [1304], [1305], [1306], [1316], [1318], [1320], [1321], [1322], [1331], [1334], [1337], [1343], [1346], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1469], [1482], [1495], [1508], [1521], [1527], [1537], [1539], [1541], [1542], [1543], [1553], [1555], [1557], [1558], [1559], [1560], [1574], [1576], [1696], [1697], [1716], [1717], [1718], [1722], [1723], [1724], [1725], [1726], [1727], [1728], [1729], [1730], [1731], [1732], [1733], [1734], [1735], [1736], [1737], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1754], [1755], [1756], [1758], [1759], [1760], [1761], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1818], [1819], [1820] [2019-09-10 03:46:48,253 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:46:48,253 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:46:48,348 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:46:48,349 INFO L272 AbstractInterpreter]: Visited 200 different actions 200 times. Never merged. Never widened. Performed 1751 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1751 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:46:48,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:48,349 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:46:48,524 INFO L227 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 68.99% of their original sizes. [2019-09-10 03:46:48,525 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:46:53,760 INFO L420 sIntCurrentIteration]: We unified 408 AI predicates to 408 [2019-09-10 03:46:53,760 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:46:53,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:46:53,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [70] imperfect sequences [6] total 74 [2019-09-10 03:46:53,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:53,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-10 03:46:53,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-10 03:46:53,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=4483, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 03:46:53,763 INFO L87 Difference]: Start difference. First operand 1230 states and 1652 transitions. Second operand 70 states. [2019-09-10 03:48:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:08,600 INFO L93 Difference]: Finished difference Result 1260 states and 1682 transitions. [2019-09-10 03:48:08,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-10 03:48:08,601 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 409 [2019-09-10 03:48:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:08,605 INFO L225 Difference]: With dead ends: 1260 [2019-09-10 03:48:08,605 INFO L226 Difference]: Without dead ends: 1260 [2019-09-10 03:48:08,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1743, Invalid=13263, Unknown=0, NotChecked=0, Total=15006 [2019-09-10 03:48:08,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-09-10 03:48:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1230. [2019-09-10 03:48:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-09-10 03:48:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1651 transitions. [2019-09-10 03:48:08,624 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1651 transitions. Word has length 409 [2019-09-10 03:48:08,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:08,625 INFO L475 AbstractCegarLoop]: Abstraction has 1230 states and 1651 transitions. [2019-09-10 03:48:08,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-10 03:48:08,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1651 transitions. [2019-09-10 03:48:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-09-10 03:48:08,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:08,630 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:08,630 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:08,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:08,631 INFO L82 PathProgramCache]: Analyzing trace with hash -55152076, now seen corresponding path program 1 times [2019-09-10 03:48:08,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:08,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:08,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:08,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:08,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-09-10 03:48:08,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:48:08,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:48:08,775 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 441 with the following transitions: [2019-09-10 03:48:08,775 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [811], [814], [817], [819], [822], [825], [827], [830], [833], [835], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1269], [1271], [1274], [1285], [1287], [1289], [1293], [1301], [1304], [1305], [1306], [1316], [1318], [1320], [1321], [1322], [1331], [1334], [1337], [1343], [1346], [1349], [1356], [1359], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1469], [1482], [1495], [1508], [1521], [1527], [1537], [1539], [1541], [1542], [1543], [1553], [1555], [1557], [1558], [1559], [1560], [1574], [1576], [1696], [1697], [1716], [1717], [1718], [1722], [1723], [1724], [1725], [1726], [1727], [1728], [1729], [1730], [1731], [1732], [1733], [1734], [1735], [1736], [1737], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1754], [1755], [1756], [1758], [1759], [1760], [1761], [1762], [1763], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1818], [1819], [1820] [2019-09-10 03:48:08,778 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:48:08,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:48:08,852 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:48:08,852 INFO L272 AbstractInterpreter]: Visited 210 different actions 210 times. Never merged. Never widened. Performed 1830 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1830 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:48:08,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:08,853 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:48:09,059 INFO L227 lantSequenceWeakener]: Weakened 189 states. On average, predicates are now at 61.8% of their original sizes. [2019-09-10 03:48:09,060 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:48:17,503 INFO L420 sIntCurrentIteration]: We unified 439 AI predicates to 439 [2019-09-10 03:48:17,504 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:48:17,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:48:17,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [74] imperfect sequences [6] total 78 [2019-09-10 03:48:17,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:17,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-10 03:48:17,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-10 03:48:17,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=5129, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 03:48:17,505 INFO L87 Difference]: Start difference. First operand 1230 states and 1651 transitions. Second operand 74 states. [2019-09-10 03:50:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:02,391 INFO L93 Difference]: Finished difference Result 1260 states and 1679 transitions. [2019-09-10 03:50:02,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-10 03:50:02,391 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 440 [2019-09-10 03:50:02,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:02,394 INFO L225 Difference]: With dead ends: 1260 [2019-09-10 03:50:02,395 INFO L226 Difference]: Without dead ends: 1260 [2019-09-10 03:50:02,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3428 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=2679, Invalid=17627, Unknown=0, NotChecked=0, Total=20306 [2019-09-10 03:50:02,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-09-10 03:50:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1230. [2019-09-10 03:50:02,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-09-10 03:50:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1648 transitions. [2019-09-10 03:50:02,413 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1648 transitions. Word has length 440 [2019-09-10 03:50:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:02,414 INFO L475 AbstractCegarLoop]: Abstraction has 1230 states and 1648 transitions. [2019-09-10 03:50:02,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-10 03:50:02,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1648 transitions. [2019-09-10 03:50:02,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-09-10 03:50:02,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:02,419 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:02,419 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:02,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:02,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1490931826, now seen corresponding path program 1 times [2019-09-10 03:50:02,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:02,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:02,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:02,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:02,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-10 03:50:02,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:02,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:50:02,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:02,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:50:02,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:50:02,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:50:02,611 INFO L87 Difference]: Start difference. First operand 1230 states and 1648 transitions. Second operand 6 states. [2019-09-10 03:50:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:02,648 INFO L93 Difference]: Finished difference Result 1276 states and 1721 transitions. [2019-09-10 03:50:02,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:50:02,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 440 [2019-09-10 03:50:02,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:02,653 INFO L225 Difference]: With dead ends: 1276 [2019-09-10 03:50:02,653 INFO L226 Difference]: Without dead ends: 1276 [2019-09-10 03:50:02,654 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:50:02,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2019-09-10 03:50:02,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1235. [2019-09-10 03:50:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2019-09-10 03:50:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1652 transitions. [2019-09-10 03:50:02,674 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1652 transitions. Word has length 440 [2019-09-10 03:50:02,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:02,675 INFO L475 AbstractCegarLoop]: Abstraction has 1235 states and 1652 transitions. [2019-09-10 03:50:02,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:50:02,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1652 transitions. [2019-09-10 03:50:02,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-09-10 03:50:02,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:02,680 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:02,680 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:02,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:02,680 INFO L82 PathProgramCache]: Analyzing trace with hash -278539788, now seen corresponding path program 1 times [2019-09-10 03:50:02,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:02,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:02,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:02,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:02,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-10 03:50:02,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:02,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:50:02,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:02,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:50:02,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:50:02,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:50:02,867 INFO L87 Difference]: Start difference. First operand 1235 states and 1652 transitions. Second operand 6 states. [2019-09-10 03:50:02,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:02,906 INFO L93 Difference]: Finished difference Result 1315 states and 1780 transitions. [2019-09-10 03:50:02,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:50:02,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 440 [2019-09-10 03:50:02,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:02,911 INFO L225 Difference]: With dead ends: 1315 [2019-09-10 03:50:02,911 INFO L226 Difference]: Without dead ends: 1315 [2019-09-10 03:50:02,911 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:50:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2019-09-10 03:50:02,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1245. [2019-09-10 03:50:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1245 states. [2019-09-10 03:50:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1662 transitions. [2019-09-10 03:50:02,933 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1662 transitions. Word has length 440 [2019-09-10 03:50:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:02,933 INFO L475 AbstractCegarLoop]: Abstraction has 1245 states and 1662 transitions. [2019-09-10 03:50:02,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:50:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1662 transitions. [2019-09-10 03:50:02,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-10 03:50:02,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:02,938 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:02,939 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:02,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:02,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1871472743, now seen corresponding path program 1 times [2019-09-10 03:50:02,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:02,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:02,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:02,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:02,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-10 03:50:03,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:50:03,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:50:03,136 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 410 with the following transitions: [2019-09-10 03:50:03,136 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [739], [742], [745], [747], [750], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [811], [814], [817], [819], [822], [825], [827], [830], [833], [835], [838], [841], [843], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1269], [1271], [1274], [1285], [1287], [1289], [1293], [1301], [1304], [1305], [1306], [1316], [1318], [1320], [1321], [1322], [1331], [1334], [1337], [1343], [1346], [1365], [1378], [1391], [1404], [1417], [1430], [1443], [1456], [1469], [1482], [1495], [1508], [1521], [1527], [1537], [1539], [1541], [1542], [1543], [1553], [1555], [1557], [1558], [1559], [1560], [1574], [1576], [1696], [1697], [1716], [1717], [1718], [1722], [1723], [1724], [1725], [1726], [1727], [1728], [1729], [1730], [1731], [1732], [1733], [1734], [1735], [1736], [1737], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1754], [1755], [1756], [1758], [1759], [1760], [1761], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1818], [1819], [1820] [2019-09-10 03:50:03,139 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:50:03,139 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:50:03,336 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:50:03,337 INFO L272 AbstractInterpreter]: Visited 271 different actions 417 times. Never merged. Never widened. Performed 3498 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3498 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:50:03,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:03,337 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:50:03,808 INFO L227 lantSequenceWeakener]: Weakened 385 states. On average, predicates are now at 77.52% of their original sizes. [2019-09-10 03:50:03,808 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:50:24,986 INFO L420 sIntCurrentIteration]: We unified 408 AI predicates to 408 [2019-09-10 03:50:24,986 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:50:24,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:50:24,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [188] imperfect sequences [4] total 190 [2019-09-10 03:50:24,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:24,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-09-10 03:50:24,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-09-10 03:50:24,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2548, Invalid=32608, Unknown=0, NotChecked=0, Total=35156 [2019-09-10 03:50:24,992 INFO L87 Difference]: Start difference. First operand 1245 states and 1662 transitions. Second operand 188 states.